Improved sparse recovery thresholds with two-step reweighted ℓ1 minimization

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1603-1607

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN MEASUREMENTS; GAUSSIANS; HIGH PROBABILITY; LINEAR MEASUREMENTS; RECOVERY ALGORITHMS; SPARSE RECOVERY; SPARSE SIGNALS; SYSTEM DIMENSION;

INFORMATION THEORY; OPTIMIZATION;

RECOVERY;

EID: 77955703074     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513417     Document Type: Conference Paper

References (13)

1. D. Donoho, "Compressed sensing", IEEE Trans. on Information Theory, 52(4), pp. 1289 - 1306, April 2006)
2. D. Donoho, "High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension", Discrete and Computational Geometry, 102(27), pp. 617-652, 2006, Springer.
3. E. Candés and T. Tao, "Decoding by linear programming", IEEE Trans. on Information Theory, 51(12), pp. 4203 - 4215, December 2005.
4. D. Donoho and J. Tanner, "Thresholds for the Recovery of Sparse Solutions via L1 Minimization", Proceedings of the Conference on Information Sciences and Systems, March 2006.
5. R. G. Baraniuk and M. B. Wakin "Random Projections of Smooth Manifolds", Journal of Foundations of Computational Mathematics, Volume 9, No.1, Feb. 2009,
6. D. Donoho and J. Tanner, "Sparse nonnegative solutions of underdeter-mined linear equations by linear programming" Proc. National Academy of Sciences, 102(27), pp.9446-9451, 2005.
7. D. Needell, "Noisy signal recovery via iterative reweighted L1-minimization" Proc. Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA Nov. 2009.
8. 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. Complete jounrnal manuscript to be submitted.
9. W. Xu and B. Hassibi, "On Sharp Performance Bounds for Robust Sparse Signal Recoveries", accepted to the International Symposium on Information Theory 2009
10. 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
11. 1 Optimization,", in proceedings of Allerton 2009.
12. Compressive sesing online resources at Rice university, http://www.dsp.ece.rice.edu/cs
13. http://www.its.caltech.edu/~amin/weighted-l1-codes/