The Community for Technology Leaders
RSS Icon
Subscribe
Anchorage, AK, USA
June 23, 2008 to June 28, 2008
ISBN: 978-1-4244-2339-2
pp: 1-8
Thomas Pock , Institute for Computer Graphics and Vision, Graz University of Technology, Austria
Markus Unger , Institute for Computer Graphics and Vision, Graz University of Technology, Austria
Daniel Cremers , Department of Computer Sience, University of Bonn, Germany
Horst Bischof , Institute for Computer Graphics and Vision, Graz University of Technology, Austria
ABSTRACT
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.
CITATION
Thomas Pock, Markus Unger, Daniel Cremers, Horst Bischof, "Fast and exact solution of Total Variation models on the GPU", CVPRW, 2008, 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops 2008, pp. 1-8, doi:10.1109/CVPRW.2008.4563099
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool