Explicit iteration schemes for minimization problems arising from image denoising

DOI10.1016/J.ACHA.2011.04.006MaRDI QIDQ643648zbMATH OpenOpenAlexFDO

Authors Rong-Qing Jia

Publication date 2 November 2011

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.acha.2011.04.006

zbMATH Keywords

convergenceconvex optimizationGauss-Seidel methodimage denoisingiteration schemematrix splittingsplit Bregman methodtotal variation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Review text

The author considers explicit iteration schemes for minimization problems arising from image denoising. Some basic facts from convex analysis are reviewed. The author employs the split Bregman method and proposes an explicit iteration scheme based on matrix splitting. The convergence of the proposed iteration scheme is analyzed. When the matrix splitting is done by the symmetric Gauss-Seidel method then the convergence of the scheme is established with no restriction on the step size of the iteration. If the matrix splitting is done by the Gauss-Seidel method then the iteration scheme is shown to converge provided the step size of each iteration is sufficiently small.

Recommendations

• An iterative scheme for total variation-based image denoising
• Iterative estimation algorithms using conjugate function lower bound and minorization-maximization with applications in image denoising
• Iterative Methods for Total Variation Denoising
• An iterative Lagrange multiplier method for constrained total-variation-based image denoising
• CONVERGENCE OF AN ITERATIVE NONLINEAR SCHEME FOR DENOISING OF PIECEWISE CONSTANT IMAGES
• On some new variational problems for image denoising
• Iterative methods for optimization problems and image restoration
• A non-gradient-based energy minimization approach to the image denoising problem

Cites work

• A fast algorithm for the total variation model of image denoising
• Convergence analysis of the Bregman method for the variational model of image denoising
• Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondifferentiable Mappings
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• Nonlinear optimization.
• Nonlinear total variation based noise removal algorithms
• Parallel iterative methods for sparse linear systems
• Proximity algorithms for image models: denoising
• Relaxation methods for image denoising based on difference schemes
• Split Bregman methods and frame based image restoration
• The Split Bregman Method for L1-Regularized Problems

Cited in

(5)

• On a class of ill-posed minimization problems in image processing
• A non-gradient-based energy minimization approach to the image denoising problem
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Image Denoising With Dominant Sets by a Coalitional Game Approach
• Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal

This page was built for publication: Explicit iteration schemes for minimization problems arising from image denoising

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643648)