By Topic

An improved segmentation algorithm of color image in complex background based on graph cuts

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

3 Author(s)
Hanyu Hong ; Lab. for Image Process. & Intell. Control, Wuhan Inst. of Technol., Wuhan, China ; Xiangyun Guo ; Xiuhua Zhang

Recently, it is still difficult to extract interested object from complex background. In this field, interactive image segmentation method has attracted much attention in the vision. In this paper, we propose a new algorithm to segment the interested object from complex background. In the algorithm, we use the improved K-means clustering in the LUV color space to get more accurate classifications of the labeled pixels. Then, build up energy function model and calculate the energy of segmentation properly. Finally, we get the perfect result through graph cuts and denoising algorithm based on connected components.

Published in:

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on  (Volume:2 )

Date of Conference:

10-12 June 2011