Graph Cuts based image segmentation using local color and texture

this paper proposes a novel interactive image segmentation algorithm based on the Graph Cuts by employing the color and texture feature of pre-computed over-segmentation region. Firstly, Watershed algorithm based on color information has been used to partition the image into a lot of different regions which will be considered as the nodes of Graph Cuts, instead of image pixels. Then the color and texture features (uniform local binary pattern) were extracted from the aforementioned regions, which are used to redefine the region properties term and boundary properties term. Due to pretty integrate the color feature with texture feature; the proposed method can separate the object from its background with colors similar to its background. Experiments on Berkeley image datasets demonstrate the effectiveness of the proposed method.

[1]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[2]  Yogesh Rathi,et al.  A Graph Cut Approach to Image Segmentation in Tensor Space , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[4]  Matti Pietikäinen,et al.  Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Ki-Sang Hong,et al.  Color-texture segmentation using unsupervised graph cuts , 2009, Pattern Recognit..

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

[7]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[8]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[10]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Harry Shum,et al.  Lazy snapping , 2004, ACM Trans. Graph..

[12]  David G. Stork,et al.  Pattern Classification , 1973 .