An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 26, Issue 9, 2004, Pages 1124-1137

  Boykov, Yuri ^a   Kolmogorov, Vladimir ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b IEEE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EDGE DETECTION; GRAPH THEORY; IMAGE RECONSTRUCTION; IMAGE SEGMENTATION; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; STEREO VISION; THREE DIMENSIONAL COMPUTER GRAPHICS;

ENERGY MINIMIZATION; GRAPH ALGORITHMS; MAXIMUM FLOW ALGORITHMS; MINIMUM CUT ALGORITHMS; MULTICAMERA SCENE RECONSTRUCTION; POTTS MODEL;

COMPUTER VISION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; COMPUTER ASSISTED DIAGNOSIS; ENERGY TRANSFER; EVALUATION; IMAGE ENHANCEMENT; INFORMATION RETRIEVAL; METHODOLOGY; PHOTOGRAPHY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; ENERGY TRANSFER; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED; PHOTOGRAMMETRY; PHOTOGRAPHY; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY;

EID: 4344598245     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2004.60     Document Type: Article

References (40)

1. A.F. Bobick and S.S. Intille, "Large Occlusion Stereo," Int'l J. Computer Vision, vol. 33, no. 3, pp. 181-200, Sept. 1999.
2. Y. Boykov and D. Huttenlocher, "A New Bayesian Framework for Object Recognition," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. II, pp. 517-523, 1999.
3. Y. Boykov and V. Kolmogorov, "Computing Geodesics and Minimal Surfaces via Graph Cuts," Proc. Int'l Conf. Computer Vision, vol. I, pp. 26-33, 2003.
4. Y. Boykov, O. Veksler, and R. Zabih, "Markov Random Fields with Efficient Approximations," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 648-655, 1998.
5. Y. Boykov and G. Funka-Lea, "Optimal Object Extraction via Constrained Graph-Cuts," Int'l J. Computer Vision, 2004. to appear.
6. Y. Boykov and M.-P. Jolly, "Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images," Proc. Int'l Conf. Computer Vision, vol. I, pp. 105-112, July 2001.
7. Y. Boykov and V. Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision," Proc. Int'l Workshop Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 359-374, Sept. 2001.
8. Y. Boykov, O. Veksler, and R. Zabih, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
9. C. Buehler, S.J. Gortler, M.F. Cohen, and L. McMillan, "Minimal Surfaces for Stereo," Proc. Seventh European Conf. Computer Vision, vol. III, pp. 885-899, May 2002.
10. B.V. Cherkassky and A.V. Goldberg, "On Implementing Push-Relabel Method for the Maximum Flow Problem," Algorithmica, vol. 19, pp. 390-410, 1997.
11. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver, Combinatorial Optimization. John Wiley & Sons, 1998.
12. E.A. Dinic, "Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation," Soviet Math. Dokl., vol. 11, pp. 1277-1280, 1970.
13. L. Ford and D. Fulkerson, Flows in Networks. Princeton Univ. Press, 1962.
14. A.V. Goldberg and R.E. Tarjan, "A New Approach to the Maximum-Flow Problem," J. ACM, vol. 35, no. 4, pp. 921-940, Oct. 1988.
15. D. Greig, B. Porteous, and A. Seheult, "Exact Maximum A Posteriori Estimation for Binary Images," J. Royal Statistical Soc., Series B, vol. 51, no. 2, pp. 271-279, 1989.
16. M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian, "Faster Shortest-Path Algorithms for Planar Graphs," J. Computer and System Sciences, vol. 55, pp. 3-23, 1997.
17. H. Ishikawa and D. Geiger, "Occlusions, Discontinuities, and Epipolar Lines in Stereo," Proc. Fifth European Conf. Computer Vision, pp. 232-248, 1998.
18. H. Ishikawa and D. Geiger, "Segmentation by Grouping Junctions," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 125-131, 1998.
19. H. Ishikawa, "Exact Optimization for Markov Random Fields with Convex Priors," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp. 1333-1336, Oct. 2003.
20. D.R. Karger, "Random Sampling in Cut, Flow, and Network Design Problems," Math. Operations Research, vol. 24, no. 2, pp. 383-413, May 1999.
21. J. Kim, J.W. Fisher III, A. Tsai, C. Wible, A.S. Willsky, and W.M. Wells III, "Incorporating Spatial Priors into an Information Theoretic Approach for f MRI Data Analysis," Medical Image Computing and Computer-Assisted Intervention, pp. 62-71, 2000.
22. V. Kolmogorov, " Graph-Based Algorithms for Multi-Camera Reconstruction Problem," PhD thesis, Computer Science Dept., Cornell Univ., 2003.
23. V. Kolmogorov and R. Zabih, "Computing Visual Correspondence with Occlusions via Graph Cuts," Proc. Int'l Conf. Computer Vision, July 2001.
24. V. Kolmogorov and R. Zabih, "Multi-Camera Scene Reconstruction via Graph Cuts," Proc. Seventh European Conf. Computer Vision, vol. III, pp. 82-96, May 2002.
25. V. Kolmogorov and R. Zabih, "What Energy Functions Can Be Minimized via Graph Cuts?" IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-159, Feb. 2004.
26. V. Kwatra, A. Schodl, I. Essa, and A. Bobick, "Graphcut Textures: Image and Video Synthesis Using Graph Cuts," Proc. SIGGRAPH, July 2003.
27. G. Miller and J. Naor, "Flows in Planar Graphs with Multiple Sources and Sinks," Proc. 30th IEEE Symp. Foundations of Computer Science, pp. 112-117, 1991.
28. S. Osher and N. Paragios, Geometric Level Set Methods in Imaging, Vision, and Graphics. Springer Verlag 2003.
29. S. J. Osher and R.P. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces. Springer Verlag, 2002.
30. S. Roy and V. Govindu, "MRF Solutions for Probabilistic Optical Flow Formulations," Proc. Int'l Conf. Pattern Recognition, Sept. 2000.
31. S. Roy, "Stereo without Epipolar Lines: A Maximum-Flow Formulation," Int'l J. Computer Vision, vol. 34, nos. 2/3, pp. 147-162, Aug. 1999.
32. S. Roy and I. Cox, "A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem," IEEE Proc. Int'l Conf. Computer Vision, pp. 492-499, 1998.
33. G. Sapiro, Geometric Partial Differential Equations and Image Analysis. Cambridge Univ. Press, 2001.
34. D. Scharstein and R. Szeliski, "A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms," Int'l J. Computer Vision, 2002.
35. J.A. Sethian, Level Set Methods and Fast Marching Methods. Cambridge Univ. Press, 1999.
36. D. Snow, P. Viola, and R. Zabih, "Exact Voxel Occupancy with Graph Cuts," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 345-352, 2000.
37. R. Szeliski and R. Zabih, "An Experimental Comparison of Stereo Algorithms," Proc. Vision Algorithms: Theory and Practice, pp. 1-19, Sept. 1999.
38. B. Thirion, B. Bascle, V. Ramesh, and N. Navab, "Fusion of Color, Shading and Boundary Information for Factory Pipe Segmentation," IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 349-356, 2000.
39. O. Veksler, "Image Segmentation by Nested Cuts," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 339-344, 2000.
40. Z. Wu and R. Leahy, "An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1101-1113, Nov. 1993.