Fast algorithm for total variation minimization

24Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The total variation (TV) regularization method is very attractive for various image processing applications. In order to apply the TV approach to the motion pictures, it is required to reduce the computational time of the iterative TV regularization processing. In this paper, we propose a method that accelerates the convergence speed of the Chambolle's algorithm. Our proposal is based on introduction of 4-directional TV criterion and 4-dimesional dual vector. The experimental results show that we obtain less than half iteration number and 56 % computational time compared with the original Chambolle's algorithm. © 2011 IEEE.

Cite

CITATION STYLE

APA

Sakurai, M., Kiriyama, S., Goto, T., & Hirano, S. (2011). Fast algorithm for total variation minimization. In Proceedings - International Conference on Image Processing, ICIP (pp. 1461–1464). https://doi.org/10.1109/ICIP.2011.6115718

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free