Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
DOI10.3934/ipi.2018006zbMath1395.94095OpenAlexW2779643547MaRDI QIDQ1673807
Publication date: 14 September 2018
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/ipi.2018006
block orthogonal matching pursuitblock orthogonal multi-matching pursuitblock restricted isometry propertyblock restricted orthogonality constantblock sparse signal
Analysis of algorithms (68W40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Algorithms for approximation of functions (65D15) Numerical solution to inverse problems in abstract spaces (65J22)
Uses Software
Cites Work
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Robustness of orthogonal matching pursuit under restricted isometry property
- Analysis of orthogonal multi-matching pursuit under restricted isometry property
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The benefit of group sparsity
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- Compressed sensing of color images
- A sharp RIP condition for orthogonal matching pursuit
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- An affine scaling methodology for best basis selection
- The Performance of Orthogonal Multi-Matching Pursuit under the Restricted Isometry Property
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- Generalized Orthogonal Matching Pursuit
- Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- De-noising by soft-thresholding
- Robust Recovery of Signals From a Structured Union of Subspaces
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse solutions to linear inverse problems with multiple measurement vectors
- A Sharp Bound on RIC in Generalized Orthogonal Matching Pursuit
- Compressed sensing
This page was built for publication: Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
