A study on continuous max-flow and min-cut approaches

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 2217-2224

  Yuan, Jing ^a   Bae, Egil ^b   Tai, Xue Cheng ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SOLUTIONS; CLASSICAL OPTIMIZATION; CONTINUOUS OPTIMIZATION; DUAL MODEL; FLOW BASED ALGORITHMS; FLOW MODEL; GRAPH-BASED; IMAGE PARTITIONING; MAX FLOW ALGORITHM; MAX-FLOW PROBLEM; MIN-CUT; NONCONVEX;

COMPUTER VISION; OPTIMIZATION; SITE SELECTION;

IMAGE SEGMENTATION;

EID: 77955994797     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539903     Document Type: Conference Paper

References (22)

1. Supplementary material.
2. B. Appleton and H. Talbot. Globally optimal surfaces by continuous maximal flows. In Digital Image Computing: Techniques and Applications, pages 987-996, 2003.
3. B. Appleton and H. Talbot. Globally minimal surfaces by continuous maximal flows. IEEE PAMI, 28:2006, 2006.
4. E. Bae, J. Yuan, and X. Tai. Convex relaxation for multipartitioning problems using a dual approach. Technical report CAM09-75, UCLA, CAM, September 2009.
5. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, September 1999.
6. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE PAMI, 26:359-374, 2001.
7. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE PAMI, 23:2001, 2001.
8. X. Bresson, S. Esedoglu, P. Vandergheynst, J.-P. Thiran, and S. Osher. Fast global minimization of the active contour/ snake model. Journal of Mathematical Imaging and Vision, 28(2):151-167, 2007.
9. A. Chambolle. An algorithm for total variation minimization and applications. Journal of Mathematical Imaging and Vision, 20(1-2):89-97, 2004.
10. T. Chan, S. Esedoḡlu, and M. Nikolova. Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. Appl. Math., 66(5):1632-1648 (electronic), 2006.
11. D. M. Greig, B. T. Porteous, and A. H. Seheult. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B, pages 271-279, 1989.
12. J.-B. Hiriart-Urruty and C. Lemaréchal. Convex analysis and minimization algorithms. I, volume 305 of Fundamental Principles of Mathematical Sciences. Springer-Verlag, Berlin, 1993. Fundamentals.
13. V. Kolmogorov. What metrics can be approximated by geocuts, or global optimization of length/area and flux. In ICCV, pages 564-571, 2005.
14. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE PAMI, 28(10):1568-1583, 2006.
15. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts. IEEE PAMI, 26:65-81, 2004.
16. J. Lellmann, J. Kappes, J. Yuan, F. Becker, and C. Schnörr. Convex multi-class image labeling by simplex-constrained total variation. Technical report, HCI, IWR, Uni. Heidelberg, November 2008.
17. V. Lempitsky and Y. Boykov. Global optimization for shape fitting. In In CVPR, 2007.
18. T. Pock, A. Chambolle, H. Bischof, and D. Cremers. A convex relaxation approach for computing minimal partitions. In In CVPR, Miami, Florida, 2009.
19. G. Strang. Maximal flow through a domain. Mathematical Programming, 26:123-143, 1983.
20. G. Strang. Maximum flows and minimum cuts in the plane. Advances in Mechanics and Mathematics, III:1-11, 2008.
21. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, A. Agarwala, and C. Rother. A comparative study of energy minimization methods for markov random fields. In ECCV, pages 16-29, 2006.
22. M.Wainwright, T. Jaakkola, and A.Willsky. Map estimation via agreement on (hyper)trees: Message-passing and linear programming approaches. IEEE Transactions on Information Theory, 51:3697-3717, 2002.