On sparse reconstruction from Fourier and Gaussian measurements

Communications on Pure and Applied Mathematics

Volumn 61, Issue 8, 2008, Pages 1025-1045

  Rudelson, Mark ^a   Vershynin, Roman ^a,b  

^a UNIVERSITY OF MISSOURI   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 52349092455     PISSN: 00103640     EISSN: 00103640     Source Type: Journal    
DOI: 10.1002/cpa.20227     Document Type: Article

References (34)

1. Alon, N.; Spencer, J. H. The probabilistic method. 2nd ed. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
2. Candès, E. J. Compressive sampling. International Congress of Mathematicians, vol. 3, 1433-1452. European Mathematical Society, Zürich, 2006.
3. Candès, E. J.; Romberg, J. Quantitative robust uncertainty principles and optimally sparse decompositions. Found. Comput. Math. 6 (2006), no. 2, 227-254.
4. Candès, E. J.; Romberg, J.; Tao, T. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52 (2006), no. 2, 489-509.
5. Candès, E. J.; Rudelson, M.; Tao, T.; Vershynin, R. Error correction via linear programming. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 295-308. Institute of Electrical and Electronic Engineers, Los Alamitos, Calif., 2005.
6. Candès, E. J.; Tao, T. Decoding by linear programming. IEEE Trans. Inform. Theory 51 (2005), no. 12, 4203-4215.
7. Candès, E. J.; Tao, T. Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52 (2006), no. 12, 5406-5425.
8. Candès, E. J.; Tao, T. The Dantzig selector: statistical estimation when p is much larger than n. Ann. Statist., in press. Available at: arXiv:math/0506081, 2005.
9. Carl, B. Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces. Ann. Inst. Fourier (Grenoble) 35 (1985), no. 3, 79-118.
10. Chen, S. S.; Donoho, D. L.; Saunders, M. A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20 (1998), no. 1, 33-61 (electronic); reprinted in SIAM Rev. 43 (2001), no. 1, 129-159 (electronic).
11. Compressed Sensing Resources, http://www.dsp.ece.rice.edu/cs/
12. 1-norm near-solution approximates the sparsest near-solution. Comm. Pure Appl. Math. 59 (2006), no. 7, 907-934.
13. 1-norm solution is also the sparsest solution. Comm. Pure Appl. Math. 59 (2006), no. 6, 797-829.
14. 1 minimization. Proc. Natl. Acad. Sci. USA 100 (2003), no. 5, 2197-2202 (electronic).
15. Donoho, D. L.; Elad, M.; Temlyakov, V. N. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52 (2006), no. 1, 6-18.
16. Donoho, D. L.; Huo, X. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory 47 (2001), no. 7, 2845-2862.
17. Donoho, D. L.; Stark, P. B. Uncertainty principles and signal recovery. SIAM J. Appl. Math. 49 (1989), no. 3, 906-931.
18. Donoho, D. L.; Tanner, J. Counting faces of randomly-projected polytopes when the projection radically lowers dimension. arXiv:math/0607364, 2006.
19. Donoho, D. L.; Tsaig, Y. Extensions of compressed sensing. Signal Processing 86 (2006), no. 3, 549-571.
20. Elad, M.; Bruckstein, A. M. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. Inform. Theory 48 (2002), no. 9, 2558-2567.
21. Feuer, A.; Nemirovski, A. On sparse representation in pairs of bases. IEEE Trans. Inform. Theory 49 (2003), no. 6, 1579-1581.
22. Garnaev, A. Yu.; Gluskin, E. D. The widths of a Euclidean ball. Dokl. Akad. Nauk SSSR 277 (1984), no. 5, 1048-1052.
23. Gribonval, R.; Nielsen, M. Sparse representations in unions of bases. IEEE Trans. Inform. Theory 49 (2003), no. 12, 3320-3325.
24. n. Geometric aspects of functional analysis (1986/87), 84-106. Lecture Notes in Mathematics, 1317. Springer, Berlin, 1988.
25. Ledoux, M.; Talagrand, M. Probability in Banach spaces, Isoperimetry and processes. Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 23. Springer, Berlin, 1991.
26. Mendelson, S.; Pajor, A.; Tomczak-Jaegermann, N. Reconstruction and subgaussian operators. arXiv:math/0506239v1, 2005.
27. Pisier, G. The volume of convex bodies and Banach space geometry. Cambridge Tracts in Mathematics, 94. Cambridge University Press, Cambridge, 1989.
28. Rudelson, M. Approximate John's decompositions. Geometric aspects of functional analysis (Israel, 1992-1994), 245-249. Operator Theory: Advances and Applications, 77. Birkhäuser, Basel, 1995.
29. Rudelson, M. Random vectors in the isotropic position. J. Funct. Anal. 164 (1999), no. 1, 60-72.
30. Rudelson, M.; Vershynin, R. Geometric approach to error-correcting codes and reconstruction of signals. Int. Math. Res. Not. 2005, no. 64, 4019-4041.
31. Rudelson, M.; Vershynin, R. Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. 2006 40th Annual Conference on Information Sciences and Systems, 207-212. Princeton, N.J., 2006.
32. Tropp, J. A. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 (2004), no. 10, 2231-2242.
33. 1 minimization. IEEE Trans. Inform. Theory 51 (2005), no. 4, 1568-1570.
34. Tropp, J. A. Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inform. Theory 52 (2006), no. 3, 1030-1051.