A continuous max-flow approach to Potts model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6316 LNCS, Issue PART 6, 2010, Pages 379-392

  Yuan, Jing ^a   Bae, Egil ^b   Tai, Xue Cheng ^b,c   Boykov, Yuri ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITY OF BERGEN   (Norway)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; NUMERICAL METHODS;

COMPETITIVE PERFORMANCE; COMPUTATIONAL LOADS; CONTINUOUS PROBLEMS; FUNCTIONALS; NUMBER OF ITERATIONS; NUMERICAL EXPERIMENTS; PARALLEL COMPUTATION; STATE OF THE ART;

POTTS MODEL;

EID: 78149344300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15567-3_28     Document Type: Conference Paper

References (33)

1. Paragios, N., Chen, Y., Faugeras, O.: Handbook of Mathematical Models in Computer Vision. Springer, New York (2005)
2. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on PAMI 23, 1222-1239 (2001) (Pubitemid 33137959)
3. Nikolova, M., Esedoglu, S., Chan, T.F.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. App. Math. 66, 1632-1648 (2006)
4. Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 82-96. Springer, Heidelberg (2002)
5. Li, S.Z.: Markov random field modeling in image analysis. Springer, New York (2001)
6. Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Royal Stat. Soc., Series B, 271-279 (1989)
7. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. IEEE Transactions on PAMI 26, 65-81 (2004)
8. Komodakis, N., Tziritas, G.: Approximate labeling via graph-cuts based on linear programming. In: Pattern Analysis and Machine Intelligence, pp. 1436-1453 (2007)
9. Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on (hyper) trees: Message-passing and linear programming approaches. IEEE Transactions on Information Theory 51, 3697-3717 (2002)
10. Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: ICCV 2003, pp. 26-33 (2003)
11. Kolmogorov, V., Boykov, Y.: What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In: ICCV, pp. 564-571 (2005)
12. 3 and beyond: Move making algorithms for solving higher order functions. IEEE Transactions on PAMI 31, 1645-1656 (2009)
13. Osher, S., Sethian, J.: Fronts propagating with curvature dependent speed: algorithms based on hamilton-jacobi formulations. J. Comput. Phys. 79, 12-49 (1988)
14. Chan, T., Vese, L.: Active contours without edges. IEEE Image Proc. 10, 266-277 (2001)
15. Vese, L.A., Chan, T.F.: A new multiphase level set framework for image segmentation via the mumford and shah model. IJCV 50, 271-293 (2002)
16. Lie, J., Lysaker, M., Tai, X.: A binary level set model and some applications to Mumford-Shah image segmentation. IEEE Img. Proc. 15, 1171-1181 (2006)
17. Lie, J., Lysaker, M., Tai, X.C.: A variant of the level set method and applications to image segmentation. Math. Comp. 75, 1155-1174 (2006)
18. Zach, C., Gallup, D., Frahm, J.M., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: VMV 2008 (2008)
19. Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 792-805. Springer, Heidelberg (2008)
20. Chambolle, A., Cremers, D., Pock, T.: A convex approach for computing minimal partitions. Technical Report TR-2008-05, University of Bonn (2008)
21. Bae, E., Yuan, J., Tai, X.: Global minimization for continuous multiphase partitioning problems using a dual approach. UCLA CAM Report [09-75] (2009)
22. Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnörr, C.: Convex multi-class image labeling by simplex-constrained total variation. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 150-162. Springer, Heidelberg (2009)
23. Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (1999)
24. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
25. Potts., R.B.: Some generalized order-disorder transformations. Proceedings of the Cambridge Philosophical Society 48, 106-109 (1952)
26. Lellmann, J., Becker, F., Schnörr, C.: Convex optimization for multi-class image labeling with a novel family of total variation based regularizers. In: IEEE International Conference on Computer Vision (ICCV), pp. 646-653 (2009)
27. Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approach for computing minimal partitions. In: CVPR, Miami, Florida (2009)
28. Yuan, J., Bae, E., Tai, X.: A study on continuous max-flow and min-cut approaches. In: CVPR, USA, San Francisco (2010)
29. Bresson, X., Esedoglu, S., Vandergheynst, P., Thiran, J., Osher, S.: Fast global minimization of the active contour/snake model. Journal of Mathematical Imaging and Vision 28, 151-167 (2007) (Pubitemid 47312505)
30. Ekeland, I., Téman, R.: Convex analysis and variational problems. Society for Industrial and Applied Mathematics, Philadelphia (1999)
31. Fan, K.: Minimax theorems. Proc. Nat. Acad. Sci. U. S. A. 39, 42-47 (1953)
32. Giusti, E.: Minimal surfaces and functions of bounded variation. Australian National University, Canberra (1977)
33. Chambolle, A.: An algorithm for total variation minimization and applications. Journal of Mathematical Imaging and Vision 20, 89-97 (2004)