A perturbation analysis based on group sparse representation with orthogonal matching pursuit
DOI10.1515/jiip-2019-0043zbMath1473.94017OpenAlexW3110205009MaRDI QIDQ2232085
Chuan Li, Zhenbei Leng, Wei Qiu, Feng Zhang, Chun Yan Liu
Publication date: 4 October 2021
Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jiip-2019-0043
compressed sensingblock sparsityblock orthogonal matching pursuitperturbation of measurement matrixblock Schur complementblock-restricted isometry property
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Statistical aspects of information-theoretic topics (62B10)
Cites Work
- Unnamed Item
- Inversion algorithm based on the generalized objective functional for compressed sensing
- A unified algebraic approach to 2-D and 3-D motion segmentation and estimation
- Sparse signal recovery with prior information by iterative reweighted least squares algorithm
- A perturbation analysis of nonconvex block-sparse compressed sensing
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- On Schur complement of block diagonally dominant matrices
- Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression
- Compressed Remote Sensing of Sparse Objects
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed Sensing and Source Separation
- High-Resolution Radar via Compressed Sensing
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Block-Sparse Recovery via Convex Optimization
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Some New Results About Sufficient Conditions for Exact Support Recovery of Sparse Signals via Orthogonal Matching Pursuit
- Robust Recovery of Signals From a Structured Union of Subspaces
This page was built for publication: A perturbation analysis based on group sparse representation with orthogonal matching pursuit
