On the impossibility of uniform sparse reconstruction using greedy methods

Sampling Theory in Signal and Image Processing

Volumn 7, Issue 2, 2008, Pages 197-215

  Rauhut, Holger ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Compressed sensing; Greedy algorithms; Orthogonal matching pursuit; Random sampling; Sparse recovery; Thresholding; Trigonometric polynomials

Indexed keywords

EID: 49249108566     PISSN: 15306429     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx., to appear.
2. E. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52(2), 489-509, 2006.
3. E. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59(8), 1207-1223, 2006.
4. E. Candès and T. Tao, Near optimal signal recovery from random projections: universal encoding strategies?, IEEE Trans. Inform. Theory, 52(12), 5406-5425, 2006.
5. S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by Basis Pursuit, SIAM J. Sci. Comput., 20(1), 33-61, 1999.
6. A. Cohen, W. Dahmen, and R. DeVore, Compressed sensing and best k-term approximation, preprint,
7. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52(4), 1289-1306, 2006.
8. 1 solution is also the sparsest solution, Commun. Pure Appl. Anal., 59(6), 797-829, 2006.
9. A. C. Gilbert and J. A. Tropp, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Trans. Inform. Theory, 53(12), 4655-4666, 2007.
10. S. Kunis and H. Rauhut, Random sampling of sparse trigonometric polynomials II - orthogonal matching pursuit versus basis pursuit, Found. Comput. Math., to appear.
11. D. Needell and R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, preprint, 2007.
12. H. Rauhut, Stability results for random sampling of sparse trigonometric polynomials, IEEE, Trans. Inform. Theory, to appear.
13. H. Rauhut, Random sampling of spaxse trigonometric polynomials, Appl. Comput. Harmon. Anal., 22(1), 16-42, 2007.
14. M. Rudelson and R. Vershynin, Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. In Proc. CISS 2006 (40th Annual Conference on Information Sciences and Systems), 2006.
15. M. Rudelson and R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Comm. Pure Appl. Math., to appear.
16. J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50(10), 2231-2242, 2004.