Cut, Glue & Cut: A Fast, Approximate Solver for Multicut Partitioning

Thorsten Beier, Thorben Kroeger, Jorg H. Kappes, Ullrich Kothe, Fred A. Hamprecht; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 73-80

Abstract


Recently, unsupervised image segmentation has become increasingly popular. Starting from a superpixel segmentation, an edge-weighted region adjacency graph is constructed. Amongst all segmentations of the graph, the one which best conforms to the given image evidence, as measured by the sum of cut edge weights, is chosen. Since this problem is NP-hard, we propose a new approximate solver based on the move-making paradigm: first, the graph is recursively partitioned into small regions (cut phase). Then, for any two adjacent regions, we consider alternative cuts of these two regions defining possible moves (glue & cut phase). For planar problems, the optimal move can be found, whereas for non-planar problems, efficient approximations exist. We evaluate our algorithm on published and new benchmark datasets, which we make available here. The proposed algorithm finds segmentations that, as measured by a loss function, are as close to the ground-truth as the global optimum found by exact solvers. It does so significantly faster then existing approximate methods, which is important for large-scale problems.

Related Material


[pdf]
[bibtex]
@InProceedings{Beier_2014_CVPR,
author = {Beier, Thorsten and Kroeger, Thorben and Kappes, Jorg H. and Kothe, Ullrich and Hamprecht, Fred A.},
title = {Cut, Glue & Cut: A Fast, Approximate Solver for Multicut Partitioning},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2014}
}