Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Image segmentation method based on improved graph cut algorithm

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

6 Author(s)
Yuxian Li ; Dept. of Bus. & Trade, Qinhuangdao Inst. of Technol., Qinhuangdao, China ; Yifu Du ; Bin Liu ; Haibin Li
more authors

Image segmentation method based on improved graph cut algorithm is proposed in this paper to improve the speed of graph cut and solve the watershed transformation over-segmentation phenomena. First, the image is segmented into a large number of small partitions making use of the watershed transformation. Then, a simplified network graph is constructed using the partition information. Finally, the graph cut algorithm is employed to realize network graph segmentation and get the segmentation results. The experimental results indicate that the proposed algorithm not only solves the watershed transformation over-segmentation phenomena, but also improves the speed of the graph cut algorithm.

Published in:

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

Date of Conference:

25-27 May 2012