By Topic

Graph Cuts based image segmentation using local color and texture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiaoqiang Li ; Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China ; Huafu Fan ; Yangyang Zhao ; Huang Zhang

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.

Published in:

Image and Signal Processing (CISP), 2011 4th International Congress on  (Volume:3 )

Date of Conference:

15-17 Oct. 2011