ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal
From MaRDI portal
Publication:5000605
DOI10.1088/1361-6420/ab750czbMath1468.94021OpenAlexW3005834954MaRDI QIDQ5000605
No author found.
Publication date: 14 July 2021
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/ab750c
impulsive noiserestricted isometry property\(\ell_1-\alpha\ell_2\) minimizationsignal and image reconstruction
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Low rank matrix recovery with impulsive noise, Performance analysis for unconstrained analysis based approaches*, Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising, Compressive total variation for image reconstruction and restoration, Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals, Enhanced total variation minimization for stable image reconstruction, \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization, Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization, A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization **, A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging, Binary sparse signal recovery with binary matching pursuit *, Robust sparse recovery via a novel convex model, A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation, Robust signal recovery for ℓ 1–2 minimization via prior support information, The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization, Low rank matrix recovery with adversarial sparse noise*
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Point source super-resolution via non-convex \(L_1\) based methods
- The \(L_1\) penalized LAD estimator for high dimensional linear regression
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Compressed sensing with coherent and redundant dictionaries
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- A variational approach to remove outliers and impulse noise
- Fast L1-L2 minimization via a proximal operator
- Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- ROP: matrix recovery via rank-one projections
- PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Stable Image Reconstruction Using Total Variation Minimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Iteratively reweighted least squares minimization for sparse recovery
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Sparse Approximation Property and Stable Recovery of Sparse Signals From Noisy Measurements
- On $l_q$ Optimization and Matrix Completion
- Stable and Robust Sampling Strategies for Compressive Imaging
- Off-the-Grid Line Spectrum Denoising and Estimation With Multiple Measurement Vectors
- Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Non-Lipschitz Models for Image Restoration with Impulse Noise Removal
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Aspects of Total Variation RegularizedL1Function Approximation
- The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- Compressive radar with off-grid targets: a perturbation approach
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
