Fast and exact solution of Total Variation models on the GPU
Institute for Computer Graphics and Vision, Graz University of Technology
Computer Vision and Pattern Recognition Workshops, 2008. CVPRW ’08. IEEE Computer Society Conference on In Computer Vision and Pattern Recognition Workshops, 2008. CVPRW ’08. IEEE Computer Society Conference on (2008), pp. 1-8
@conference{pock2008fast,
title={Fast and exact solution of total variation models on the GPU},
author={Pock, T. and Unger, M. and Cremers, D. and Bischof, H.},
booktitle={Computer Vision and Pattern Recognition Workshops, 2008. CVPRW’08. IEEE Computer Society Conference on},
pages={1–8},
year={2008},
organization={IEEE}
}
This paper discusses fast and accurate methods to solve total variation (TV) models on the graphics processing unit (GPU). We review two prominent models incorporating TV regularization and present different algorithms to solve these models. We mainly concentrate on variational techniques, i.e. algorithms which aim at solving the Euler Lagrange equations associated with the variational model. We then show that particularly these algorithms can be effectively accelerated by implementing them on parallel architectures such as GPUs. For comparison we chose a state-of-the-art method based on discrete optimization techniques. We then present the results of a rigorous performance evaluation including 2D and 3D problems. As a main result we show that the our GPU based algorithms clearly outperform discrete optimization techniques in both speed and maximum problem size.
December 8, 2010 by hgpu
