Sparse Recovery using Smoothed ℓ0 (SL0): Convergence Analysis
暂无分享,去创建一个
Christian Jutten | Massoud Babaie-Zadeh | Hosein Mohimani | Irina Gorodnitsky | C. Jutten | I. Gorodnitsky | H. Mohimani | M. Babaie-zadeh
[1] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[2] Michael Zibulevsky,et al. Underdetermined blind source separation using sparse representations , 2001, Signal Process..
[3] Jeffrey D. Blanchard,et al. Phase Transitions for Restricted Isometry Properties , 2009 .
[4] S. Szarek,et al. Chapter 8 - Local Operator Theory, Random Matrices and Banach Spaces , 2001 .
[5] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[6] M. Ledoux. The concentration of measure phenomenon , 2001 .
[7] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[8] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[9] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[10] Andrew Blake,et al. Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.
[11] Mike E. Davies,et al. In greedy PURSUIT of new directions: (Nearly) Orthogonal Matching Pursuit by directional optimisation , 2007, 2007 15th European Signal Processing Conference.
[12] D. Donoho,et al. Thresholds for the Recovery of Sparse Solutions via L1 Minimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[13] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[14] Rémi Gribonval,et al. Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$ , 2009, IEEE Transactions on Information Theory.
[15] Davies Rémi Gribonval. Restricted Isometry Constants Where Lp Sparse Recovery Can Fail for 0 , 2008 .
[16] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[17] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[18] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[19] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[20] Christian Jutten,et al. Fast Sparse Representation Based on Smoothed l0 Norm , 2007, ICA.
[21] Sacha Krstulovic,et al. Mptk: Matching Pursuit Made Tractable , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.
[22] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[23] S. Amari,et al. SPARSE COMPONENT ANALYSIS FOR BLIND SOURCE SEPARATION WITH LESS SENSORS THAN SOURCES , 2003 .
[24] Christian Jutten,et al. A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm , 2008, IEEE Transactions on Signal Processing.
[25] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[26] Rémi Gribonval,et al. A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challenges , 2006, ESANN.
[27] Michael Elad,et al. Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.
[28] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[29] Bhaskar D. Rao,et al. Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..
[30] S. Foucart,et al. Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 , 2009 .
[31] J. Fadili,et al. Challenging restricted isometry constants with greedy pursuit , 2009, 2009 IEEE Information Theory Workshop.