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
Moving Object Segmentation Using Optical Flow and Depth Information
Jens Klappstein,Tobi Vaudrey,Clemens Rabe,Andreas Wedel,Reinhard Klette +4 more
- 09 Jan 2009
TL;DR: Object detection is based on motion analysis of individually tracked image points, providing a motion metric which corresponds to the likelihood that the tracked point is moving, and is segmented into objects by employing a globally optimal graph-cut algorithm.
Efficient Algorithm for Level Set Method Preserving Distance Function
Virginia Estellers,Dominique Zosso,Rongjie Lai,Stanley Osher,Jean-Philippe Thiran,Xavier Bresson +5 more
TL;DR: The proposed algorithm is inspired by recent efficient l1 optimization techniques and it naturally preserves the level set function as a distance function during the evolution, which avoids the classical re-distancing problem in level set methods.
104
Simultaneous Phase Unwrapping and Removal of Chemical Shift (SPURS) Using Graph Cuts: Application in Quantitative Susceptibility Mapping
Jianwu Dong,Tian Liu,Feng Chen,Dong Zhou,Alexey Dimov,Ashish Raj,Qiang Cheng,Pascal Spincemaille,Yi Wang +8 more
TL;DR: Experimental results show substantial improvements in field map estimation, water/fat separation and reconstructed QSM compared to two existing water/ fat separation methods on 1.5T and 3T magnetic resonance human data with long echo spacing and rapid field map variation.
103
Analysis of Hand Segmentation in the Wild
Aisha Urooj Khan,Ali Borji +1 more
- 18 Jun 2018
TL;DR: This work fine-tune RefineNet, a leading semantic segmentation method, for hand segmentation and finds that it does much better than the best contenders and explores whether conditional random fields can help refine generated hand segmentations.
Maximum flows by incremental breadth-first search
Andrew V. Goldberg,Sagi Hed,Haim Kaplan,Robert E. Tarjan,Renato F. Werneck +4 more
- 05 Sep 2011
TL;DR: The incremental breadth-first search (IBFS) method is introduced, which uses ideas from BK but augments on shortest paths and usually outperforms BK on vision problems.
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.