A probabilistic and RIPless theory of compressed sensing

IEEE Transactions on Information Theory

Volumn 57, Issue 11, 2011, Pages 7235-7254

  Candès, Emmanuel J ^a   Plan, Yaniv ^b  

^a STANFORD UNIVERSITY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

1 minimization; (weak) restricted isometries; Compressed sensing; Dantzig selector; Gross' golfing scheme; LASSO; operator Bernstein inequalities; random matrices; sparse regression

Indexed keywords

(WEAK) RESTRICTED ISOMETRIES; COMPRESSED SENSING; DANTZIG SELECTOR; GROSS' GOLFING SCHEME; LASSO; OPERATOR BERNSTEIN INEQUALITIES; RANDOM MATRICES; SPARSE REGRESSION;

FOURIER ANALYSIS; MATRIX ALGEBRA; RECOVERY; SIGNAL RECONSTRUCTION;

PROBABILITY DISTRIBUTIONS;

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

References (52)

1. R. Ahlswede and A. Winter, "Strong converse for identification via quantum channels," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 569-579, Mar. 2002. (Pubitemid 34239788)
2. B. Bah and J. Tanner, Improved Bounds on Restricted Isometry Constants for Gaussian Matrices 2010 [Online]. Available: http://arxiv.org/abs/1003.3299
3. R. Baraniuk, M. Davenport, R. DeVore, and M.Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol. 28, no. 3, pp. 253-263, 2008.
4. M. Bayati and A. Montanari, The LASSO Risk for Gaussian Matrices 2010 [Online]. Available: http://arxiv.org/abs/1008.2581
5. P. Bickel, Y. Ritov, and A. Tsybakov, "Simultaneous analysis of Lasso and Dantzig selector," Ann. Statist., vol. 37, no. 4, pp. 1705-1732, 2009.
6. J. Bourgain, J. Lindenstrauss, and V. Milman, "Approximation of zonoids by zonotopes," Acta. Math., vol. 162, no. 1, pp. 73-141, 1989.
7. T. T. Cai, L. Wang, and G. Xu, "New bounds for restricted isometry constants," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4388-4394, Sep. 2010.
8. E. J. Candès, "The restricted isometry property and its implications for compressed sensing," C. R. Math. Acad. Sci. Paris, Ser. I, vol. 346, pp. 589-592, 2008.
9. E. J. Candès and Y. Plan, "Near-ideal model selection by l1 minimization," Ann. Statist., vol. 37, pp. 2145-2177, 2009.
10. E. J. Candès, Y. Plan, and J. A. Tropp, Personal Communication 2010.
11. E. J. Candès and J. Romberg, "Sparsity and incoherence in compressive sampling," Inverse Probl., vol. 23, no. 3, pp. 969-985, 2007. (Pubitemid 46838836)
12. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
13. E. J. Candès, J. K. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Comm. Pure Appl. Math, vol. 59, no. 8, p. 1207, 2006.
14. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
15. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
16. E. J. Candès and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n ," Ann. Statist., vol. 35, no. 6, pp. 2313-2351, Jun. 2007.
17. E. J. Candes and J. Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions," Found. Comp. Math., vol. 6, no. 2, pp. 227-254, 2006. (Pubitemid 43824483)
18. B. Carl, "Inequalities of Bernstein-Jackson type and the degree of compactness of operators in Banach spaces," Ann. Inst. Fourier, vol. 35, no. 3, pp. 79-118, 1985.
19. A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best k-term approximation," J. Amer. Math. Soc., vol. 22, no. 1, pp. 211-231, 2009.
20. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
21. D. L. Donoho, "For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution," Comm. Pure Appl. Math., vol. 59, no. 7, pp. 907-934, 2006.
22. D. L. Donoho, A. Maleki, and A. Montanari, The Noise Sensitivity Phase Transition in Compressed Sensing 2010 [Online]. Available: http://arxiv.org/abs/ 1004.1218
23. M. F. Duarte, M. A. Davenport, D. Takhar, J. N. Laska, T. Sun, K. F. Kelly, and R. G. Baraniuk, "Single-pixel imaging via compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 83-91, 2008.
24. S. Foucart, "A note on guaranteed sparse recovery via l1-minimization," Appl. Comput. Harmon. Anal., vol. 29, no. 1, pp. 97-103, 2010.
25. A. Gilbert and P. Indyk, "Sparse recovery using sparse matrices," Proc. IEEE, vol. 98, no. 6, pp. 937-947, Jun. 2010.
26. D. Gross, Recovering Low-Rank Matrices From Few Coefficients in Any Basis 2009 [Online]. Available: http://arxiv.org/abs/0910.1879
27. O. Guédon, S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Majorizing measures and proportional subsets of bounded orthonormal systems," Revista matemática iberoamericana, vol. 24, no. 3, pp. 1075-1095, 2008.
28. J. Haupt, W. U. Bajwa, G. Raz, and R. Nowak, "Toeplitz compressed sensing matrices with applications to sparse channel estimation," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5862-5875, Nov. 2010.
29. S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank, "Efficient and robust compressed sensing using optimized expander graphs," IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4299-4308, Sep. 2009.
30. M. Ledoux and M. Talagrand, Probability in Banach Spaces: Isoperimetry and Processes. New York: Springer, 1991.
31. C. McDiarmid, Concentration. Probabilistic Methods for Algorithmic Discrete Mathematics. New York: Springer, 1998.
32. R. I. Oliveira, "Sums of random Hermitian matrices and an inequality by Rudelson," Electron. J. Probab., vol. 15, pp. 203-212, 2010.
33. A. Pajor and N. Tomczak-Jaegermann, "Subspaces of small codimension of finite-dimensional Banach spaces," Proc. Amer. Math. Soc., vol. 97, no. 4, pp. 637-642, 1986.
34. G. E. Pfander and H. Rauhut, "Sparsity in time-frequency representations," J. Fourier Anal. and Appl., vol. 16, no. 2, pp. 233-260, 2010.
35. Y. Plan, "Compressed Sensing, Sparse Approximation, and Low-rank Matrix Estimation," Ph.D. dissertation, California Institute of Technology, Pasadena, CA, 2011.
36. D. Pollard, Convergence of Stochastic Processes. New York: Springer, 1984.
37. M. Raginsky, S. Jafarpour, Z. Harmany, R. Marcia, R. Willett, and R. Calderbank, Performance Bounds for Expander-Based Compressed Sensing in Poisson Noise [Online]. Available: http://arxiv.org/abs/1007.2377
38. H. Rauhut, "Random sampling of sparse trigonometric polynomials," Appl. Comput. Harmon. Anal., vol. 22, no. 1, pp. 16-42, 2007. (Pubitemid 44750724)
39. H. Rauhut, "Stability results for random sampling of sparse trigonometric polynomials," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5661-5670, Dec. 2008.
40. H. Rauhut, "Circulant and toeplitz matrices in compressed sensing," in Proc. SPARS'09, Saint-Malo, France, 2009.
41. H. Rauhut, "Compressive sensing and structured random matrices," Theoret. Found. Numer. Meth. for Sparse Recov., vol. 9, pp. 1-92, 2010.
42. H. Rauhut, J. Romberg, and J. A. Tropp, Restricted Isometries for Partial Random Circulant Matrices 2010, Preprint.
43. J. Romberg, "Compressive sensing by random convolution," SIAM J. Imag. Sci., vol. 2, no. 4, pp. 1098-1128, 2009.
44. M. Rudelson, "Almost orthogonal submatrices of an orthogonal matrix," Israel J. Math., vol. 111, no. 1, pp. 143-155, 1999.
45. M. Rudelson, "Random vectors in the isotropic position," J. Funct. Anal., vol. 164, no. 1, pp. 60-72, 1999.
46. M. Rudelson and R. Vershynin, "On sparse reconstruction from Fourier and Gaussian measurements," Commun. Pure Appl. Math., vol. 61, no. 8, pp. 1025-1045, 2008.
47. M. Talagrand, "Majorizing measures: The generic chaining," Ann. Prob., vol. 24, no. 3, pp. 1049-1103, 1996.
48. J. A. Tropp, User-Friendly Tail Bounds for Matrix Martingales 2010 [Online]. Available: http://arxiv.org/abs/1004.4389
49. S. A. van de Geer and P. Bühlmann, "On the conditions used to prove oracle results for the Lasso," Electron. J. Stat., vol. 3, pp. 1360-1392, 2009.
50. P. Wojtaszczyk, "Stability and instance optimality for Gaussian measurements in compressed sensing," Found. Comput. Math., vol. 10, no. 1, pp. 1-13, 2009.
51. T. Zhang, "Some sharp performance bounds for least squares regression with L1 regularization," Ann. Statist., vol. 37, no. 5A, pp. 2109-2144, 2009.
52. Y. Zhang, Theory of Compressive Sensing via l1 Minimization: A Non-Rip Analysis and Extensions Rice University, Houston, TX, Tech. Rep., 2008. [Online]. Available: http://www.caam.rice.edu/~zhang/reports/tr0811-revised.pdf