Stability and Robustness of Weak Orthogonal Matching Pursuits
暂无分享,去创建一个
[1] Ray Maleh,et al. Improved RIP Analysis of Orthogonal Matching Pursuit , 2011, ArXiv.
[2] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[3] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[4] Michael B. Wakin,et al. Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.
[5] Yi Shen,et al. Remarks on the Restricted Isometry Property in Orthogonal Matching Pursuit algorithm , 2011, ArXiv.
[6] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[7] Yi Shen,et al. A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.
[8] Entao Liu,et al. Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing ∗ , 2010 .
[9] Simon Foucart,et al. Hard Thresholding Pursuit: An Algorithm for Compressive Sensing , 2011, SIAM J. Numer. Anal..
[10] Tong Zhang,et al. Sparse Recovery With Orthogonal Matching Pursuit Under RIP , 2010, IEEE Transactions on Information Theory.
[11] Juan Luis Varona,et al. Complex networks and decentralized search algorithms , 2006 .
[12] E.J. Candes. Compressive Sampling , 2022 .
[13] H. Rauhut. On the Impossibility of Uniform Sparse Reconstruction using Greedy Methods , 2007 .