Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm
暂无分享,去创建一个
Weiyu Xu | Babak Hassibi | Amir Salman Avestimehr | M. Amin Khajehnejad | B. Hassibi | A. Avestimehr | Weiyu Xu | M. Khajehnejad
[1] David L. Donoho,et al. Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications , 2008, Discret. Comput. Geom..
[2] Alexandros G. Dimakis,et al. Sparse Recovery of Nonnegative Signals With Minimal Expansion , 2011, IEEE Transactions on Signal Processing.
[3] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[4] Weiyu Xu,et al. On sharp performance bounds for robust sparse signal recoveries , 2009, 2009 IEEE International Symposium on Information Theory.
[5] D. Donoho,et al. Thresholds for the Recovery of Sparse Solutions via L1 Minimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[6] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[7] D. Donoho,et al. Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[8] P. Massart,et al. Concentration inequalities and model selection , 2007 .
[9] Weiyu Xu,et al. Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models , 2010, IEEE Transactions on Signal Processing.
[10] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[11] Richard G. Baraniuk,et al. Random Projections of Smooth Manifolds , 2009, Found. Comput. Math..
[12] P Mcmullen,et al. Non-linear angle-sum relations for polyhedral cones and polytopes , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.
[13] Massimo Fornasier,et al. Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.
[14] Weiyu Xu,et al. Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework , 2011, IEEE Transactions on Information Theory.
[15] D. Donoho,et al. Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[16] Weiyu Xu,et al. Weighted ℓ1 minimization for sparse recovery with prior information , 2009, 2009 IEEE International Symposium on Information Theory.
[17] Piotr Indyk,et al. Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[18] A. Salman Avestimehr,et al. Breaking the ℓ1 recovery thresholds with reweighted ℓ1 optimization , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[19] L. Santaló. Geometría integral en espacios de curvatura constante , 1952 .
[20] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[21] Deanna Needell,et al. Noisy signal recovery via iterative reweighted L1-minimization , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.