An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yuri Boykov , Vladimir Kolmogorov

Venue:	IEEE Transactions on Pattern Analysis and Machine Intelligence
Citations:	471 - 36 self

BibTeX

@ARTICLE{Boykov01anexperimental,
    author = {Yuri Boykov and Vladimir Kolmogorov},
    title = {An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision},
    journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
    year = {2001},
    volume = {26},
    pages = {359--374}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

After [10, 15, 12, 2, 4] minimum cut/maximum ow 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-ow algorithms with dierent polynomial time complexity. Their practical eciency, however, has to date been studied mainly outside the scope of computer vision.

Citations

905	Fast approximate energy minimization via graph cuts - Boykov, Veksler, et al.
708	Taxonomy and evaluation of dense two-frame stereo correspondence algorithms - Scharstein, Szeliski
622	Flows in Networks - Ford, Fulkerson - 1962
481	Level Set Methods and Fast Marching Methods - Sethian - 1999
443	Fedkiw, Level Set Methods and Dynamic Implicit Surfaces - Osher, P - 2002
424	What energy functions can be minimized via graph cuts - Kolmogorov, Zabih
413	Interactive graph cuts for optimal boundary & region segmentation of objects in nd images - Boykov, Jolly
391	A new approach to the maximum flow problem - Goldberg, Tarjan
267	Graphcut Textures: Image and Video Synthesis Using Graph Cuts - Kwatra, Schodl, et al. - 2003
233	Exact maximum a posteriori estimation for binary images - Greig, Porteous, et al. - 1989
200	An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation - Wu, Leahy - 1993
195	Computing Visual Correspondence with Occlusions Using Graph Cuts - Kolmogorov, Zabih - 2001
192	A maximum-flow formulation of the n-camera stereo correspondence problem - Roy, Cox - 1998
190	Multi-camera scene reconstruction via graph cuts - Kolmogorov, Zabih
188	Combinatorial Optimization - Cook, Cunningham, et al. - 1998
185	Geometric Partial Differential Equations and Image Analysis - Sapiro - 2001
137	Faster shortestpath algorithms for planar graphs - Henzinger, Klein, et al. - 1997
123	Computing geodesics and minimal surfaces via graph cuts - Boykov, Kolmogorov
123	Markov Random Fields with efficient approximations - BOYKOV, VEKSLER, et al. - 1998
119	On implementing the push—relabel method for the maximum flow problem - Cherkassky, Goldberg - 1997
103	Algorithm for solution of a problem of maximum flow in networks with power estimation - Dinic - 1970
100	Exact optimization for Markov random fields with convex priors - Ishikawa
84	Large occlusion stereo - Bobick, Intille - 1999
81	Occlusions, discontinuities, and epipolar lines in stereo - Ishikawa, Geiger - 1998
76	Segmentation by grouping junctions - ISHIKAWA, GEIGER - 1998
63	Exact voxel occupancy with graph cuts - Snow, Viola, et al.
57	Random sampling in cut, flow, and network design problems - Karger - 1994
45	Stereo Without Epipolar Lines: A Maximum-Flow Formulation - ROY - 1999
36	Flow in planar graphs with multiple sources and sinks - Miller, Naor - 1995
35	An experimental comparison of stereo algorithms - Szeliski, Zabih - 1999
24	Image segmentation by nested cut - Veksler - 2004
23	Min surfaces for stereo - Buehler, Gortler, et al. - 2002
15	A new approach to the maximum problem - Goldberg, Tarjan - 1988
13	A new bayesian framework for object recognition - Boykov, Huttenlocher - 1999
13	Markov random with ecient approximations - Boykov, Veksler, et al. - 1998
11	Incorporating spatial priors into an information theoretic approach for fMRI data analysis - Kim, Fish, et al. - 2000
6	Fusion of color, shading and boundary information for factory pipe segmentation - Thirion, Bascle, et al. - 2000
3	Algorithm for solution of a problem of maximum in networks with power estimation - Dinic - 1970
2	Optimal Object Extraction via Constrained GraphCuts - Boykov, Funka-Lea - 2001
2	and Venu Govindu. MRF solutions for probabilistic optical flow formulations - Roy - 2000
1	Graph-based Algorithms for Multi-camera Reconstruction Problem - Kolmogorov - 2003