An Iterative Regularization Method for Total Variation-Based Image Restoration
Stanley Osher, Martin Burger, Donald Goldfarb et al. · Multiscale Modeling and Simulation · 2005
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 effective stopping criteria for the general procedure. The numerical results for denoising appear to give significant improvement over standard models, and preliminary results for deblurring/denoising are very encouraging.
Cited by 1,772 works. doi:10.1137/040605412
Authors
References
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Nonlinear total variation based noise removal algorithms
- Convex Analysis and Variational Problems
- Image inpainting
- Regularization of Inverse Problems
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
- Image recovery via total variation minimization and related problems
- Computational Methods for Inverse Problems
- Oscillating Patterns in Image Processing and Nonlinear Evolution Equations
- Convex Analysis and Variational Problems