Parallel graph-cuts by adaptive bottom-up merging

Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today's ubiquitous multi-core machines. However, the current best serial algorithm by Boykov and Kolmogorov (called the BK algorithm) s...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition pp. 2181 - 2188
Main Authors Jiangyu Liu, Jian Sun
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Asia
Concurrent computing
Graphics
Image segmentation
Iterative algorithms
Merging
Partitioning algorithms
Pixel
Sun
Surface fitting
Online AccessGet full text

Cover

More Information
Summary:Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today's ubiquitous multi-core machines. However, the current best serial algorithm by Boykov and Kolmogorov (called the BK algorithm) still has the superior empirical performance. It is non-trivial to parallelize as expensive synchronization overhead easily offsets the advantage of parallelism. In this paper, we propose a novel adaptive bottom-up approach to parallelize the BK algorithm. We first uniformly partition the graph into a number of regularly-shaped disjoint subgraphs and process them in parallel, then we incrementally merge the subgraphs in an adaptive way to obtain the global optimum. The new algorithm has three benefits: 1) it is more cache-friendly within smaller subgraphs; 2) it keeps balanced workloads among computing cores; 3) it causes little overhead and is adaptable to the number of available cores. Extensive experiments in common applications such as 2D/3D image segmentations and 3D surface fitting demonstrate the effectiveness of our approach.
ISBN:1424469848
9781424469840
ISSN:1063-6919
1063-6919
DOI:10.1109/CVPR.2010.5539898