A general theory for subspace-sparse recovery
From MaRDI portal
Publication:5052922
DOI10.1142/S021969132250028XzbMath1498.65055MaRDI QIDQ5052922
Chen, Wengu, Ningning Li, Huanmin Ge
Publication date: 25 November 2022
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Approximation algorithms (68W25)
Cites Work
- Democracy in action: quantization, saturation, and compressive sensing
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Compressed sensing and matrix completion with constant proportion of corruptions
- A geometric analysis of subspace clustering with outliers
- Robust subspace clustering
- Generalized principal component analysis
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Split Bregman Methods and Frame Based Image Restoration
- A fast super-resolution reconstruction algorithm for pure translational motion and common space-invariant blur
- Uncertainty principles and ideal atomic decomposition
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- Recovery of Sparsely Corrupted Signals
- Corrupted Sensing: Novel Guarantees for Separating Structured Signals
- Super-Resolution With Sparse Mixing Estimators
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Metrics and models for handwritten character recognition
This page was built for publication: A general theory for subspace-sparse recovery
