Sparse Signals Recovery from Noisy Measurements by Orthogonal Matching Pursuit

Recently, many practical algorithms have been proposed to recover the sparse signal from fewer measurements. Orthogonal matching pursuit (OMP) is one of the most effective algorithm. In this paper, we use the restricted isometry property to analysis the algorithm. We show that, under certain conditions based on the restricted isometry property and the signals, OMP will recover the support of the sparse signal when measurements are corrupted by additive noise.

[1]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[2]  S. Mallat,et al.  Adaptive greedy approximations , 1997 .

[3]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[4]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[6]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[7]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

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

[9]  Tong Zhang,et al.  On the Consistency of Feature Selection using Greedy Least Squares Regression , 2009, J. Mach. Learn. Res..

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

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

[12]  Massimo Fornasier,et al.  Compressive Sensing and Structured Random Matrices , 2010 .

[13]  Yonina C. Eldar,et al.  Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise , 2009, IEEE Transactions on Signal Processing.

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

[15]  Lie Wang,et al.  New Bounds for Restricted Isometry Constants , 2009, IEEE Transactions on Information Theory.

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

[17]  Lie Wang,et al.  Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise , 2011, IEEE Transactions on Information Theory.

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

[19]  Holger Rauhut,et al.  Compressive Sensing with structured random matrices , 2012 .

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

[21]  Frank de Hoog,et al.  Coherence and RIP Analysis for Greedy Algorithms in Compressive Sensing , 2013, ArXiv.

[22]  Wei Huang,et al.  The Exact Support Recovery of Sparse Signals With Noise via Orthogonal Matching Pursuit , 2013, IEEE Signal Processing Letters.