Color Image Segmentation Combining Rough Depth Information

A novel color image segmentation method is presented in this paper. Firstly a Luv color histogram based method is used to estimate the color bandwidth, then a mean shift algorithm with adaptive color bandwidth is employed to pre-segment the input image. Next, a boundary detection algorithm based machine learning is used to calculate the probability boundary of objects from both depth and color information. Then, a correction procedure is performed by mapping the depth boundary onto the color image. Finally, Graph cut is used to segment color image based on Gaussian Mixture Model which is built with the above pre-segmentation and correction results. The experimental results show that the segmentation algorithm is an effective one. It can effectively segment an image into some semantic objects.

[1]  Frédo Durand,et al.  A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach , 2006, International Journal of Computer Vision.

[2]  Dorin Comaniciu,et al.  Mean shift analysis and applications , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  Marc Van Droogenbroeck,et al.  Combining Color, Depth, and Motion for Video Segmentation , 2009, ICVS.

[4]  A. K. Riemens,et al.  Multistep joint bilateral depth upsampling , 2009, Electronic Imaging.

[5]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[6]  Larry D. Hostetler,et al.  The estimation of the gradient of a density function, with applications in pattern recognition , 1975, IEEE Trans. Inf. Theory.

[7]  D. Comaniciu,et al.  The variable bandwidth mean shift and data-driven scale selection , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[8]  Jitendra Malik,et al.  Learning to detect natural image boundaries using local brightness, color, and texture cues , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Marina Meila,et al.  Comparing clusterings: an axiomatic view , 2005, ICML.

[10]  Vladimir Kolmogorov,et al.  "GrabCut": interactive foreground extraction using iterated graph cuts , 2004, ACM Trans. Graph..

[11]  Ryan Crabb,et al.  Real-time foreground segmentation via range and color imaging , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[12]  Jing Li Wang,et al.  Color image segmentation: advances and prospects , 2001, Pattern Recognit..

[13]  Ilan Shimshoni,et al.  Mean shift based clustering in high dimensions: a texture classification example , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[14]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Nathan Silberman,et al.  Indoor scene segmentation using a structured light sensor , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[16]  Daniel Cohen-Or,et al.  Combining color and depth for enhanced image segmentation and retargeting , 2011, The Visual Computer.

[17]  Yizong Cheng,et al.  Mean Shift, Mode Seeking, and Clustering , 1995, IEEE Trans. Pattern Anal. Mach. Intell..