Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
From MaRDI portal
Publication:2330942
DOI10.1016/j.acha.2018.02.002zbMath1422.94017arXiv1605.02894OpenAlexW2964333607MaRDI QIDQ2330942
Ming-Jun Lai, Zhengchun Zhou, Jinming Wen, Xiaohu Tang, Zi-Long Liu
Publication date: 23 October 2019
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02894
compressed sensingblock orthogonal matching pursuitblock restricted isometry property\(\alpha\)-strongly-decayingblock sparse signals
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
A new bound on the block restricted isometry constant in compressed sensing, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model, Solution sets of three sparse optimization problems for multivariate regression, A perturbation analysis based on group sparse representation with orthogonal matching pursuit, Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery, Binary sparse signal recovery with binary matching pursuit *, Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection, Weighted lp − l1 minimization methods for block sparse recovery and rank minimization
Uses Software
Cites Work
- A mathematical introduction to compressive sensing
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Orthogonal matching pursuit under the restricted isometry property
- The null space property for sparse recovery from multiple measurement vectors
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A simple proof of the restricted isometry property for random matrices
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Stability and Robustness of Weak Orthogonal Matching Pursuits
- On the efficiency of the Orthogonal Matching Pursuit in compressed sensing
- Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay
- Sparse Approximation and Recovery by Greedy Algorithms
- Certifying the Restricted Isometry Property is Hard
- The Performance of Orthogonal Multi-Matching Pursuit under the Restricted Isometry Property
- Compressed sensing and best 𝑘-term approximation
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Uncertainty principles and ideal atomic decomposition
- Compressed Sensing of Analog Signals in Shift-Invariant Spaces
- Time-Delay Estimation From Low-Rate Samples: A Union of Subspaces Approach
- 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
- Perturbation Analysis of Orthogonal Matching Pursuit
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Theoretical and Empirical Results for Recovery From Multiple Measurements
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse solutions to linear inverse problems with multiple measurement vectors
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
