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.
Recommended for submission to YRF2011 by Prof. Dr.-Ing. Reinhard Koch.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Bouman, C., Orchard, M.: Color quantization of images. IEEE Transactions on Signal Processing 39(12), 2677–2690 (1991)
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)
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)
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)
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)
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)
Paris, S., Durand, F.: A topological approach to hierarchical segmentation using mean shift. In: CVPR, pp. 1–8 (2007)
Rother, C., Kolmogorov, V., Blake, A.: ”Grabcut”: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph 23(3), 309–314 (2004)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franke, M. (2011). Color Image Segmentation Based on an Iterative Graph Cut Algorithm Using Time-of-Flight Cameras. In: Mester, R., Felsberg, M. (eds) Pattern Recognition. DAGM 2011. Lecture Notes in Computer Science, vol 6835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23123-0_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-23123-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23122-3
Online ISBN: 978-3-642-23123-0
eBook Packages: Computer ScienceComputer Science (R0)