Primal-dual algorithms for total variation based image restoration under Poisson noise Dedicated to Professor Lin Qun on the Occasion of his 80th Birthday

被引:1
作者
WEN YouWei [1 ]
CHAN Raymond Honfu [2 ]
ZENG TieYong [3 ]
机构
[1] Faculty of Science, Kunming University of Science and Technology
[2] Department of Mathematics, The Chinese University of Hong Kong
[3] Department of Mathematics, Hong Kong Baptist University
基金
中国国家自然科学基金;
关键词
image restoration; Poisson noise; total variation(TV); alternating direction method of multipliers(ADMM); primal-dual; minimax problem;
D O I
暂无
中图分类号
TP391.41 [];
学科分类号
080203 ;
摘要
We consider the problem of restoring images corrupted by Poisson noise. Under the framework of maximum a posteriori estimator, the problem can be converted into a minimization problem where the objective function is composed of a Kullback-Leibler(KL)-divergence term for the Poisson noise and a total variation(TV) regularization term. Due to the logarithm function in the KL-divergence term, the non-differentiability of TV term and the positivity constraint on the images, it is not easy to design stable and efficiency algorithm for the problem. Recently, many researchers proposed to solve the problem by alternating direction method of multipliers(ADMM). Since the approach introduces some auxiliary variables and requires the solution of some linear systems, the iterative procedure can be complicated. Here we formulate the problem as two new constrained minimax problems and solve them by Chambolle-Pock’s first order primal-dual approach. The convergence of our approach is guaranteed by their theory. Comparing with ADMM approaches, our approach requires about half of the auxiliary variables and is matrix-inversion free. Numerical results show that our proposed algorithms are efficient and outperform the ADMM approach.
引用
收藏
页码:141 / 160
页数:20
相关论文
共 12 条
[11]  
Fast Numerical Algorithms for Total Variation Based Image Restoration .2 Zhu M. University of California . 2008
[12]  
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators[J] . Jonathan Eckstein,Dimitri P. Bertsekas.Mathematical Programming . 1992 (1-3)