Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay
暂无分享,去创建一个
[1] Deanna Needell,et al. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..
[2] Yonina C. Eldar,et al. Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise , 2009, IEEE Transactions on Signal Processing.
[3] 慧 廣瀬. A Mathematical Introduction to Compressive Sensing , 2015 .
[4] Simon Foucart,et al. Stability and Robustness of Weak Orthogonal Matching Pursuits , 2012 .
[5] S. Mallat. A wavelet tour of signal processing , 1998 .
[6] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[7] R. Gribonval,et al. Exact Recovery Conditions for Sparse Representations With Partial Support Information , 2013, IEEE Transactions on Information Theory.
[8] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[9] Sundeep Rangan,et al. Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis , 2009, NIPS.
[10] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[11] Yi Shen,et al. A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.
[12] Yonina C. Eldar,et al. Rank Awareness in Joint Sparse Recovery , 2010, IEEE Transactions on Information Theory.
[13] Michael Elad,et al. Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.
[14] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[15] Sheng Chen,et al. Orthogonal least squares methods and their application to non-linear system identification , 1989 .
[16] Lie Wang,et al. Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise , 2011, IEEE Transactions on Information Theory.
[17] Bhaskar D. Rao,et al. Latent Variable Bayesian Models for Promoting Sparsity , 2011, IEEE Transactions on Information Theory.
[18] Ling-Hua Chang,et al. An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit , 2014, IEEE Transactions on Information Theory.
[19] Mark D. Plumbley. On Polar Polytopes and the Recovery of Sparse Representations , 2007, IEEE Trans. Inf. Theory.
[20] Dustin G. Mixon,et al. Certifying the Restricted Isometry Property is Hard , 2012, IEEE Transactions on Information Theory.
[21] Bhaskar D. Rao,et al. Comparing the Effects of Different Weight Distributions on Finding Sparse Representations , 2005, NIPS.
[22] S. Rangan,et al. Orthogonal Matching Pursuit from Noisy Measurements : A New Analysis ∗ , 2009 .
[23] Yonina C. Eldar,et al. Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation , 2009, IEEE Transactions on Information Theory.
[24] Jie Ding,et al. Performance analysis of Orthogonal Matching Pursuit under general perturbations , 2012, 2012 International Conference on Computing, Networking and Communications (ICNC).
[25] H. Rauhut,et al. Atoms of All Channels, Unite! Average Case Analysis of Multi-Channel Sparse Recovery Using Greedy Algorithms , 2008 .
[26] D. Lorenz,et al. Greedy solution of ill-posed problems: error bounds and exact inversion , 2009, 0904.0154.
[27] A. Atkinson. Subset Selection in Regression , 1992 .
[28] Tong Zhang,et al. Sparse Recovery With Orthogonal Matching Pursuit Under RIP , 2010, IEEE Transactions on Information Theory.
[29] B. Rao,et al. Forward sequential algorithms for best basis selection , 1999 .
[30] Arian Maleki,et al. Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.
[31] Charles Soussen,et al. Joint K-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares , 2011, IEEE Transactions on Information Theory.
[32] Rémi Gribonval,et al. From Blind to Guided Audio Source Separation: How models and side information can improve the separation of sound , 2014, IEEE Signal Processing Magazine.
[33] L. Rebollo-Neira,et al. Optimized orthogonal matching pursuit approach , 2002, IEEE Signal Processing Letters.
[34] Jean-Luc Starck,et al. Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.
[35] Michael B. Wakin,et al. Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.
[36] Wei Huang,et al. The Exact Support Recovery of Sparse Signals With Noise via Orthogonal Matching Pursuit , 2013, IEEE Signal Processing Letters.
[37] Bob L. Sturm. A Study on Sparse Vector Distributions and Recovery from Compressed Sensing , 2011, ArXiv.
[38] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[39] Lie Wang,et al. Stable Recovery of Sparse Signals and an Oracle Inequality , 2010, IEEE Transactions on Information Theory.
[40] Marc E. Pfetsch,et al. The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing , 2012, IEEE Transactions on Information Theory.
[41] Bhaskar D. Rao,et al. Performance limits of matching pursuit algorithms , 2008, 2008 IEEE International Symposium on Information Theory.
[42] T. Blumensath,et al. On the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares , 2007 .
[43] Holger Rauhut,et al. A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.
[44] Jean-Jacques Fuchs,et al. On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.
[45] Jared Tanner,et al. Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing , 2015, IEEE Transactions on Signal Processing.
[46] Massimo Fornasier,et al. Quasi-linear Compressed Sensing , 2013, Multiscale Model. Simul..
[47] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..