Color Image Segmentation Based on an Iterative Graph Cut Algorithm Using Time-of-Flight Cameras

  • Markus Franke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6835)

Abstract

This work describes an approach to color image segmentation by supporting an iterative graph cut segmentation algorithm with depth data collected by time-of-flight (TOF) cameras. The graph cut algorithm uses an energy minimization approach to segment an image, taking account of both color and contrast information. The foreground and background color distributions of the images subject to segmentation are represented by Gaussian mixture models, which are optimized iteratively by parameter learning. These models are initialized by a preliminary segmentation created from depth data, automating the model initialization step, which otherwise relies on user input.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bartczak, B., Schiller, I., Beder, C., Koch, R.: Integration of a time-of-flight camera into a mixed reality system for handling dynamic scenes, moving viewpoints and occlusions in real-time. In: Proceedings of the 3DPVT Workshop, Atlanta, GA, USA (2008)Google Scholar
  2. 2.
    Bouman, C., Orchard, M.: Color quantization of images. IEEE Transactions on Signal Processing 39(12), 2677–2690 (1991)CrossRefGoogle Scholar
  3. 3.
    Boykov, Y.Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: ICCV, pp. I:105–112 (2001)Google Scholar
  4. 4.
    Crabb, R., Tracey, C., Puranik, A., Davis, J.: Real-time foreground segmentation via range and color imaging. Computer Vision and Pattern Recognition Workshop 0, 1–5 (2008)CrossRefGoogle Scholar
  5. 5.
    Frick, A., Franke, M., Koch, R.: Time-consistent foreground segmentation of dynamic content from color and depth video. In: Mester, R., Felsberg, M. (eds.) DAGM 2011. LNCS, vol. 6835, pp. 462–467. Springer, Heidelberg (2011)Google Scholar
  6. 6.
    Kohli, P., Torr, P.H.S.: Dynamic graph cuts for efficient inference in markov random fields. IEEE Trans. Pattern Analysis and Machine Intelligence 29(12), 2079–2088 (2007)CrossRefGoogle Scholar
  7. 7.
    Kolmogorov, V., Boykov, Y.Y.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 359–374. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Paris, S., Durand, F.: A topological approach to hierarchical segmentation using mean shift. In: CVPR, pp. 1–8 (2007)Google Scholar
  9. 9.
    Rother, C., Kolmogorov, V., Blake, A.: ”Grabcut”: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph 23(3), 309–314 (2004)CrossRefGoogle Scholar
  10. 10.
    Smith, A.R., Blinn, J.F.: Blue screen matting. In: Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, pp. 259–268 (1996)Google Scholar
  11. 11.
    Wang, O., Finger, J., Yang, Q., Davis, J., Yang, R.: Automatic natural video matting with depth. In: Proceedings of the 15th Pacific Conference on Computer Graphics and Applications, pp. 469–472 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Markus Franke
    • 1
  1. 1.Multimedia Information Processing Group Department of Computer ScienceChristian Albrechts University of KielGermany

Personalised recommendations