A fast algorithm for the total variation model of image denoising

被引：0
作者：
Rong-Qing Jia
Hanqing Zhao
机构：
[1] University of Alberta,Department of Mathematical and Statistical Sciences
来源：
Advances in Computational Mathematics | 2010年 / 33卷
关键词：
Total variation; Optimization; Image denoising; 65K10; 68U10; 26B25;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The total variation model of Rudin, Osher, and Fatemi for image denoising is considered to be one of the best denoising models. In the past, its solutions were based on nonlinear partial differential equations and the resulting algorithms were very complicated. In this paper, we propose a fast algorithm for the solution of the total variation model. Our algorithm is very simple and does not involve partial differential equations. We also provide a rigorous proof for the convergence of our algorithm.
引用
收藏
页码：231 / 241
页数：10
相关论文
共 12 条
[1]  
Bregman L(1967)The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex optimization USSR Comput. Math. Math. Phys. 7 200-217
[2]  
Jia RQ(2009)Convergence analysis of the Bregman method for the variational model of image denoising Appl. Comput. Harmon. Anal. 4 460-489
[3]  
Zhao HQ(2005)An iterative regularization method for total variation-based image restoration Multiscale Model. Simul. 60 259-268
[4]  
Zhao W(1992)Nonlinear total variation based noise removal algorithms Phys. D undefined undefined-undefined
[5]  
Osher S(undefined)undefined undefined undefined undefined-undefined
[6]  
Burger M(undefined)undefined undefined undefined undefined-undefined
[7]  
Goldfarb D(undefined)undefined undefined undefined undefined-undefined
[8]  
Xu JJ(undefined)undefined undefined undefined undefined-undefined
[9]  
Yin WT(undefined)undefined undefined undefined undefined-undefined
[10]  
Rudin L(undefined)undefined undefined undefined undefined-undefined
12