Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising

DOI10.4208/jcm.2204-m2021-0333OpenAlexW4361800431MaRDI QIDQ6191886

Ningning Li, Huanmin Ge, Chen, Wengu

Publication date: 12 February 2024

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.2204-m2021-0333

zbMATH Keywords

signal recoveryrestricted isometry propertycorrupted compressed sensingjustice pursuit de-noising

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Approximation algorithms (68W25)

Cites Work

• A mathematical introduction to compressive sensing
• Democracy in action: quantization, saturation, and compressive sensing
• On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals
• Extensions of compressed sensing
• Compressed sensing and matrix completion with constant proportion of corruptions
• Iterative hard thresholding for compressed data separation
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Stable restoration and separation of approximately sparse signals
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
• Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
• Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
• Robust principal component analysis?
• Graph Implementations for Nonsmooth Convex Programs
• Decoding by Linear Programming
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• Just relax: convex programming methods for identifying sparse signals in noise
• Split Bregman Methods and Frame Based Image Restoration
• A fast super-resolution reconstruction algorithm for pure translational motion and common space-invariant blur
• A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
• Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
• Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
• Recovery of Sparsely Corrupted Signals
• Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
• Dense Error Correction Via $\ell^1$-Minimization
• Corrupted Sensing: Novel Guarantees for Separating Structured Signals
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Compressed Data Separation With Redundant Dictionaries
• Super-Resolution With Sparse Mixing Estimators
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing