Sparse recovery with orthogonal matching pursuit under RIP

IEEE Transactions on Information Theory

Volumn 57, Issue 9, 2011, Pages 6215-6221

  Zhang, Tong ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Estimation theory; feature selection; greedy algorithms; sparse recovery; statistical learning

Indexed keywords

COMPRESSED SENSING; ESTIMATION THEORY; GREEDY ALGORITHMS; MEASUREMENT NOISE; ORTHOGONAL MATCHING PURSUIT; RANDOM PROJECTIONS; SPARSE RECOVERY; STATISTICAL LEARNING;

ALGORITHMS; FEATURE EXTRACTION; MATRIX ALGEBRA;

RECOVERY;

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

References (19)

1. P. Bechler and P. Wojtaszczyk, "Error estimates for orthogonal matching pursuit and random dictionaries", Construct. Approx., 2010, to appear.
2. T. Blumensath and M. E. Davies, "Gradient pursuit for non-linear sparse signal modelling", in Proc. Eur. Signal Processing Conf. (EUSIPCO), Lausanne, Switzerland, Aug. 2008.
3. E. J. Candes and T. Tao, "Decoding by linear programming", IEEE Trans. Inf. Theory, vol. 51, no. 12, 4203-4215, Dec. 2005.
4. M. A. Davenport and M. B. Wakin, "Analysis of orthogonal matching pursuit using the restricted isometry property", IEEE Trans. Inf. Theory, vol. 56, no. 9, 4395-4401, Sep. 2010.
5. 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, no. 1, 6-18, Jan. 2006.
6. A. Fletcher and S. Rangan, "Orthogonal matching pursuit from noisy random measurements: A new analysis", in Advances in Neural Information Processing Systems 22 Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds., pp. 540-548, 2009.
7. J. Huang, T. Zhang, and D. Metaxas, Learning With Structured Sparsity Rutgers University, Tech. Rep., Jan. 2009 [Online]. Available: http://arxiv.org/abs/0903.3002
8. E. Liu and V. N. Temlyakov, Orthogonal Super Greedy Algorithm and Application in Compressed Sensing 2010, Preprint.
9. E. Livshitz, On Efficiency of Orthogonal Matching Pursuit 2010, Preprint.
10. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples", Appl. and Comput. Harmonic Anal, vol. 26, no. 3, pp. 301-321, 2008.
11. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit", Found. Comput. Mathemat., vol. 9, no. 3, pp. 317-334, 2009.
12. H. Rauhut, "On the impossibility of uniform sparse reconstruction using greedy methods", Sampl. Theory Signal Image Process., vol. 7, no. 2, 197-215, Feb. 2008.
13. S. Shalev-Shwartz, N. Srebro, and T. Zhang, "Trading accuracy for sparsity in optimization problems with sparsity constraints", SIAM J. Optimiz., vol. 20, pp. 2807-2832, 2010.
14. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation", IEEE Trans. Inf. Theory, vol. 50, no. 10, 2231-2242, Oct. 2004.
15. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit", IEEE Trans. Inf. Theory, vol. 53, no. 12, 4655-4666, Dec. 2007.
16. M. Warmuth, J. Liao, and G. Ratsch, "Totally corrective boosting algorithms that maximize the margin", in Proc. 23rd Int. Conf. Machine Learning, 2006.
17. C.-H. Zhang and J. Huang, "The sparsity and bias of the lasso selection in high-dimension al linear regression", Ann. Statist., vol. 36, no. 4, pp. 1567-1594, 2008.
18. T. Zhang, "On the consistency of feature selection using greedy least squares regression", J. Mach. Learn. Res., vol. 10, pp. 555-568, 2009.
19. 1 regularization", Ann. Statist., vol. 37, no. 5 A, pp. 2109-2144, 2009.