Analyzing weighted ℓ1 minimization for sparse recovery with nonuniform sparse models

IEEE Transactions on Signal Processing

Volumn 59, Issue 5, 2011, Pages 1985-2001

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

1 minimization; Compressed sensing; nonuniform sparsity

Indexed keywords

ARBITRARY NUMBER; COMPRESSED SENSING; GAUSSIAN MEASUREMENTS; NONUNIFORM; NONUNIFORM SPARSITY; OPTIMAL WEIGHT; RECOVERY ALGORITHMS; RIGOROUS ANALYSIS; SIGNAL VECTORS; SPARSE RECOVERY;

PROBABILITY; SIGNAL PROCESSING; SIGNAL RECONSTRUCTION;

OPTIMIZATION;

EID: 79954543366     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2107904     Document Type: Article

References (29)

1. D. Donoho, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension," in Discrete and Computational Geometry. New York: Springer, 2006, vol. 102, pp. 617-652, (27). (Pubitemid 43701356)
2. E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
3. D. Donoho and J. Tanner, "Neighborliness of randomly-projected simplices in high dimensions," Proc. Nat. Acad. Sci., vol. 102, no. 27, pp. 9452-9457, 2005. (Pubitemid 40981702)
4. W. Xu and B. Hassibi, "Compressed sensing over the Grassmann manifold: A unified analytical framework," in Proc. 46th Annu. Allerton Conf. Commun., Contr., Comput., Sep. 24-26, 2008.
5. W. Lu and N. Vaswani, "Modified compressive sensing for real-time dynamicMRimaging," in Proc. IEEE Int. Conf. Image Process. (ICIP), 2009.
6. N. Vaswani and W. Lu, "Modified-CS: Modifying compressive sensing for problems with partially known support," IEEE Trans. Signal Process., vol. 58, no. 9, pp. 4595-4607, Sep. 2010.
7. W. Lu and N. Vaswani, Regularized Modified-BPDN for Compressive Sensing With Partially Known Support 2010 [Online]. Available: http://arxiv.org/PS- cache/arxiv/pdf/1002/1002.0019v1.pdf
8. M. Davenport, M. Wakin, and R. Baraniuk, "Detection and estimation with compressive measurements," Electrical and Computer Engineering Dept., Rice Univ., Houston, TX, Tech. Rep. TREE 0610, Nov. 2006.
9. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2346-2356, Jun. 2008. (Pubitemid 351795888)
10. R. G. Baraniuk, V. Cevher,M. F. Duarte, and C. Hegde, "Model-based compressive sensing," IEEE Trans. Inf. Theory, submitted for publication.
11. M. Stojnic, F. Parvaresh, and B. Hassibi, "On the reconstruction of block-sparse signals with an optimal number of measurements," IEEE Trans. Signal Process., vol. 57, no. 8, pp. 3075-3085, 2009.
12. E. J. Candès, M. Wakin, and S. Boyd, "Enhancing sparsity by reweighted l1 minimization," J. Fourier Anal. Appl., vol. 14, pp. 877-905.
13. 1minimization IEEE Int. Symp. Inform. Theory Proc. (ISIT), pp. 1603-1607, 2010.
14. B. Grünbaum, "Grassmann angles of convex polytopes," Acta Math., vol. 121, pp. 293-302, 1968.
15. B. Grünbaum, "Convex polytopes," in Graduate Texts in Mathematics, 2nd ed. New York: Springer-Verlag, 2003, vol. 221.
16. F. Affentranger and R. Schneider, "Random projections of regular simplices," Discrete Comput. Geometry, vol. 7, pp. 219-226, 1992.
17. 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.
18. P. McMullen, "Non-linear angle-sum relations for polyhedral cones and polytopes," Math. Proc. Cambridge Philos. Soc., vol. 78, no. 2, pp. 247-261, 1975.
19. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing-Probabilistic analysis of a null-space characterization," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Mar. 31-Apr. 4, 2008, pp. 3377-3380.
20. J. Coates, Y. Pointurier, and M. Rabbat, "Compressed network monitoring," presented at the IEEE Workshop Statist. Signal Process., Madison, WI, Aug. 2007.
21. 1 optimization," in Proc. Allerton Conf., 2009.
22. O. Milenkovic, R. Baraniuk, and T. Simunic-Rosing, "Compressed sensing meets bionformatics: A new DNA microarray architecture," presented at the Inf. Theory Appl. Workshop, San Diego, CA, 2007.
23. S. Erickson and C. Sabatti, "Empirical Bayes estimation of a sparse vector of gene expression," Statistical Applications in Genetics and Molecular Biology, 2005 [Online]. Available: http://preprints.stat.ucla. edu/413/PP413.pdf
24. H. Vikalo, F. Parvaresh, S. Misra, and B. Hassibi, "Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays," in Asilomor Conf., Nov. 2007.
25. H. Hadwiger, "Gitterpunktanzahl im simplex und willssche vermutung," Math. Ann., vol. 239, pp. 271-288, 1979.
26. D. Donoho, "For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution," Comm. Pure Appl. Math., 2004.
27. 1minimization for 2 Sparsity Classes [Online]. Available: http://www.its.caltech.edu/∼amin/weighted-l1-codes
28. 1minimization for sparse recovery with nonuniform sparse models," Full Report [Online]. Available: http://arxiv.org/PS-cache/arxiv/ pdf/1009/1009.3525v1.pdf
29. Compresses Sensing Online Resources [Online]. Available: http://www.dsp.ece.rice.edu/cs/