An Iterative Regularization Method for Total Variation-Based Image Restoration
Top Cited Papers
- 1 January 2005
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 4 (2) , 460-489
- https://doi.org/10.1137/040605412
Abstract
We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods, by using total variation regularization. We obtain rigorous convergence results, and eectiv e stopping criteria for the general procedure. The numerical results for denoising appear to give signican t improvement over standard models and preliminary results for deblurring/denoising are very encouraging.Keywords
This publication has 30 references indexed in Scilit:
- Decomposition of images by the anisotropic Rudin‐Osher‐Fatemi modelCommunications on Pure and Applied Mathematics, 2004
- Geometric surface processing via normal mapsACM Transactions on Graphics, 2003
- Structural Properties of Solutions to Total Variation Regularization ProblemsESAIM: Mathematical Modelling and Numerical Analysis, 2000
- Total variation blind deconvolutionIEEE Transactions on Image Processing, 1998
- Proximal Minimization Methods with Generalized Bregman FunctionsSIAM Journal on Control and Optimization, 1997
- Regularization of linear least squares problems by total bounded variationESAIM: Control, Optimisation and Calculus of Variations, 1997
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman FunctionsSIAM Journal on Optimization, 1993
- Nonlinear total variation based noise removal algorithmsPhysica D: Nonlinear Phenomena, 1992
- An iterative algorithm for signal reconstruction from bispectrumIEEE Transactions on Signal Processing, 1991
- Reconstruction of signals from Fourier transform samplesSignal Processing, 1989