Precise stability phase transitions for ℓ1 minimization: A unified geometric framework

IEEE Transactions on Information Theory

Volumn 57, Issue 10, 2011, Pages 6894-6919

  Xu, Weiyu ^a   Hassibi, Babak ^b  

^a School of Operations Research and Industrial Engineering   (United States)

^b California Institute of Technology   (United States)

Author keywords

1 minimization; Compressed sensing; convex geometry; Grassmann angle; phase transition; robustness; sparse recovery; stability

Indexed keywords

BALANCEDNESS; COMPRESSED SENSING; CONVEX GEOMETRY; FUNDAMENTAL PROPERTIES; GEOMETRIC FRAMEWORK; GRASSMANN ANGLE; LINEAR SUBSPACE; NOISY MEASUREMENTS; NULL SPACE; PERFORMANCE BOUNDS; POLYTOPES; SHARP BOUNDS; SIGNAL RECOVERY; SIGNAL VECTORS; SPARSE RECOVERY; SPARSE SIGNALS; SUFFICIENT CONDITIONS; UNDER-DETERMINED; UNIFIED FRAMEWORK;

GEOMETRY; LINEAR SYSTEMS; MATRIX ALGEBRA; RECOVERY; SIGNAL RECONSTRUCTION; VECTORS;

PHASE STABILITY;

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

References (45)

1. F. Affentranger and R. Schneider, "Random projections of regular simplices," Discrete Comput. Geom., vol. 7, no. 3, pp. 219-226, 1992.
2. J. D. Blanchard, C. Cartis, and J. Tanner, "Compressed sensing: How sharp is the restricted isometry property?," SIAM Rev., vol. 53, no. 1, pp. 105-125, 2011.
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. U. Betke and M. Henk, "Intrinsic volumes and lattice points of crosspolytopes," Monatshefte fr Mathematik, vol. 115, no. 1-2, pp. 27-33, 1993.
5. W. M. Boothby, An Introduction to Differential Manifolds and Riemannian Geometry, 2nd ed. San Diego, CA: Springer-Verlag, Academic, 1986.
6. E. J. Candès, "Compressive sampling," in International Congress of Mathematicians, 2006, vol. III, pp. 1433-1452, Eur. Math. Soc., Zürich.
7. A. Cohen,W. Dahmen, and R. DeVore, "Compressed sensing and best -term approximation," J. Amer. Math. Soc., vol. 22, no. 2009, pp. 211-231, 2008.
8. J. F. Claerbout and F.Muir, "Robust modeling with erratic data," Geophysics, vol. 38, no. 5, pp. 826-844, 1973.
9. E. J. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccuratemeasurements," Commun. of Pure and Appl. Math., vol. 59, pp. 1207-1223, 2005.
10. 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.
11. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory , vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
12. D. Donoho, A.Maleki, and A.Montanari, "The noise-sensitivity phase transition in compressed sensing," arXiv:1004.1218 2010.
13. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
14. D. Donoho, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension," Discrete and Comput. Geom., vol. 35, no. 4, pp. 617-652, 2006.
15. D. L. Donoho and J. Tanner, "Neighborliness of randomly projected simplices in high dimensions," in Proc. Natl. Acad. Sci. USA, 2005, vol. 102, no. 27, pp. 9452-9457.
16. D. Donoho and J. Tanner, "Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing," Philosoph. Trans. of the Roy. Soc. A, vol. 367, pp. 4273-4293, 2009.
17. A. Feuer and A. Nemirovski, "On sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 49, no. 6, pp. 1579-1581, Jun. 2003.
18. S. Geman, "A limit theorem for the norm of random matrices," Ann. Probabil., vol. 8, no. 2, pp. 252-261, 1980.
19. B. Grünbaum, "Grassmann angles of convex polytopes," Acta Math., vol. 121, pp. 293-302, 1968.
20. B. Grönbaum, Convex Polytopes Volume 221 of Graduate Texts in Mathematics, 2nd ed. New York: Springer-Verlag, 2003, Prepared and with a preface by Volker Kaibel, Victor Klee and Gnterü M. Ziegler.
21. H. Hadwiger, "Gitterpunktanzahl im simplex und willssche vermutung," Math. Ann., vol. 239, pp. 271-288, 1979.
22. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inf. Theory.
23. K. Böröczky, Jr. and M. Henk, "Random projections of regular polytopes," Arch. Math. (Basel), vol. 73, no. 6, pp. 465-473, 1999.
24. B. S. Kashin andV.N. Temlyakov, "A remark on compressed sensing," Mathemat. Notes, vol. 82, no. 5, pp. 748-755, Nov. 2007.
25. M. A. Khajehnejad, W. Xu, A. S. Avestimehr, and B. Hassibi, "Weighted minimization for sparse recovery with prior informationn," in Proc. Int. Symp. Information Theory, 2009.
26. N. Linial and I. Novik, "How neighborly can a centrally symmetric polytope be?," Discrete and Comput. Geom., vol. 36, no. 6, pp. 273-281, 2006.
27. P. McMullen, "Non-linear angle-sum relations for polyhedral cones and polytopes," Math. Proc. Cambridge Philos. Soc., vol. 78, no. 2, pp. 247-261, 1975.
28. V. A. Marcenko and L. A. Pastur, "Distributions of eigenvalues for some sets of random matrices," Math. USSR-Sbornik, vol. 1, pp. 457-483, 1967.
29. R. J. Muirhead, Aspects of Multivariate Statistical Theory, 2nd ed. : Wiley-Interscience, 2005.
30. [Online]. Available: http://www.dsp.ece.rice.edu/cs/
31. M. Rudelson and R. Vershynin, "Geometric approach to error correcting codes and reconstruction of signals," International Mathematical Research Notices vol. 64.
32. L. A. Santaló, Rep. Argetina Publ. Com. Nac. Energí Atómica, Ser. Mat 1, No. 1 1952, Geometría integral enespacios de curvatura constante.
33. J. W. Silverstein, "The smallest eigenvalue of a large dimensional wishart matrix," The Annals of Probability, vol. 13, pp. 1364-1368, 1985.
34. M. Stojnic, Various Thresholds for -Optimization in Compressed Sensing [Online]. Available: http://arxiv.org/abs/0907.3666 2009
35. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing-Probabilistic analysis of a null-space characterization," in Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP), 2008.
36. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing of approximately sparse signals," in Proc. IEEE Int. Symp. Information Theory, 2008.
37. J. Tropp, M. Wakin, M. Duarte, D. Baron, and R. Baraniuk, "Random filters for compressive sampling and reconstruction," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, 2006.
38. S. Vavasis, Derivation of Compressive Sensing Theorems for the Spherical Section Property. Waterloo, ON, Canada: University of Waterloo, 2009 [Online]. Available: http://www.student.math.uwaterloo. ca/co769/simplif.pdf, CO 769 lecture notes
39. A. M. Vershik and P. V. Sporyshev, "Asymptotic behavior of the number of faces of randompolyhedra and the neighborliness problem," Selecta Mathemat. Soviet., vol. 11, no. 2, pp. 181-201, 1992.
40. M. Wainwright, Sharp Thresholds for Noisy and High-Dimensional Recovery of Sparsity Using -Constrained Quadratic Programming Department of Statistics, Berkeley, CA, Tech. Rep., 2006.
41. W. Xu and B. Hassibi, "Compressive sensing over the grassmann manifold: A unified analytical framework," in Proc. 46th Ann. Allerton Conf. Communication, Control, and Computing, 2008.
42. W. Xu and B. Hassibi, "On sharp performance bounds for robust sparse signal recoveries," in Proc. Int. Symp. Information Theory, 2009.
43. W. Xu, A. Khajehnejad, A. S. Avestimehr, and B. Hassibi, "Breaking through the thresholds: An analysis for iterative reweighted minimization via the Grassmann angle framework," in Proc. Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), 2010.
44. Y. Zhang, When ismissing data recoverable? 2006 [Online].Available: http://www.caam.rice.edu/zhang/reports/index.html
45. Y. Zhang, Theory of Compressive Sensing Via -Minimization: A Non-Rip Analysis and Extensions 2008 [Online]. Available: http://www.caam.rice.edu/ zhang/reports/index.html