Orthogonal matching pursuit for sparse signal recovery with noise

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4680-4688

  Cai, T Tony ^a   Wang, Lie ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

1 minimization; compressed sensing; mutual incoherence; orthogonal matching pursuit (OMP); signal reconstruction; support recovery

Indexed keywords

COMPRESSED SENSING; DATA DRIVEN; HIGH PROBABILITY; HIGH-DIMENSIONAL; ITERATIVE GREEDY ALGORITHM; LINEAR MEASUREMENTS; MUTUAL INCOHERENCE; ORTHOGONAL MATCHING PURSUIT; SPARSE SIGNALS; STOPPING RULE;

ALGORITHMS; SIGNAL RECONSTRUCTION;

RECOVERY;

EID: 79959566409     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2146090     Document Type: Article

References (19)

1. P. Bickel, Y. Ritov, and A. Tsybakov, "Simultaneous analysis of Lasso and Dantzig selector," Ann. Statist., vol. 37, pp. 1705-1732, 2009.
2. A. Barron, A. Cohen, W. Dahmen, and R. DeVore, "Approximation and learning by greedy algorithms," Ann. Statist., vol. 36, pp. 64-94, 2008.
3. T. Cai, L. Wang, and G. Xu, "Stable recovery of sparse signals and an oracle inequality," IEEE Trans. Inf. Theory, vol. 56, pp. 3516-3522, 2010a.
4. T. Cai, L. Wang, and G. Xu, "New bounds for restricted isometry constants," IEEE Trans. Inf. Theory, vol. 56, pp. 4388-4394, 2010b.
5. 1 minimization," IEEE Trans. Inf. Theory., vol. 55, pp. 3388-3397, 2009.
6. E. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, pp. 4203-4215, 2005. (Pubitemid 41800353)
7. E. Candes and T. Tao, "The Dantzig selector: Statistical estimation when P is much larger than n," Ann. Statist., vol. 35, pp. 2313-2351, 2007.
8. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, pp. 33-61, 1998. (Pubitemid 128689501)
9. G. Davis, S. Mallat, and M. Avellaneda, "Greedy adaptive approximation," J. Constr. Approx., vol. 13, pp. 57-98, 1997.
10. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory., vol. 52, pp. 6-18, 2006. (Pubitemid 43263116)
11. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory., vol. 47, pp. 2845-2862, 2001. (Pubitemid 33053488)
12. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Statist., vol. 32, pp. 407-451, 2004.
13. K. Lounici, "Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators," Electronic Journal of Statistics, vol. 2, pp. 90-102, 2008.
14. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., vol. 26, pp. 301-321, 2008.
15. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc. Ser. B, vol. 58, pp. 267-288, 1996.
16. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, pp. 2231-2242, 2004.
17. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 51, pp. 1030-1051, 2006. (Pubitemid 46444890)
18. T. Zhang, "On the consistency of feature selection using greedy least squares regression," J. Machine Learning Res., vol. 10, pp. 555-568, 2009.
19. P. Zhao and B. Yu, "On model selection consistency of Lasso," J. Machine Learning Res., vol. 7, pp. 2541-2567, 2006.