Efficient global minimization for the multiphase Chan-Vese model of image segmentation

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

Volumn 5681 LNCS, Issue , 2009, Pages 28-41

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

^a UNIVERSITY OF BERGEN   (Norway)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CHAN-VESE MODEL; ENERGY FUNCTIONS; GLOBAL MINIMIZATION; GRADIENT DESCENT; GRAPH CUT; IMAGE SEGMENTATION MODEL; INTENSITY VALUES; LEVEL SET APPROACH; LEVEL SET FUNCTIONS; LEVEL SET REPRESENTATION; LOCAL MINIMUMS; MUMFORD SHAH MODEL; NOVEL METHODS; SUBMODULAR;

COMPUTER VISION; DIGITAL IMAGE STORAGE; LEVEL MEASUREMENT; OPTIMIZATION; SET THEORY;

IMAGE SEGMENTATION;

EID: 70449707280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03641-5_3     Document Type: Conference Paper

References (27)

1. Mumford, D., Shah, J.: Optimal approximation by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math. 42, 577-685 (1989)
2. Dervieux, A., Thomasset, F.: A finite element method for the simulation of a Rayleigh-Taylor instability. In: Approximation methods for Navier-Stokes problems (Proc. Sympos., Univ. Paderborn, Paderborn, 1979). Lecture Notes in Math., vol. 771, pp. 145-158. Springer, Berlin (1980)
3. Osher, S., Sethian, J.: Fronts propagating with curvature dependent speed: algorithms based on hamilton-jacobi formulations. J. Comput. Phys. 79(1), 12-49 (1988)
4. Chan, T., Vese, L.: Active contours without edges. IEEE Image Proc. 10, 266-277 (2001)
5. Vese, L.A., Chan, T.F.: A new multiphase level set framework for image segmentation via the mumford and shah model. International Journal of Computer Vision 50, 271-293 (2002)
6. Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. In: Readings in uncertain reasoning, pp. 452-472. Morgan Kaufmann Publishers Inc., San Francisco (1990)
7. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: ICCV (1), pp. 377-384 (1999)
8. Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B, 271-279 (1989)
9. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. In: Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 359-374 (2001)
10. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 26(2), 147-159 (2004)
11. Komodakis, N., Tziritas, G., Paragios, N.: Fast, approximately optimal solutions for single and dynamic mrfs. In: IEEE Conference on Computer Vision and Pattern Recognition, 2007. CVPR 2007, June 17-22, pp. 1-8 (2007)
12. Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: ICCV 2003: Proceedings of the Ninth IEEE International Conference on Computer Vision, Washington, DC, USA, p. 26. IEEE Computer Society Press, Los Alamitos (2003)
13. Boykov, Y., Kolmogorov, V., Cremers, D., Delong, A.: An integral solution to surface evolution pdes via geo-cuts. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3953, pp. 409-422. Springer, Heidelberg (2006)
14. Darbon, J., Sigelle, M.: Image restoration with discrete constrained total variation part i: Fast and exact optimization. J. Math. Imaging Vis. 26(3), 261-276 (2006)
15. Darbon, J., Sigelle, M.: Image restoration with discrete constrained total variation part ii: Levelable functions, convex priors and non-convex cases. J. Math. Imaging Vis. 26(3), 277-291 (2006)
16. Darbon, J.: A note on the discrete binary mumford-shah model. In: Gagalowicz, A., Philips, W. (eds.) MIRAGE 2007. LNCS, vol. 4418, pp. 283-294. Springer, Heidelberg (2007)
17. Zehiry, N.E., Xu, S., Sahoo, P., Elmaghraby, A.: Graph cut optimization for the mumford-shah model. In: Proceedings of the Seventh IASTED International Conference visualization, imaging and image processing, pp. 182-187. Springer, Heidelberg (2007)
18. Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approach for computing minimal partitions. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Miami, Florida (to appear, 2009)
19. Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnorr, C.: Convex multi-class image labeling by simplex-constrained total variation. In: SSVM 2009, pp. 150-162 (2009)
20. Lie, J., Lysaker, M., Tai, X.: A binary level set model and some applications to mumford-shah image segmentation. IEEE Transactions on Image Processing 15(5), 1171-1181 (2006)
21. Bresson, X., Chan, T.: Non-local unsupervised variational image segmentation models (2008)
22. Lie, J., Lysaker, M., Tai, X.: A variant of the level set method and applications to image segmentation. Math. Comp. 75(255), 1155-1174 (2006) (electronic)
23. Nikolova, M., Esedoglu, S., Chan, T.F.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal on Applied Mathematics 66(5), 1632-1648 (2006)
24. Ford, L., Fulkerson, D.: Flows in networks. Princeton University Press, Princeton (1962)
25. Bae, E., Tai, X.C.: Efficient global optimization for the multiphase chan-vese model of image segmentation by graph cuts. UCLA, Applied Mathematics, CAM-report-09-53 (June 2009)
26. Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cutsa review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1274-1279 (2007)
27. http://www.eecs.berkeley.edu/Research/Projects/CS/vision/ grouping/segbench/