Compressed sensing of approximately sparse signals

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2182-2186

  Stojnic, Mihailo ^a   Xu, Weiyu ^b   Hassibi, Babak ^b  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^b California Institute of Technology   (United States)

Author keywords

Compressed sensing; l1 optimization

Indexed keywords

COMPRESSED SENSING; COMPRESSED SENSING PROBLEMS; INTERNATIONAL SYMPOSIUM; L1-OPTIMIZATION; MEASUREMENT MATRIX; SPARSE SIGNALS; SYSTEMS OF EQUATIONS;

CYBERNETICS; SIGNAL RECONSTRUCTION; TECHNICAL PRESENTATIONS;

INFORMATION THEORY;

EID: 52349087276     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595377     Document Type: Conference Paper

References (18)

1. David Donoho and Jared Tanner, "Neighborliness of randomly-projected simplices in high dimensions", Proc. National Academy of Sciences, 102(27), pp. 9452-9457, 2005.
2. Emmanuel Candes and Terence Tao, "Decoding by linear programming", IEEE Trans. on Information Theory, 51(12), pp. 4203-4215, December 2005.
3. 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/.
4. Mark Rudelson and Roman Vershynin, "Geometric approach to error correcting codes and reconstruction of signals", International Mathematical Research Notices, 64, pp. 4019-4041, 2005.
5. A.M. Vershik and RV. Sporyshev, "Asymptotic Behavior of the Number of Faces of Random Polyhedra and the Neighborliness Problem", Selecta Mathematica Sovietica vol. 11, No. 2 (1992).
6. A.D. Wyner, "Random packings and coverings of the unit N-sphere", Bell systems technical journal, vol. 46, 2111-2118, 1967.
7. I. Dumer, M.S. Pinsker, and V.V. Prelov, "On the thinest coverings of the spheres and ellipsoids", Information Transfer and Combinatorics, LNCS 4123, pp. 883-910, 2006.
8. I. Barany and N. Simanyi, "A note on the size of the largest ball inside a convex polytope", Periodica Mathematica Hungarica, vol. 51 (2), 2005, pp. 15-18.
9. K. Boroczky, Jr. and G. Wintsche, "Covering the sphere by equal spherical balls", in Discrete and computational geometry: the Goodman-Pollach Festschrift (ed. by S. Basu et al.), 2003, 237-253.
10. A. Feuer and A. Nemirovski, "On sparse representation in pairs of bases", IEEE Transactions on Information Theory 49(6):1579-1581 (2003).
11. N. Linial and I. Novik, "How neighborly can a centrally symmetric polytope be?", Discrete and Computational Geometry, 36 (2006) 273-281.
12. Y. Zhang, "When is missing data recoverable", available online at http://www.dsp.ece.rice.edu/cs/.
13. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections", IEEE Trans. on Information Theory, 52(9), pp. 4036-4048, September 2006.
14. 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.
15. C. Dwork, F. McSherry, and K. Talwar, "The price of privacy and the limits of LP decoding", Symp. on Theory of Computing (STOC), San Diego, California, June, 2007.
16. 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/.
17. J. Tropp, M. Wakin, M. Duarte, D. Baron, and R. Baraniuk, Random filters for compressive sampling and reconstruction. Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP), Toulouse, France, May 2006.
18. Emmanuel Candes, "Compressive sampling", Proc. International Congress of Mathematics, 3, pp. 1433-1452, Madrid, Spain, 2006.