Explicit iteration schemes for minimization problems arising from image denoising (Q643648)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Explicit iteration schemes for minimization problems arising from image denoising |
scientific article |
Statements
Explicit iteration schemes for minimization problems arising from image denoising (English)
0 references
2 November 2011
0 references
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.
0 references
convex optimization
0 references
total variation
0 references
image denoising
0 references
Gauss-Seidel method
0 references
split Bregman method
0 references
iteration scheme
0 references
matrix splitting
0 references
convergence
0 references
0 references
0 references