Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

Foundations of Computational Mathematics

Volumn 9, Issue 3, 2009, Pages 317-334

  Needell, Deanna ^a   Vershynin, Roman ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Basis pursuit; Compressed sensing; Orthogonal matching pursuit; Restricted isometry condition; Signal recovery; Signal recovery algorithms; Sparse approximation; Uncertainty principle

Indexed keywords

BASIS PURSUITS; ORTHOGONAL MATCHING PURSUIT; RESTRICTED ISOMETRIES; SIGNAL RECOVERY; SPARSE APPROXIMATIONS; UNCERTAINTY PRINCIPLES;

APPROXIMATION ALGORITHMS; COMPRESSED SENSING; SIGNAL RECONSTRUCTION;

UNCERTAINTY ANALYSIS;

EID: 64749092799     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-008-9031-3     Document Type: Article

References (21)

1. E. Candès, Compressive sampling, in Proceedings of International Congress of Mathematics, vol. 3, Madrid, Spain, 2006, pp. 1433-1452.
2. E. Candès J. Romberg T. Tao 2006 Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inf. Theory 52 489 509
3. E. Candès T. Tao 2004 Near-optimal signal recovery from random projections: universal encoding strategies IEEE Trans. Inf. Theory 52 5406 5425
4. E.J. Candès T. Tao 2005 Decoding by linear programming IEEE Trans. Inf. Theory 51 4203 4215
5. A. Cohen, W. Dahmen, R. DeVore, Compressed sensing and k-term approximation, Manuscript (2007).
6. Compressed sensing, webpage, http://www.dsp.ece.rice.edu/cs/.
7. D. Donoho 2006 Compressed sensing IEEE Trans. Inf. Theory 52 1289 1306
8. D. Donoho M. Elad V. Temlyakov 2006 Stable recovery of sparse overcomplete representations in the presence of noise IEEE Trans. Inf. Theory 52 6 18
9. D. Donoho M. Elad V. Temlyakov 2007 On the Lebesgue type inequalities for greedy approximation J. Approx. Theory 147 185 195
10. D. Donoho P. Stark 1989 Uncertainty principles and signal recovery SIAM J. Appl. Math. 49 906 931
11. A. Gilbert, S. Muthukrishnan, M. Strauss, Approximation of functions over redundant dictionaries using coherence, in The 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003).
12. 1 Norm for Sparse Vectors, Allerton, 2006. 44th Annual Allerton Conference on Communication, Control, and Computing.
13. A. Gilbert, M. Strauss, J. Tropp, R. Vershynin, One sketch for all: fast algorithms for compressed sensing, in STOC 2007. 39th ACM Symposium on Theory of Computing, San Diego, 2007, to appear.
14. Y. Lyubarskii, R. Vershynin, Uncertainty principles and vector quantization, submitted.
15. S. Mendelson, A. Pajor, N. Tomczak-Jaegermann, Uniform uncertainty principle for Bernoulli and subgaussian ensembles, Constr. Approx., submitted.
16. H. Rauhut, On the impossibility of uniform recovery using greedy methods, in Sample Theory Signal Image Process., to appear.
17. M. Rudelson, R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Commun. Pure Appl. Math., to appear. Conference version in CISS 2006. 40th Annual Conference on Information Sciences and Systems, Princeton.
18. D. Spielman S.-H. Teng 2004 Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time J. ACM 51 385 463
19. V. Temlyakov 2003 Nonlinear methods of approximation Found. Comput. Math. 3 33 107
20. J.A. Tropp A.C. Gilbert 2007 Signal recovery from random measurements via orthogonal matching pursuit IEEE Trans. Inf. Theory 53 12 4655 4666
21. R. Vershynin, Beyond Hirsch Conjecture: walks on random polytopes and smoothed complexity of the simplex method, submitted. Conference version in FOCS 2006. 47th Annual Symposium on Foundations of Computer Science, Berkeley, pp. 133-142.