Relaxation Methods for Image Denoising Based on Difference Schemes
Authors:
- Rong-Qing JiaRJRong-Qing Jia
- Hanqing ZhaoHZHanqing Zhao
- Wei ZhaoWZWei Zhao
- 1 January 2011
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 9 (1) , 355-372
Abstract
In this paper, we propose some relaxation methods that can be used to design very fast iteration schemes for image denoising based on the total variation model. By using certain techniques from convex optimization, we establish the convergence of the iteration schemes based on these relaxation methods. Furthermore, we provide some empirical formulas for the parameters needed in the denoising model. As a result, we are able to construct automatic algorithms for image denoising that produce nearly optimal results. Finally, we apply the relaxation methods to image denoising based on high-order difference schemes. The resulting iteration scheme is fast and yields significantly better image quality than the numerical schemes based on the total variation model.Keywords
This publication has 18 references indexed in Scilit:
- Split Bregman Methods and Frame Based Image RestorationMultiscale Modeling & Simulation, 2010
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring ProblemsIEEE Transactions on Image Processing, 2009
- The Split Bregman Method for L1-Regularized ProblemsSIAM Journal on Imaging Sciences, 2009
- A Compound Algorithm of Denoising Using Second-Order and Fourth-Order Partial Differential EquationsNumerical Mathematics: Theory, Methods and Applications, 2009
- Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact OptimizationJournal of Mathematical Imaging and Vision, 2006
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- Image Sharpening by Flows Based on Triple Well PotentialsJournal of Mathematical Imaging and Vision, 2004
- Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondifferentiable MappingsSIAM Journal on Numerical Analysis, 1998
- De-noising by soft-thresholdingIEEE Transactions on Information Theory, 1995
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967