A generalized matrix Krylov subspace method for TV regularization
From MaRDI portal
Abstract: This paper presents an efficient algorithm to solve total variation (TV) regularizations of images contaminated by a both blur and noise. The unconstrained structure of the problem suggests that one can solve a constrained optimization problem by transforming the original unconstrained minimization problem to an equivalent constrained minimization one. An augmented Lagrangian method is developed to handle the constraints when the model is given with matrix variables, and an alternating direction method (ADM) is used to iteratively find solutions. The solutions of some sub-problems are belonging to subspaces generated by application of successive orthogonal projections onto a class of generalized matrix Krylov subspaces of increasing dimension.
Recommendations
- Alternating Krylov subspace image restoration methods
- Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- Flexible GMRES for total variation regularization
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
Cites work
- scientific article; zbMATH DE number 5297600 (Why is no real title available?)
- scientific article; zbMATH DE number 1194487 (Why is no real title available?)
- scientific article; zbMATH DE number 49594 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalized Krylov subspace method for \(\ell_p\)-\(\ell_q\) minimization
- A global Lanczos method for image restoration
- A new inexact alternating directions method for monotone variational inequalities
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- Augmented Lagrangian method for total variation restoration with non-quadratic fidelity
- Computational Methods for Inverse Problems
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Convex constrained optimization for large-scale generalized Sylvester equations
- Correction to: ``Solution methods for linear discrete ill-posed problems for color image restoration
- Coupled segmentation and denoising/deblurring models for hyperspectral material identification.
- Deblurring Images
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast, robust total variation-based reconstruction of noisy, blurred images
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global FOM and GMRES algorithms for matrix equations
- Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Modeling and inverse problems in image analysis. Transl. from the French
- Multiplier and gradient methods
- Nonlinear total variation based noise removal algorithms
- Practical augmented Lagrangian methods for constrained optimization
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Sparse Reconstruction by Separable Approximation
- The Split Bregman Method for L1-Regularized Problems
Cited in
(8)- Fast alternating direction multipliers method by generalized Krylov subspaces
- Alternating Krylov subspace image restoration methods
- Augmented-Lagrangian regularization of matrix-valued maps
- Tensorial total variation-based image and video restoration with optimized projection methods
- A modulus iteration method for non-negatively constrained TV image restoration
- ADMM in Krylov subspace and its application to total variation restoration of spatially variant blur
- Higher-order TV methods -- enhancement via Bregman iteration
- Fast multidimensional completion and principal component analysis methods via the cosine product
This page was built for publication: A generalized matrix Krylov subspace method for TV regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989195)
