A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
From MaRDI portal
Publication:2353428
DOI10.1007/s10851-014-0514-3zbMath1331.68270OpenAlexW2008678970MaRDI QIDQ2353428
Publication date: 14 July 2015
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-014-0514-3
convex optimizationinverse problemsimage restorationNewton projection methods\(\ell _1\)-norm-based regularization
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization
- Quasi-Newton projection methods and the discrepancy principle in image restoration
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Gradient-Based Methods for Sparse Recovery
- The Split Bregman Method for L1-Regularized Problems
- Two-Metric Projection Methods for Constrained Optimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Deblurring Images
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Probing the Pareto Frontier for Basis Pursuit Solutions
- A Fast $\ell$1-TV Algorithm for Image Restoration
- Atomic Decomposition by Basis Pursuit
- On the method of Lavrentiev regularization for nonlinear ill-posed problems
- Sparse Reconstruction by Separable Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Computational Methods for Inverse Problems
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Iterative Methods for Total Variation Denoising
- Sparsity and incoherence in compressive sampling
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- The elements of statistical learning. Data mining, inference, and prediction
