Improved stability conditions of BOGA for noisy block-sparse signals
From MaRDI portal
Publication:634875
DOI10.1016/j.sigpro.2011.05.009zbMath1223.94012OpenAlexW2074447151MaRDI QIDQ634875
Chunru Wan, Xiaolei Lv, Lu Wang, Guoan Bi
Publication date: 17 August 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2011.05.009
Related Items
Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery ⋮ Weighted lp − l1 minimization methods for block sparse recovery and rank minimization
Cites Work
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Sparse representations in unions of bases
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Uncertainty principles and ideal atomic decomposition
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- A generalized uncertainty principle and sparse representation in pairs of bases
- Matching pursuits with time-frequency dictionaries
- Robust Recovery of Signals From a Structured Union of Subspaces
- Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
