Hard thresholding pursuit algorithms: Number of iterations ☆
暂无分享,去创建一个
[1] 慧 廣瀬. A Mathematical Introduction to Compressive Sensing , 2015 .
[2] Song Li,et al. Nonuniform support recovery from noisy random measurements by Orthogonal Matching Pursuit , 2013, J. Approx. Theory.
[3] Variantes sur un th\'eor\`eme de Cand\`es, Romberg et Tao , 2012, 1210.4025.
[4] Simon Foucart,et al. Hard Thresholding Pursuit: An Algorithm for Compressive Sensing , 2011, SIAM J. Numer. Anal..
[5] Emmanuel J. Candès,et al. A Probabilistic and RIPless Theory of Compressed Sensing , 2010, IEEE Transactions on Information Theory.
[6] Tong Zhang,et al. Sparse Recovery With Orthogonal Matching Pursuit Under RIP , 2010, IEEE Transactions on Information Theory.
[7] P. Wojtaszczyk,et al. Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing , 2010, Found. Comput. Math..
[8] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[9] 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.
[10] Arian Maleki,et al. Coherence analysis of iterative thresholding algorithms , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[11] Mike E. Davies,et al. Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.
[12] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .
[13] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[14] D. Donoho,et al. Counting faces of randomly-projected polytopes when the projection radically lowers dimension , 2006, math/0607364.
[15] E. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.