An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
Yuri Boykov,Vladimir Kolmogorov +1 more
- 03 Sep 2001
- pp 359-374
TL;DR: The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision, comparing the running times of several standard algorithms, as well as a new algorithm that is recently developed.
read more
Abstract: After [10, 15, 12, 2, 4] 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 energy minimization 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-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 interactive segmentation. In many cases our new algorithm works several times faster than any of the other methods making near real-time performance possible.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Graph cut segmentation with a statistical shape model in cardiac MRI
TL;DR: This work introduces a segmentation method based on a statistical shape model obtained with a principal component analysis (PCA) on a set of representative shapes of the RV that has been applied on 248 MR images of a publicly available dataset and shows that encouraging results can be obtained.
108
Video Object Discovery and Co-Segmentation with Extremely Weak Supervision
TL;DR: The proposed spatio-temporal energy minimization formulation for simultaneous video object discovery and co-segmentation across multiple videos containing irrelevant frames compares favorably with the state-of-the-art in all of these experiments.
Video Inpainting With Short-Term Windows: Application to Object Removal and Error Concealment
TL;DR: Experiments with several challenging video sequences show that the proposed video inpainting method provides visually pleasing results for object removal, error concealment, and background reconstruction context.
Harmony Potentials
Xavier Boix,Josep M. Gonfaus,Joost van de Weijer,Andrew D. Bagdanov,Joan Serrat,Jordi Gonzàlez +5 more
TL;DR: A new consistency potential is proposed for image labeling problems that can encode any possible combination of labels, penalizing only unlikely combinations of classes, and an effective sampling strategy is proposed over this expanded label set that renders tractable the underlying optimization problem.
106
Fast Partitioning of Vector-Valued Images ∗
Martin Storath,Andreas Weinmann +1 more
TL;DR: This work proposes a fast splitting approach to the classical variational formulation of the image partitioning problem, which is frequently referred to as the Potts or piecewise constant Mumford--Shah model, and produces results of a quality comparable with that of graph cuts and the convex relaxation strategies.
References
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
TL;DR: This paper has designed a stand-alone, flexible C++ implementation that enables the evaluation of individual components and that can easily be extended to include new algorithms.
Fast approximate energy minimization via graph cuts
TL;DR: This work presents two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves that allow important cases of discontinuity preserving energies.
•Book
Level Set Methods and Dynamic Implicit Surfaces
Stanley Osher,Ronald Fedkiw +1 more
- 31 Oct 2002
TL;DR: A student or researcher working in mathematics, computer graphics, science, or engineering interested in any dynamic moving front, which might change its topology or develop singularities, will find this book interesting and useful.
6.1K
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Yuri Boykov,Vladimir Kolmogorov +1 more
TL;DR: This paper compares the running times of several standard algorithms, as well as a new algorithm that is recently developed that works several times faster than any of the other methods, making near real-time performance possible.
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
Yuri Boykov,Marie-Pierre Jolly +1 more
- 07 Jul 2001
TL;DR: In this paper, the user marks certain pixels as "object" or "background" to provide hard constraints for segmentation, and additional soft constraints incorporate both boundary and region information.