Home  |  Centre for Mathematical Sciences  |  LTH  |  LU
Title: Parallel and Distributed Vision Algorithms Using Dual Decomposition
Full text: PDF
Authors: Strandmark, Petter and Kahl, Fredrik and Schoenemann, Thomas
Year: 2011
Publication: Computer Vision and Image Understanding
Document Type:Journal Paper
Status: In Press
Refereed: Yes
Keywords: optimization, graph cuts, dual decomposition, parallel, MRF, MPI, GPU, globalvision
Alternative location:Go to alternative location: 1
Restricted acces: Yes
Publisher: Elsevier
BibTeX item:BibTeX
Abstract: We investigate dual decomposition approaches for optimization problems arising in low-level vision. Dual decomposition can be used to parallelize existing algorithms, reduce memory requirements and to obtain approximate solutions of hard problems. An extensive set of experiments are performed for a variety of application problems including graph cut segmentation, curvature regularization and more generally the optimization of MRFs. We demonstrate that the technique can be useful for desktop computers, graphical processing units and supercomputer clusters. To facilitate further research, an implementation of the decomposition methods is made publicly available.

 

Back

 

Questions: webmaster
Last updated: 2013-06-04

Centre for Mathematical Sciences, Box 118, SE-22100, Lund. Phone: 046-222 00 00