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
•Posted Content
Refining Geometry from Depth Sensors using IR Shading Images
TL;DR: A near light source IR shading model is defined that describes the captured intensity as a function of surface normals, albedo, lighting direction, and distance between light source and surface points, to resolve the ambiguity in the model between the normals and distances.
27
Topographic analysis of eyelid position using digital image processing software.
Yeoun Sook Chun,Hong Hyun Park,In Ki Park,Nam Ju Moon,Sang Joon Park,Sang Joon Park,Jeong Kyu Lee +6 more
TL;DR: A novel analysis technique for objective quantification of topographic eyelid position with an algorithmatically calculated scheme and to determine its feasibility is proposed.
27
•Proceedings Article
EEG-GRAPH: A factor-graph-based model for capturing spatial, temporal, and observational relationships in electroencephalograms
Yogatheesan Varatharajah,Min Jin Chong,Krishnakant Saboo,Brent M. Berry,Benjamin H. Brinkmann,Gregory A. Worrell,Ravishankar K. Iyer +6 more
- 01 Jan 2017
TL;DR: A factor-graph-based model with customized factor-functions defined based on domain knowledge is described, to infer pathologic brain activity with the goal of identifying seizure-generating brain regions in epilepsy patients and an inference technique based on the graph-cut algorithm is utilized to exactly solve graph inference in polynomial time.
Generalized Assorted Camera Arrays: Robust Cross-Channel Registration and Applications
TL;DR: A robust cross-channel matching cost function, based on aligning normalized gradients, which allows us to compute cross-Channel subpixel correspondences for scenes exhibiting nontrivial geometry and highlights the promise of GAC arrays with the authors' cross- channel normalized gradient cost for several applications such as low-light imaging, postcapture refocusing, skin perfusion imaging using color + near infrared, and hyperspectral imaging.
Segmenting Human From Photo Images Based on a Coarse-to-Fine Scheme
Huchuan Lu,Guoliang Fang,Xinqing Shao,Xuelong Li +3 more
- 01 Jun 2012
TL;DR: A straightforward framework to automatically recover human bodies from color photos by employing a coarse-to-fine strategy and an iterative multiple oblique histogram algorithm to accurately recover the lower body based on human kinematics is proposed.
27
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.