Duality-based algorithms for total-variation-regularized image restoration

Authors:
Mingqiang Zhu;Stephen J. Wright;Tony F. Chan
Affiliations:
Mathematics Department, UCLA, Los Angeles, USA 90095-1555;Department of Computer Sciences, University of Wisconsin, Madison, USA 53705;Mathematics Department, UCLA, Los Angeles, USA 90095-1555
Venue:
Computational Optimization and Applications
Year:
2010

Citing 10
Cited 11

Nonlinear total variation based noise removal algorithms

Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Iterative methods for total variation denoising

SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration

SIAM Journal on Scientific Computing
Convex analysis and variational problems

Convex analysis and variational problems
Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal

SIAM Journal on Scientific Computing
Nonmonotone Spectral Projected Gradient Methods on Convex Sets

SIAM Journal on Optimization
An Algorithm for Total Variation Minimization and Applications

Journal of Mathematical Imaging and Vision
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming

Numerische Mathematik
Second-order Cone Programming Methods for Total Variation-Based Image Restoration

SIAM Journal on Scientific Computing
An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration

SIAM Journal on Scientific Computing

Mathematical Modeling of Textures: Application to Color Image Decomposition with a Projected Gradient Algorithm

Journal of Mathematical Imaging and Vision
A projected gradient algorithm based on the augmented Lagrangian strategy for image restoration and texture extraction

Image and Vision Computing
A unifying approach to isotropic and anisotropic total variation denoising models

Journal of Computational and Applied Mathematics
Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models

SIAM Journal on Imaging Sciences
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science

SIAM Journal on Imaging Sciences
Some projection methods with the BB step sizes for variational inequalities

Journal of Computational and Applied Mathematics
Fast Algorithms for Image Reconstruction with Application to Partially Parallel MR Imaging

SIAM Journal on Imaging Sciences
Bregman operator splitting with variable stepsize for total variation image reconstruction

Computational Optimization and Applications
Inverse electrocardiographic source localization of ischemia: An optimization framework and finite element solution

Journal of Computational Physics
Nonlinear multigrid method for solving the anisotropic image denoising models

Numerical Algorithms
Vectorial total variation regularisation of orientation distribution functions in diffusion weighted MRI

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Image restoration models based on total variation (TV) have become popular since their introduction by Rudin, Osher, and Fatemi (ROF) in 1992. The dual formulation of this model has a quadratic objective with separable constraints, making projections onto the feasible set easy to compute. This paper proposes application of gradient projection (GP) algorithms to the dual formulation. We test variants of GP with different step length selection and line search strategies, including techniques based on the Barzilai-Borwein method. Global convergence can in some cases be proved by appealing to existing theory. We also propose a sequential quadratic programming (SQP) approach that takes account of the curvature of the boundary of the dual feasible set. Computational experiments show that the proposed approaches perform well in a wide range of applications and that some are significantly faster than previously proposed methods, particularly when only modest accuracy in the solution is required.