An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision

Abstract

After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style "push-relabel" methods and algorithms based on Ford-Fulkerson style "augmenting paths." We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.

Exemplar-Based Colour Constancy

“…Furthermore, we include Hirschmueller's seminal Semi-Global Matching (SGM) [15] which is both computationally efficient and provides improved global disparity smoothness constraints compared to DP. Finally, we evaluate the performance of global optimisation using Graph Cuts (GC) (expansion-move) to ascertain if improved results are achievable at additional computational cost [6,5,20,29].…”

Segmenting Tagged Cardiac Mri Data Using a Local Variance Filter

“…Image segmentation by graph-cuts was introduced in [9,10]. The idea of this method is to build a graph G consisting of so-called non-terminal nodes represented by the pixels of the input image and two terminal nodes represented by a source S and a sink T .…”

“…After this preprocessing, common segmentation methods like level-set [7,8] or graph-cuts [9][10][11] can be used. We demonstrate our method in combination with the graph-cuts method since it is faster and it gives results comparable with the level-set method.…”

Graph Cut Approaches for Materials Segmentation Preserving Shape, Appearance, and Topology

“…In this paper we use the multi-labeling framework outlined in [1,2,3,4] to propagate a 2D segmentation from one segmented slice S i to another S i+1 . A labeling algorithm simply assigns an integer (label) to each pixel in S i+1 , in which we use labels to represent the phases in a material (e.g.…”