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
Branch-and-cut algorithms for the split delivery vehicle routing problem
TL;DR: Two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum are presented.
102
Evaluation of Aerial Remote Sensing Techniques for Vegetation Management in Power-Line Corridors
Steven J. Mills,Marcos Castro,Zhengrong Li,Jinhai Cai,Ross Hayward,Luis Mejias,Rodney A. Walker +6 more
TL;DR: Tree detection was achieved through crown delineation using a pulse-coupled neural network and morphologic reconstruction applied to multispectral imagery, and a small number of poles were missed with detection rates of 98% and 95% for LiDAR and stereo matching.
Image Registration
A. Goshtasby,Larry L. Schumaker +1 more
TL;DR: This book presents a thorough and detailed guide to image registration, outlining the principles and reviewing state-of-the-art tools and methods, as well as measuring and comparing their performances using synthetic and real data.
102
DenseCut: Densely Connected CRFs for Realtime GrabCut
Ming-Ming Cheng,Ming-Ming Cheng,Victor Adrian Prisacariu,Shuai Zheng,Philip H. S. Torr,Carsten Rother +5 more
TL;DR: A very fast segmentation technique which still achieves very high quality results is demonstrated and is proposed to replace the time consuming iterative refinement of global colour models in traditional GrabCut formulation by a densely connected crf.
A survey on image and video stitching
Wei Lyu,Zhong Zhou,Lang Chen,Yi Zhou +3 more
- 14 Aug 2019
TL;DR: This survey reviews the latest image/video stitching methods, and introduces the fundamental principles/advantages/weaknesses of image/ video stitching algorithms, and discusses panoramic stitching as a special-extension of image / video stitching.
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.