Fast approximate energy minimization via graph cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 23, Issue 11, 2001, Pages 1222-1239

  Boykov, Yuri ^a,b   Veksler, Olga ^a,c   Zabih, Ramin ^a,d  

^a IEEE   (United States)

^b SIEMENS CORPORATE RESEARCH   (United States)

^c NEC LABORATORIES AMERICA   (United States)

^d Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Early vision; Energy minimization; Graph algorithms; Image restoration; Markov random fields; Maximum flow; Minimum cut; Motion; Multiway cut; Potts model; Stereo

Indexed keywords

ENERGY MINIMIZATION; GLOBAL MINIMIZATION; POTTS MODEL;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GLOBAL OPTIMIZATION; GRAPH THEORY; IMAGE QUALITY; IMAGE RECONSTRUCTION; MARKOV PROCESSES; MATHEMATICAL MODELS; SIMULATED ANNEALING; STEREO VISION;

COMPUTER VISION;

EID: 0035509961     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.969114     Document Type: Article

References (47)

1. Using dynamic programming for solving variational problems in vision
2. Unsupervised image segmentation
3. On the statistical analysis of dirty pictures
4. Depth discontinuities by pixel-to-pixel stereo
5. A pixel dissimilarity measure that is insensitive to image sampling
6. Depth and motion discontinuities
7. Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction
8. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
9. Markov random fields with efficient approximations
10. The theory and practice of bayesian image labeling
11. The complexity of multiway cuts
12. Fast approximate maximum a posteriori restoration of multicolour images
13. Self-organization in vision: Stochastic clustering for image segmentation, perceptual grouping, and image database organization
14. A common framework for image segmentation
15. Boundary detection by constrained optimization
16. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
17. Exact maximum A posteriori estimation for binary images
18. Discontinuity detection for visual surface reconstruction
19. Determining optical flow
20. On the foundations of relaxation labeling processes
21. Occlusions, discontinuities, and epipolar lines in stereo
22. Global optimization using embedded graphs
23. Snakes: Active contour models
24. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields
25. Computing visual correspondence with occlusions via graph cuts
26. One dimensional regularization with discontinuities
27. The dynamics of nonlinear relaxation labeling processes
28. Parallel integration of vision modules
29. Computational vision and regularization theory
30. Some generalized order-disorder transformation
31. Scene labeling by relaxation operations
32. A maximum-flow formulation of the n-camera stereo correspondence problem
33. Normalized cuts and image segmentation
34. Nonuniversal critical dynamics in Monte Carlo simulations
35. An experimental comparison of stereo algorithms
36. Bayesian modeling of uncertainty in low-level vision
37. Regularization of inverse visual problems involving discontinuities
38. Efficient graph-based energy minimization methods in computer vision
39. Image segmentation by nested cuts
40. A unified mixture framework for motion segmentation: Incorporating spatial coherence and estimating the number of models
41. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation