Sökning: onr:"swepub:oai:lup.lub.lu.se:8d6fa8fb-cf7b-4e3f-b1f7-885f9e1f7c94" >
Parallel and Distri...
Parallel and Distributed Graph Cuts by Dual Decomposition
-
- Strandmark, Petter (författare)
- Lund University,Lunds universitet,Matematik LTH,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Mathematics (Faculty of Engineering),Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH
-
- Kahl, Fredrik (författare)
- Lund University,Lunds universitet,Matematik LTH,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Mathematics (Faculty of Engineering),Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH
-
(creator_code:org_t)
- 2010
- 2010
- Engelska 8 s.
-
Ingår i: IEEE Conference on Computer Vision and Pattern Recognition. - 1063-6919. - 9781424469840 ; , s. 2085-2092
- Relaterad länk:
-
https://portal.resea... (primary) (free)
-
visa fler...
-
http://www.maths.lth... (free)
-
http://dx.doi.org/10...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Graph cuts methods are at the core of many state-of-the-art algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve the maximum flow/minimum cut problem in parallel by splitting the graph into multiple parts and hence, further increase the computational efficacy of graph cuts. Optimality of the solution is guaranteed by dual decomposition, or more specifically, the solutions to the subproblems are constrained to be equal on the overlap with dual variables. We demonstrate that our approach both allows (i) faster processing on multi-core computers and (ii) the capability to handle larger problems by splitting the graph across multiple computers on a distributed network. Even though our approach does not give a theoretical guarantee of speed-up, an extensive empirical evaluation on several applications with many different data sets consistently shows good performance. An open source C++ implementation of the dual decomposition method is also made publicly available.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- mpi
- supercomputer
- parallel
- graph cuts
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas