Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
Authors:
- Jinming WenJWJinming Wen
- Zhengchun ZhouZZZhengchun Zhou
- Zilong LiuZLZilong Liu
- Ming-Jun LaiMLMing-Jun Lai
- Xiaohu TangXTXiaohu Tang
- 1 November 2019
- journal article
- research article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 47 (3) , 948-974
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (61661146003)
- Ministry of Education (6141A020223)
- Simons Collaboration (280646)
- National Science Foundation (DMS 1521537, 2015JY0282)
- Major Frontier Project of Sichuan Province
This publication has 59 references indexed in Scilit:
- On the efficiency of the Orthogonal Matching Pursuit in compressed sensingSbornik: Mathematics, 2012
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIPInverse Problems, 2011
- Sparsest solutions of underdetermined linear systems via -minimization forApplied and Computational Harmonic Analysis, 2009
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$IEEE Transactions on Information Theory, 2009
- Compressed sensing and best 𝑘-term approximationJournal of the American Mathematical Society, 2008
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Recovery of Exact Sparse Representations in the Presence of Bounded NoiseIEEE Transactions on Information Theory, 2005
- Uncertainty principles and ideal atomic decompositionIEEE Transactions on Information Theory, 2001