2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition 2010
DOI: 10.1109/cvpr.2010.5539886
|View full text |Cite
|
Sign up to set email alerts
|

Parallel and distributed graph cuts by dual decomposition

Abstract: Graph cuts methods are at the core of many state-of-theart 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 var… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
98
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 67 publications
(100 citation statements)
references
References 19 publications
2
98
0
Order By: Relevance
“…Instead we develop a Lagrangian dual approach that uses half of the memory compared to RD and it always produces a segmentation. The method can easily be parallelized as described in [16]. Our algorithm is tested on two different data sets, one of which was used in the MICCAI 2009 Cardiac MR Left Ventricle Segmentation Challenge [1], on which we achieve results on par with the competing methods.…”
Section: Introductionmentioning
confidence: 96%
See 2 more Smart Citations
“…Instead we develop a Lagrangian dual approach that uses half of the memory compared to RD and it always produces a segmentation. The method can easily be parallelized as described in [16]. Our algorithm is tested on two different data sets, one of which was used in the MICCAI 2009 Cardiac MR Left Ventricle Segmentation Challenge [1], on which we achieve results on par with the competing methods.…”
Section: Introductionmentioning
confidence: 96%
“…Specifically, the method is easy to implement, but in general has worse convergence properties than first-order gradient-based methods. We refer the reader to [13,16] for details.…”
Section: (6)mentioning
confidence: 99%
See 1 more Smart Citation
“…In the image segmentation context, almost all graph cuts-based methods are impractical to solve such problems due to the memory requirements for storing the underlying graphs. To overcome this situation, some amount of work has been done in this direction and a number of heuristics [9,10,12,5] and exact methods [7,4,13] have been proposed in recent years.…”
Section: Motivation and Scopementioning
confidence: 99%
“…In practice, this sub-problem is solved by casting it as a graph cut (Greig et al, 1989) and using combinatorial algorithms to compute the optimal binary configuration (e.g. Goldberg and Tarjan, 1988;Boykov and Kolmogorov, 2004;Strandmark and Kahl, 2010). Figure 1 illustrates the steps behind a single expansion move.…”
Section: How α-Expansion Workmentioning
confidence: 99%