Nested Iterative Algorithms for Convex Constrained Image Recovery Problems
From MaRDI portal
waveletsoptimizationforward-backwardconvex analysisdeconvolutionPoisson noiserestorationvariational methodsiterative algorithmsmaximum a posterioriBayesian approachesDouglas-Rachforddual-trees
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Ill-posedness and regularization problems in numerical linear algebra (65F22) Computing methodologies for image processing (68U10) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)
Abstract: The objective of this paper is to develop methods for solving image recovery problems subject to constraints on the solution. More precisely, we will be interested in problems which can be formulated as the minimization over a closed convex constraint set of the sum of two convex functions f and g, where f may be non-smooth and g is differentiable with a Lipschitz-continuous gradient. To reach this goal, we derive two types of algorithms that combine forward-backward and Douglas-Rachford iterations. The weak convergence of the proposed algorithms is proved. In the case when the Lipschitz-continuity property of the gradient of g is not satisfied, we also show that, under some assumptions, it remains possible to apply these methods to the considered optimization problem by making use of a quadratic extension technique. The effectiveness of the algorithms is demonstrated for two wavelet-based image restoration problems involving a signal-dependent Gaussian noise and a Poisson noise, respectively.
Recommendations
- A fast viscosity forward-backward algorithm for convex minimization problems with an application in image recovery
- Double inertial proximal gradient algorithms for convex optimization problems and applications
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Preconditioned three-operator splitting algorithm with applications to image restoration
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
Cited in
(25)- A convex approach for image restoration with exact Poisson-Gaussian likelihood
- A shifted nested splitting iterative method with applications to ill-posed problems and image restoration
- Augmented Lagrangian method for total generalized variation based Poissonian image restoration
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- On starting and stopping criteria for nested primal-dual iterations
- On $\ell_1$ Data Fitting and Concave Regularization for Image Recovery
- Proximal splitting methods in signal processing
- Constrained SART algorithm for inverse problems in image reconstruction
- Inexact first-order primal-dual algorithms
- Family constraining of iterative algorithms
- Exponential inequalities in stochastic inverse problems using an iterative method
- A proximal interior point algorithm with applications to image processing
- A stable method solving the total variation dictionary model with L^ constraints
- Oracle-net for nonlinear compressed sensing in electrical impedance tomography reconstruction problems
- An adaptive total variational despeckling model based on gray level indicator frame
- Nonsmooth convex optimization for structured illumination microscopy image reconstruction
- Dualization of signal recovery problems
- Distributed and consensus optimization for non-smooth image reconstruction
- Double inertial proximal gradient algorithms for convex optimization problems and applications
- Iterative estimation algorithms using conjugate function lower bound and minorization-maximization with applications in image denoising
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- Deconvolution and denoising for confocal microscopy
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- Iterative algorithm for discrete structure recovery
This page was built for publication: Nested Iterative Algorithms for Convex Constrained Image Recovery Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183406)
