Interactive Segmentation of Color Images Based on Color Saliency

SUMMARY Efficient interactive foreground extraction from color images is of great practical importance in computer vision. In recent years, an approach based on optimization using graph-cuts has been widely used. However, an interactive foreground extraction approach, which is intuitive and efficient for users, is required for practical applications. In this paper, we propose a novel interactive foreground extraction method based on color saliency. In our method, the user provides only some foreground pixels as the initial reference. To achieve extraction of multiple target objects, the likelihoods of the foreground and background are defined by a Gaussian mixture model and a color saliency map based on the provided reference pixels. These likelihoods are added to the cost of the proposed graph. Finally, image segmentation is performed by optimizing the proposed graph using the graph-cut algorithm.

[1]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

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

[3]  Paul S. Heckbert Color image quantization for frame buffer display , 1982, SIGGRAPH.

[4]  Kohei Inoue,et al.  Saliency map based on color histograms of inside and outside of clipped rectangular region , 2011 .

[5]  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..

[6]  Jian Sun,et al.  Lazy snapping , 2004, SIGGRAPH 2004.

[7]  W. Eric L. Grimson,et al.  Adaptive background mixture models for real-time tracking , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[8]  F. Meyer,et al.  Color image segmentation , 1992 .