Stable restoration and separation of approximately sparse signals
From MaRDI portal
Publication:2252500
Abstract: This paper develops new theory and algorithms to recover signals that are approximately sparse in some general dictionary (i.e., a basis, frame, or over-/incomplete matrix) but corrupted by a combination of interference having a sparse representation in a second general dictionary and measurement noise. The algorithms and analytical recovery conditions consider varying degrees of signal and interference support-set knowledge. Particular applications covered by the proposed framework include the restoration of signals impaired by impulse noise, narrowband interference, or saturation/clipping, as well as image in-painting, super-resolution, and signal separation. Two application examples for audio and image restoration demonstrate the efficacy of the approach.
Recommendations
- Stable signal recovery from incomplete and inaccurate measurements
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- On the stability of the basis pursuit in the presence of noise
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A fast super-resolution reconstruction algorithm for pure translational motion and common space-invariant blur
- A generalized uncertainty principle and sparse representation in pairs of bases
- A simple proof of the restricted isometry property for random matrices
- Atomic Decomposition by Basis Pursuit
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- Compressed sensing
- Compressed sensing and matrix completion with constant proportion of corruptions
- Decoding by Linear Programming
- Democracy in action: quantization, saturation, and compressive sensing
- Dense Error Correction Via \ell^1-Minimization
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 1233799 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- Just relax: convex programming methods for identifying sparse signals in noise
- Matrix Analysis
- Methods of conjugate gradients for solving linear systems
- Microlocal analysis of the geometric separation problem
- Model-Based Compressive Sensing
- New Bounds for Restricted Isometry Constants
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- On sparse representation in pairs of bases
- On the conditioning of random subdictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Recovery of Sparsely Corrupted Signals
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Shifting Inequality and Recovery of Sparse Signals
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Simultaneously inpainting in image and transformed domains
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse representations in unions of bases
- Split Bregman methods and frame based image restoration
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Stable signal recovery from incomplete and inaccurate measurements
- Super-Resolution With Sparse Mixing Estimators
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The restricted isometry property and its implications for compressed sensing
- Uncertainty principles and ideal atomic decomposition
- Uncertainty Principles and Signal Recovery
- Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
Cited in
(18)- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- Reconstruction of sparse signals in impulsive disturbance environments
- Robust multi-image processing with optimal sparse regularization
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Recovering a clipped signal in sparseland
- Stable Recovery of Sparse Signals Via Regularized Minimization
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements
- Structured sparse Bayesian modelling for audio restoration
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Compressed data separation via unconstrained l1-split analysis
- Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
- A theory of optimal convex regularization for low-dimensional recovery
- Oracle inequalities for corrupted compressed sensing
- Smoothing functions for sparse optimization: a unified framework
This page was built for publication: Stable restoration and separation of approximately sparse signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252500)
