A perturbation analysis based on group sparse representation with orthogonal matching pursuit
DOI10.1515/JIIP-2019-0043zbMATH Open1473.94017OpenAlexW3110205009MaRDI QIDQ2232085FDOQ2232085
Authors: Feng Zhang, Wei Qiu, Chuan Li, Zhenbei Leng, Chunyan 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
Recommendations
- Perturbation Analysis of Orthogonal Matching Pursuit
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- Perturbed Orthogonal Matching Pursuit
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- Recovery of Sparse Signals via Generalized Orthogonal Matching Pursuit: A New Analysis
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- A new result on recovery sparse signals using orthogonal matching pursuit
- Group-Based Sparse Representation for Image Restoration
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
compressed sensingblock sparsityblock orthogonal matching pursuitperturbation of measurement matrixblock Schur complementblock-restricted isometry property
Statistical aspects of information-theoretic topics (62B10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Compressive sampling
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- On Schur complement of block diagonally dominant matrices
- Compressed Sensing and Source Separation
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Block-Sparse Recovery via Convex Optimization
- Robust Recovery of Signals From a Structured Union of Subspaces
- Inversion algorithm based on the generalized objective functional for compressed sensing
- High-Resolution Radar via Compressed Sensing
- Compressed remote sensing of sparse objects
- A unified algebraic approach to 2-D and 3-D motion segmentation and estimation
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Sparse signal recovery with prior information by iterative reweighted least squares algorithm
- Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise
- A perturbation analysis of nonconvex block-sparse compressed sensing
- Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Some New Results About Sufficient Conditions for Exact Support Recovery of Sparse Signals via Orthogonal Matching Pursuit
Cited In (2)
This page was built for publication: A perturbation analysis based on group sparse representation with orthogonal matching pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232085)
