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
Leaf segmentation, classification, and three-dimensional recovery from a few images with close viewpoints
TL;DR: This system can segment leaves from images of live plants with arbitrary image conditions, and classify them against sketched leaf shapes or real leaves, and estimate the three-dimensional information of leaves which is not only useful for leaf segmentation but is also beneficial for further 3-D shape recovery.
47
Learning Structured Models for Segmentation of 2-D and 3-D Imagery
Aurelien Lucchi,Pablo Márquez-Neila,Carlos Becker,Yunpeng Li,Kevin Smith,Graham Knott,Pascal Fua +6 more
TL;DR: A method to “kernelize” the features of structured support vector machines so that a linear SSVM framework can leverage the power of nonlinear kernels without incurring much additional computational cost is introduced.
Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation
Eleftherios G. Manousakis,Panagiotis P. Repoussis,Panagiotis P. Repoussis,Emmanouil E. Zachariadis,Christos D. Tarantilis +4 more
TL;DR: A branch-and-cut algorithm that employs methods for separating various families of cuts is proposed and improves 139 upper bounds out of 200 hard-to-solve larger problems of the IRP literature.
47
Panorama weaving: fast and flexible seam processing
Brian Summa,Julien Tierny,Valerio Pascucci +2 more
- 01 Jul 2012
TL;DR: This paper introduces the Panorama Weaving technique for seam creation and editing in an image mosaic and provides a procedure to create boundaries for panoramas that is fast, has low memory requirements and is easy to parallelize.
47
Implementation of an effective time-saving two-stage methodology for microstructural characterization of cemented carbides
TL;DR: In this article, a two-stage methodology for microstructural characterization of hardmetals is presented, which involves an experimental assessment of grain size on processed images corresponding to a series of WC-Co and WC-Ni cemented carbide grades with different micro-structural characteristics.
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.