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
A Likelihood and Local Constraint Level Set Model for Liver Tumor Segmentation from CT Volumes
Changyang Li,Xiuying Wang,Stefan Eberl,Michael J. Fulham,Yong Yin,Jinhu Chen,David Dagan Feng +6 more
TL;DR: A level set model incorporating likelihood energy with the edge energy incorporates the ramp associated with the edges for weak boundaries for hepatic tumor segmentation and outperformed the Chan-Vese and geodesic level set models.
148
RIGOR: Reusing Inference in Graph Cuts for Generating Object Regions
Ahmad Humayun,Fuxin Li,James M. Rehg +2 more
- 23 Jun 2014
TL;DR: The RIGOR algorithm for efficiently generating a pool of overlapping segment proposals in images is proposed, which is slightly better than the state-of-the-art on the PASCAL VOC dataset, while being an order of magnitude faster.
Graph cuts segmentation using an elliptical shape prior
Greg Slabaugh,Gozde Unal +1 more
- 14 Nov 2005
TL;DR: A graph cuts-based image segmentation technique that incorporates an elliptical shape prior that is effective in segmenting vessels and lymph nodes from pelvic magnetic resonance images, as well as human faces.
FTV: Free-viewpoint Television
TL;DR: Free-viewpoint television (FTV) as mentioned in this paperTV enables us to view a 3D scene by freely changing our viewpoint, which is the top of visual media in the world.
146
A Scalable graph-cut algorithm for N-D grids
Andrew Delong,Yuri Boykov +1 more
- 23 Jun 2008
TL;DR: This work enhances the push-relabel algorithm for maximum flow with two practical contributions: first, true global minima can now be computed on immense grid-like graphs too large for physical memory, and for commodity multi-core platforms the algorithm attains near-linear speedup with respect to number of processors.
145
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.