Advertisement

GeoS: Geodesic Image Segmentation

  • Antonio Criminisi
  • Toby Sharp
  • Andrew Blake
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5302)

Abstract

This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data.

The segmentation problem is cast as approximate energy minimization in a conditional random field. A new, parallel filtering operator built upon efficient geodesic distance computation is used to propose a set of spatially smooth, contrast-sensitive segmentation hypotheses. An economical search algorithm finds the solution with minimum energy within a sensible and highly restricted subset of all possible labellings.

Advantages include: i) computational efficiency with high segmentation accuracy; ii) the ability to estimate an approximation to the posterior over segmentations; iii) the ability to handle generally complex energy models. Comparison with max-flow indicates up to 60 times greater computational efficiency as well as greater memory efficiency.

GeoS is validated quantitatively and qualitatively by thorough comparative experiments on existing and novel ground-truth data. Numerous results on interactive and automatic segmentation of photographs, video and volumetric medical image data are presented.

Keywords

Geodesic Distance Conditional Random Field Global Constraint Video Segmentation Stereo Video 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

978-3-540-88682-2_9_MOESM1_ESM.wmv (27.4 mb)
Supplementary material (28,046 KB)

References

  1. 1.
    Boykov, J., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-D images. In: IEEE ICCV (2001)Google Scholar
  2. 2.
    Rother, C., Kolmogorov, V., Blake, A.: Grabcut: Interactive foreground extraction using iterated graph cuts. In: ACM Trans. on Graphics (SIGGRAPH) (2004)Google Scholar
  3. 3.
    Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., Rother, C.: Bilayer segmentation of binocular stereo video. In: IEEE CVPR (2005)Google Scholar
  4. 4.
    Criminisi, A., Cross, G., Blake, A., Kolmogorov, V.: Bilayer segmentation of live video. In: IEEE CVPR (2006)Google Scholar
  5. 5.
    Kohli, P., Torr, P.H.S.: Measuring uncertainty in Graph Cut solutions. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 30–43. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: ECCV (2002)Google Scholar
  7. 7.
    Sinop, A.K., Grady, L.: A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In: IEEE ICCV (2007)Google Scholar
  8. 8.
    Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 16–29. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Bai, X., Sapiro, G.: A geodesic framework for fast interactive image and video segmentation and matting. In: IEEE ICCV (2007)Google Scholar
  10. 10.
    Komodakis, N., Tziritas, G., Paragios, N.: Fast, approximately optimal solutions for single and dynamic MRFs. In: IEEE CVPR (2007)Google Scholar
  11. 11.
    Lempitsky, V., Rother, C., Blake, A.: Logcut - efficient graph cut optimization for markov random fields. In: IEEE ICCV, Rio (2007)Google Scholar
  12. 12.
    Juan, O., Boykov, J.: Active graph cuts. In: IEEE CVPR (2006)Google Scholar
  13. 13.
    Kohli, P., Torr, P.: Dynamic graph cuts for efficient inference in markov random fields. PAMI (2007)Google Scholar
  14. 14.
    Fabbri, R., Costa, L., Torrelli, J., Bruno, O.: 2d euclidean distance transform algorithms: A comparative survey. ACM Computing Surveys 40 (2008)Google Scholar
  15. 15.
    Jones, M., Baerentzen, J., Sramek, M.: 3d distance fields: a survey of techniques and applications. IEEE Trans. on Visualization and Computer Graphics 12 (2006)Google Scholar
  16. 16.
    Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics and Image Processing (1986)Google Scholar
  17. 17.
    Sethian, J.A.: Fast marching methods. SIAM Rev. 41 (1999)Google Scholar
  18. 18.
    Toivanen, P.J.: New geodesic distance transforms for gray-scale images. Pattern Recognition Letters 17, 437–450 (1996)CrossRefGoogle Scholar
  19. 19.
    Yatziv, L., Bartesaghi, A., Sapiro, G.: O(n) implementation of the fast marching algorithm. Journal of Computational Physics 212, 393–399 (2006)CrossRefzbMATHGoogle Scholar
  20. 20.
    Felzenszwalb, P.F., Huttenlocher, D.P.: Pictorial structures for object recognition. IJCV 61 (2005)Google Scholar
  21. 21.
    Ripley, B.D.: Stochastic Simulation. Wiley and Sons, Chichester (1987)CrossRefzbMATHGoogle Scholar
  22. 22.
    Rother, C., Kolmogorov, V., Lempitsky, V.T., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: IEEE CVPR (2007)Google Scholar
  23. 23.
    Rother, C., Kolmogorov, V., Minka, T., Blake, A.: Cosegmentation of image pairs by histogram matching - incor. a global constraint into MRFs. In: CVPR (2006)Google Scholar
  24. 24.
    Kolmogorov, V., Boykov, J., Rother, C.: Applications of parametric maxflow in computer vision. In: IEEE ICCV, Rio (2007)Google Scholar
  25. 25.
    Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI 26 (2004)Google Scholar
  26. 26.
    Blake, A., Rother, C., Brown, M., Perez, P., Torr, P.: Interactive image segmentation using an adaptive GMMRF model. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3021, pp. 428–441. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  27. 27.
    Bishop, C.M.: Pattern Recognition and machine Learning. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  28. 28.
  29. 29.
    Bai, X., Sapiro, G.: A geodesic framework for fast interactive image and video segmentation and matting. Technical Report 2185, Institute of Mathematics and Its Applications, Univ. Minnesota Preprint Series(2008)Google Scholar
  30. 30.
    Cremers, D., Osher, S.J., Soatto, S.: Kernel density estimation and intrinsic alignment for shape priors in level set segmentation. IJCV 69 (2006)Google Scholar
  31. 31.
    Yatziv, L., Sapiro, G.: Fast image and video colorization using chrominance blending. IEEE Trans. on Image Processing 15 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Antonio Criminisi
    • 1
  • Toby Sharp
    • 1
  • Andrew Blake
    • 1
  1. 1.Microsoft ResearchCambridgeUK

Personalised recommendations