Breaking through the thresholds: An analysis for iterative reweighted ℓ1 minimization via the Grassmann angle framework

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2010, Pages 5498-5501

  Xu, Weiyu ^a   Khajehnejad, M Amin ^a   Avestimehr, A Salman ^b   Hassibi, Babak ^a  

^a Caltech EE   (United States)

^b Caltech CMI   (United States)

Author keywords

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

Indexed keywords

SIGNAL PROCESSING;

BASIS PURSUITS; BREAKINGS; COMPRESSED-SENSING; GRASSMANN ANGLE; INCOMPLETE MEASUREMENTS; LINEAR SUBSPACE; MINIMISATION; MINIMIZATION ALGORITHMS; RANDOM LINEAR SUBSPACE; SPARSE SIGNALS;

ITERATIVE METHODS;

EID: 78049411603     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2010.5495210     Document Type: Conference Paper

References (15)

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(12), pp. 4203-4215, December 2005.
3. David Donoho and Jared Tanner, "Thresholds for the Recovery of Sparse Solutions via L1 Minimization", Proceedings of the Conference on Information Sciences and Systems, March 2006.
4. A.M. Vershik and P.V. Sporyshev, "Asymptotic Behavior of the Number of Faces of Random Polyhedra and the Neighborliness Problem", Selecta Mathematica Sovietica vol. 11, No. 2 (1992).
5. Branko Grünbaum, Grassmann angles of convex polytopes. Acta Math., 121:pp.293-302, 1968.
6. 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.
7. Fernando Affentranger and Rolf Schneider. "Random projections of regular simplices". Discrete Comput. Geom., 7(3):pp.219-226, 1992.
8. Károly Böröczky, Jr. and Martin Henk."Random projections of regular polytopes". Arch. Math. (Basel), 73(6):pp.465-473, 1999.
9. L.A.Santaló, Geometría integral en espacios de curvatura constante, Rep.Argetina Publ.Com.Nac.Energí Atómica, Ser.Mat 1,No.1(1952)
10. Peter McMullen. "Non-linear angle-sum relations for polyhedral cones and polytopes". Math. Proc. Cambridge Philos. Soc., 78(2):pp.247-261, 1975.
11. 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
12. 1 Minimization for Sparse Recovery with Prior Information", accepted to the International Symposium on Information Theory 2009, available online http://arxiv.org/abs/0901.2912
13. 1 Minimization for Sparse Recovery with Prior Information", journal version, to be submitted
14. Weiyu Xu and Babak Hassibi, "On Sharp Performance Bounds for Robust Sparse Signal Recoveries", accepted to the International Symposium on Information Theory 2009
15. E. J. Candes, M. B. Wakin, and S. Boyd, "Enhancing Sparsity by Reweighted l1 Minimization", Journal of Fourier Analysis and Applications, 14(5), pp. 877-905, special issue on sparsity, December 2008