On sharp performance bounds for robust sparse signal recoveries

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 493-497

  Xu, Weiyu ^a   Hassibi, Babak ^a  

^a California Institute of Technology   (United States)

Author keywords

Basis pursuit; Compressed sensing; Geometric probability; Grassmann angle; Random linear subspaces

Indexed keywords

BASIS PURSUIT; COMPRESSED SENSING; GEOMETRIC PROBABILITY; GRASSMANN ANGLE; RANDOM LINEAR SUBSPACES;

INFORMATION THEORY; OPTIMIZATION; SIGNAL RECONSTRUCTION;

RECOVERY;

EID: 70449484735     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205718     Document Type: Conference Paper

References (20)

1. David Donoho, "High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension ", Discrete and Computational Geometry, 102(27), pp. 617-652, 2006, Springer.
2. Emmanuel Candes and Terence Tao, "Decoding by linear programming", IEEE Trans. on Information Theory, 51(\2), pp. 4203-4215, December 2005.
3. David Donoho and Jared Tanner, "Thresholds for the Recovery of Sparse Solutions via Ll Minimization", Proceedings of the Coriference on Information Sciences and Systems, March 2006.
4. Richard Baraniuk, Mark Davenport, Ronald DeVore, and Michael Wakin, "A simple proof of the restricted isometry property for random matrices", To appear in Constructive Approximation, available online at http://www.dsp.ece.rice.edu/cs/.
5. Mark Rudelson and Roman Vershynin, "Geometric approach to error correctingcodes and reconstruction of signals", International Mathematical Research Notices, 64, pp. 4019-4041, 2005.
6. A.M. Vershik and P.Y. Sporyshev, "Asymptotic Behavior of the Number of Faces of Random Polyhedra and the Neighborliness Problem", Selecta Mathematica Sovietica vol. II, No.2 (1992).
7. W. M. Boothby, An Introduction to Differential Manifolds and Riemannian Geometry, 2nd ed. San Diego, CA: Academic, 1986.
8. Y. Zhang, "When is missing data recoverable", available online at http://www.dsp.ece.rice.edu/cs/.
9. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections", IEEE Trans. on Information Theory, 52(9), pp. 4036-4048, September 2006.
10. M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity", Proc. Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2006.
11. A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best k-term approximation". (Preprint, 2006), available online at http://www.dsp.ece.rice.edu/cs/.
12. Branko Grünbaum, Grassmann angles of convex polytopes. Acta Math., 121:pp.293-302, 1968.
13. Branko Grünbaum, Convex polytopes, volume 221 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 2003. Prepared and with a preface by Volker Kaibel, Victor Klee and GnterüM. Ziegler.
14. Fernando Affentranger and Rolf Schneider. "Random projections of regular simplices". Discrete Comput. Geom., 7(3):pp.219-226, 1992.
15. Károly Böröczky, Jr. and Martin Henk."Random projections of regular polytopes". Arch. Math. (Basel), 73(6):pp.465-473, 1999.
16. L.A.Santaló, Geometrfa integral en espacios de curvatura constante, Rep.Argetina PubI.Com.Nac.Energí Atómica, Ser.Mat I,No.1(1952)
17. Peter McMullen. "Non-linear angle-sum relations for polyhedral cones and polytopes". Math. Proc. Cambridge Philos. Soc., 78(2):pp.247-261, 1975.
18. Emmanuel Candes, "Compressive sampling", Proc. International Congress of Mathematics, 3, pp. 1433-1452, Madrid, Spain, 2006.
19. Weiyu Xu and Babak Hassibi, "Compressive Sensing over the Grassmann Manifold: A Unified Analytical Approach:" Allerton Conference on on Communication, Control, and Computing, September 2008
20. Boris S. Kashin and Vladimir N. Temlyakov, "A remark on compressed sensing:" Mathematical Notes, 82(5-6), pp. 748-755, Nov. 2007.