Improving the Bound on the RIP Constant in Generalized Orthogonal Matching Pursuit

The generalized Orthogonal Matching Pursuit (gOMP) is a recently proposed compressive sensing greedy recovery algorithm which generalizes the OMP algorithm by selecting N( ≥ 1) atoms in each iteration. In this letter, we demonstrate that the gOMP can successfully reconstruct a K-sparse signal from a compressed measurement y=Φx by a maximum of K iterations if the sensing matrix Φ satisfies the Restricted Isometry Property (RIP) of order NK, with the RIP constant δ<sub>NK</sub> satisfying δ<sub>NK</sub> <; √N/√K+2√N. The proposed bound is an improvement over the existing bound on δ<sub>NK</sub>. We also show that by increasing the RIP order just by one (i.e., NK+1 from NK), it is possible to refine the bound further to δ<sub>NK+1</sub> <; √N/√K+√N, which is consistent (for N=1) with the near optimal bound on δ<sub>K+1</sub> in OMP.

[1]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[2]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[3]  Michael B. Wakin,et al.  Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.

[4]  E.J. Candes.  Compressive Sampling , 2022 .

[5]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[6]  Sheng Chen,et al.  Orthogonal least squares methods and their application to non-linear system identification , 1989 .

[7]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[8]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[9]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[10]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[11]  Jian Wang,et al.  On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit , 2012, IEEE Transactions on Signal Processing.

[12]  Yi Shen,et al.  A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[13]  S. Foucart.  A note on guaranteed sparse recovery via ℓ1-minimization , 2010 .

[14]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[15]  D. Donoho,et al.  Basis pursuit , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

[16]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[17]  Entao Liu,et al.  Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing ∗ , 2010 .

[18]  Jian Wang,et al.  Generalized Orthogonal Matching Pursuit , 2011, IEEE Transactions on Signal Processing.

[19]  Massimo Fornasier,et al.  Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.

[20]  Jubo Zhu,et al.  Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP , 2011 .

[21]  Stephen J. Wright,et al.  Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.

[22]  Jun Zhang,et al.  On Recovery of Sparse Signals Via $\ell _{1}$ Minimization , 2008, IEEE Transactions on Information Theory.