Variable step‐size matching pursuit based on oblique projection for compressed sensing. Issue 4 (19th February 2020)

• Record Type: Journal Article
• Authors: Li, Na; Yin, Xinghui; Guo, Huanyin; Zong, Sulan; Fu, Wei
• Is Part Of: IET image processing. Volume 14:Issue 4(2020)
• Page Start: 766
• Page End: 773
• Publication Date: 2020-02-19
• Subjects: compressed sensing -- image reconstruction -- signal reconstruction -- computational complexity -- greedy algorithms -- iterative methods -- matrix algebra; reconstruction efficiency -- available matching pursuit algorithms -- compressed sensing -- compressive sensing -- sparse signal reconstruction -- greedy algorithms -- satisfactory reconstruction performance -- target signal -- high‐computational expenses -- low‐reconstruction accuracy -- signal sparsity -- novel variable step‐size matching pursuit -- VSMPOP algorithm -- initial sparsity -- restricted isometry property criterion -- oblique projection test -- sensing matrix -- sparsity level -- variable step size -- computational complexity; Image processing -- Periodicals; 621.36705
• DOI: 10.1049/iet-ipr.2019.0916
• Languages: English
• ISSNs: 1751-9659

Abstract

Abstract : The development of compressive sensing has focused on sparse signal reconstruction in recent years. Most existing greedy algorithms achieve satisfactory reconstruction performance only when the sparsity of the target signal has been known as prior information. Moreover, some greedy algorithms always involve either high‐computational expenses or low‐reconstruction accuracy caused by the process of adaptive adjustment of signal sparsity. To address these concerns, a novel variable step‐size matching pursuit based on oblique projection (VSMPOP) for compressed sensing is proposed. The proposed VSMPOP algorithm estimates the initial sparsity based on the restricted isometry property criterion. The algorithm creates a support set of the target signal after a preliminary test and oblique projection test between the sensing matrix and the residual. VSMPOP realises a similar approach to the sparsity level with a variable step size. The experimental results demonstrated that the proposed VSMPOP algorithm provides superior performance in terms of computational complexity and reconstruction efficiency compared with most of the available matching pursuit algorithms.