Fundamental thresholds in compressed sensing: A high-dimensional geometry approach

Compressed Sensing: Theory and Applications

Volumn , Issue , 2009, Pages 305-347

  Xu, Weiyu ^a   Hassibi, Babak ^b  

^a Department of Obstetrics Gynecology   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING; GEOMETRY; ITERATIVE METHODS; RECOVERY; SIGNAL PROCESSING;

BROAD APPLICATION; COMPRESSIVE SENSING; EXPONENTIAL COMPLEXITY; GEOMETRIC FRAMEWORK; MEASUREMENT MATRIX; MINIMIZATION ALGORITHMS; PHASE TRANSITION PHENOMENON; SPECIAL STRUCTURE;

SIGNAL RECONSTRUCTION;

EID: 84924857863     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511794308.008     Document Type: Chapter

References (46)

1. F. Affentranger and R. Schneider. Random projections of regular simplices. Discrete Comput Geom, 7(3):219-226, 1992.
2. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin. A simple proof of the restricted isometry property for random matrices. Construe Approx, 28(3):253-263, 2008.
3. U. Betke and M. Henk. Intrinsic volumes and lattice points of crosspolytopes. Monatfur Math, 115(1-2):27-33, 1993.
4. J. Blanchard, C. Cartis, and J. Tanner. Compressed sensing: How sharp is the restricted isometry property? 2009. www.maths.ed.ac.uk/tanner/.
5. W. M. Boothby. An Introduction to Differential Manifolds and Riemannian Geometry. Springer-Verlag, 1986. 2nd edn. San Diego, CA: Academic Press.
6. K. Boroczky and M. Henk. Random projections of regular polytopes. Arch Math (Basel), 73(6):465-473, 1999.
7. E. J. Candes. Compressive sampling. In Int Congr Math. Vol. III: 1433-1452. Eur. Math. Soc., Zurich, 2006.
8. E. J. Candes and P. Randall. Highly robust error correction by convex programming. IEEE Trans Inform Theory, 54:2829-2840, 2008.
9. E. J. Candes, 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.
10. E. J. Candes, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Commun PureAppl Math, 59:1208-1223, 2006.
11. E. J. Candes and T. Tao. Decoding by linear programming. IEEE Trans Inform Theory, 51(12):4203-4215, 2005.
12. E. J. Candes, M. P. Wakin, and S. P. Boyd. Enhancing sparsity by reweighted minimization. J Fourier Anal Appl, 14(5):877-905, 2008.
13. J. F. Claerbout and F. Muir. Robust modeling with erratic data. Geophysics, 38(5):826-844, 1973.
14. A. Cohen, W. Dahmen, and R. DeVore. Compressed sensing and best fc-term approximation. J Am Math Soc, 22:211-231, 2008.
15. D. Donoho. High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension. Discrete Comput Geom, 35(4):617-652, 2006.
16. D. Donoho, A. Maleki, and A. Montanari. The noise-sensitivity phase transition in compressed sensing. arXiv:1004.1218, 2010.
17. D. Donoho, A. Maleki, and A. Montanari. Message passing algorithms for compressed sensing. In Proc Nat Acad Sci (PNAS), November 2009.
18. D. Donoho and J. Tanner. Observed universality of phase transitions in high-dimensional geometry. Phil Trans Roy Soc A, 367:4273-4293, 2009.
19. D. L. Donoho. Compressed sensing. IEEE Trans Inform Theory, 52(4): 1289-1306, 2006.
20. D. L. Donoho and J. Tanner. Neighborliness of randomly projected simplices in high dimensions. Proc Nat Acad Sci USA, 102(27):9452-9457, 2005.
21. C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of lp decoding. Proc 39th Ann ACM Symp Theory of Comput (STOC), 2007.
22. A. Feuer and A. Nemirovski. On sparse representation in pairs of bases. IEEE Trans Information Theory, 49(6):1579-1581, 2003.
23. A. Garnaev and E. Gluskin. The widths of a Euclidean ball. Dokl Acad Nauk USSR, 1048-1052, 1984.
24. Y. Gordon. On Milman's inequality and random subspaces which escape through a mesh in Rn. Geome Asp Funct Anal, 84-106, 1987.
25. B. Grunbaum. Grassmann angles of convex polytopes. Acta Math, 121:293-302, 1968.
26. B. Grunbaum. Convex polytopes, Graduate Texts in Mathematics, vol 221. Springer-Verlag, New York, 2nd edn., 2003. Prepared and with a preface by Volker Kaibel, Victor Klee, and Gunter M. Ziegler.
27. B. Kashin. The widths of certain finite dimensional sets and classes of smooth functions. Izvestia, 41:334-351, 1977.
28. B. S. Kashin and V. N. Temlyakov. A remark on compressed sensing. Math Notes, 82(5):748-755, November 2007.
29. M. A. Khajehnejad, W. Xu, A. S. Avestimehr, and B. Hassibi. Weighted G minimization for sparse recovery with prior information. In Proc Int Symp Inform Theory, 2009.
30. N. Linial and I. Novik. How neighborly can a centrally symmetric polytope be? Discrete Comput Geom, 36(6):273-281, 2006.
31. P. McMullen. Non-linear angle-sum relations for polyhedral cones and polytopes. Math Proc Camb Phil Soc, 78(2):247-261, 1975.
32. M. L. Mehta. Random Matrices. Amsterdam: Academic Press, 2004.
33. M. Rudelson and R. Vershynin. Geometric approach to error correcting codes and reconstruction of signals. Int Math Res Notices, 64:4019-4041, 2005.
34. M. Rudelson and R. Vershynin. On sparse reconstruction from Fourier and Gaussian measurements. Commun Pure andAppl Math, 61, 2007.
35. L. A. Santalo. Geometna integral enespacios de curvatura constante. Rep. Argentina Publ. Com. Nac. Energi Atomica, Ser. Mat 1, No.1, 1952.
36. M. Stojnic. Various thresholds for G-optimization in compressed sensing. 2009. Preprint available at http://arxiv.org/abs/0907.3666.
37. M. Stojnic, F. Parvaresh, and B. Hassibi. On the reconstruction of block-sparse signals with an optimal number of measurements. IEEE Trans Signal Proc, 57(8):3075-3085, 2009.
38. M. Stojnic, W. Xu, and B. Hassibi. Compressed sensing - probabilistic analysis of a null-space characterization. Proc IEEE Int Conf Acoust, Speech, Signal Proc (ICASSP), 2008.
39. M. Stojnic, W. Xu, and B. Hassibi. Compressed sensing of approximately sparse signals. IEEE Int Symp Inform Theory, 2008.
40. S. Vavasis. Derivation of compressive sensing theorems for the spherical section property. University of Waterloo, CO 769 lecture notes, 2009.
41. A. M. Vershik and P. V. Sporyshev. Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem. Sel Math Soviet, 11(2):181-201, 1992.
42. W. Xu and B. Hassibi. Compressed sensing over the Grassmann manifold: A unified geometric framework. Accepted to IEEE Trans Inform Theory.
43. W. Xu and B. Hassibi. Compressed sensing over the Grassmann manifold: Aunified analytical framework. Proc 46th Ann Allerton Conf Commun, Control Comput, 2008.
44. W. Xu, A. Khajehnejad, S. Avestimehr, and B. Hassibi. Breaking through the thresholds: an analysis for iterative reweighted l1 minimization via the Grassmann angle framework. Proc Int Conf Acoust, Speech, Signal Proc (ICASSP), 2010.
45. Y. Zhang. When is missing data recoverable? 2006. Available online at www.caam.rice.edu/~zhang/reports/index.html.
46. Y. Zhang. Theory of compressive sensing via l1-minimization: a non-RIP analysis and extensions. 2008. Available online at www.caam.rice.edu/~zhang/reports/index.html.