Fast approximate energy minimization via graph cuts

Fast approximate energy minimization via graph cuts (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yuri Boykov , Olga Veksler , Ramin Zabih

Venue:	IEEE Transactions on Pattern Analysis and Machine Intelligence
Citations:	905 - 38 self

BibTeX

@ARTICLE{Boykov01fastapproximate,
    author = {Yuri Boykov and Olga Veksler and Ramin Zabih},
    title = {Fast approximate energy minimization via graph cuts},
    journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
    year = {2001},
    volume = {23},
    pages = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed. The first move we consider is an α-βswap: for a pair of labels α, β, this move exchanges the labels between an arbitrary set of pixels labeled α and another arbitrary set labeled β. Our first algorithm generates a labeling such that there is no swap move that decreases the energy. The second move we consider is an α-expansion: for a label α, this move assigns an arbitrary set of pixels the label α. Our second

Citations

3011	Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images - Geman - 1984
2438	Snakes: active contour models - Kass, Witkin, et al. - 1988
1824	Normalized cuts and image segmentation - Shi, Malik - 2000
1376	Determining optical flow - Horn, Schunck - 1981
1107	Network flows: theory, algorithms and applications - Ahuja, Magnanti, et al. - 1993
910	Spatial interaction and the statistical analysis of lattice systems - Besag - 1974
622	Flows in Networks - Ford, Fulkerson - 1962
621	Visual reconstruction - Blake, Zisserman - 1987
471	An experimental comparison of mincut/max-flow algorithms for energy minimization in vision - Boykov, Kolmogorov - 2004
305	A Markov Random Field Modeling. Computer Vision - Li - 1995
289	Scene labeling by relaxation operations - Rosenfeld, Hummel, et al. - 1976
245	Using dynamic programming for solving variational problems - Amini, Weymouth, et al. - 1990
233	Exact maximum a posteriori estimation for binary images - Greig, Porteous, et al. - 1989
219	On the foundations of relaxation labeling processes - Hummel, Zucker - 1983
216	Regularization of Inverse Visual Problems Involving Discontinuities - Terzopoulos - 1986
215	Computational vision and regularization theory - Poggio, Torre, et al. - 1985
203	Nonuniversal critical dynamics in Monte Carlo simulations - Swendsen, Wang - 1987
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
173	Image Analysis, Random Fields and Dynamic Monte Carlo Methods - Winkler - 1995
170	Bayesian modeling of uncertainty in low-level vision - Szeliski - 1990
166	Statistical Field Theory - Parisi - 1988
148	On the statistical analysis of dirty pictures (with discussion - Besag - 1986
135	A Unified Mixture Framework for Motion Segmentation: Incorporating Spatial Coherence and Estimating the Number of Models - Weiss, EH - 1996
131	Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields - Kleinberg, Tardos - 1999
123	A pixel dissimilarity measure that is insensitive to image sampling - Birchfield, Tomasi - 1998
123	Markov Random Fields with efficient approximations - BOYKOV, VEKSLER, et al. - 1998
115	Boundary detection by constrained optimization - Geman, Geman, et al. - 1990
114	Depth discontinuities by pixel-to-pixel stereo - Birchfield, Tomasi - 1998
97	RB: Some generalized order-disorder transformations - Potts - 1953
84	The theory and practice of bayesian image labeling - Chou, Brown - 1990
81	Occlusions, discontinuities, and epipolar lines in stereo - Ishikawa, Geiger - 1998
76	Segmentation by grouping junctions - ISHIKAWA, GEIGER - 1998
72	Computational vision and regularization theory. Nature 317 - Poggio, Torre, et al. - 1985
71	A Common Framework for Image Segmentation - Geiger, Yuille - 1991
64	Self-Organization in Vision: Stochastic Clustering for Image Segmentation; Perceptual Grouping and Image Database Organization - Gdalyahu, Weinshall, et al. - 2001
63	Efficient Graph-based Energy Minimization Methods in Computer Vision - Veksler - 1999
57	The complexity of multiway cuts - Dalhaus, Johnson, et al. - 1992
54	Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems - Kant, He - 1997
47	Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction - Blake - 1989
35	An experimental comparison of stereo algorithms - Szeliski, Zabih - 1999
34	Parallel integration of vision modules - Poggio, Gamble, et al. - 1988
33	Determining optical How - Horn, Schunk - 1981
27	Computational complexity - Johnson, Papadimitriou
24	Image segmentation by nested cut - Veksler - 2004
23	The dynamics of nonlinear relaxation labeling processes - Pelillo - 1997
20	Depth and Motion Discontinuities - Birchfield - 1999
19	Global Optimization using Embedded Graphs - Ishikawa - 2000
13	Markov random with ecient approximations - Boykov, Veksler, et al. - 1998