A Color Image Segmentation Method Based on Improved K-Means Clustering Algorithm
How to effectively segment objects in the color images is the key point in the computer vision and image analysis. All kinds of segment algorithms have been proposed by many scholars, which could be basically divided into three categories. This paper presents repeated usage of the optimal threshold for roughly extracting the largest target area of the color image. Then an improved K-means clustering algorithm is used to improve the accuracy of the segmentation from the target area. Experimental results show that this method can effectively extract color image from an object. It has also a certain degree of robustness to the noisy image.
KeywordsImage segmentation Optimal threshold K-mean clustering algorithm Robustness
This work was supported by Science and Technology Research Program of Zhejiang Province under grant 2011C21036, Shanghai Natural Science Foundation under grant 10ZR1400100 and the new-shoot Talents Program of Zhejiang Province.
- 3.Wangenheim AV, Bertoldi RF, Abdala DD, Richter MM (2007) Color image segmentation guided by a color gradient network. Pattern Recogn Lett 28(13):1795–1803Google Scholar
- 5.Huang ZK, Wang SQ, Hou LY (2010) Segmentation of color textures using K-means cluster based wavelet image fusion. Inf Technol Manuf Syst PTS 1 and 2:209–214Google Scholar
- 6.Qu L, Dong XH, Guo FD (2009) Automatic K-means for color enteromorpha image segmen-tation, vol 3. In: 3rd intenational symposium on intelligent information technology application, pp 224–227Google Scholar
- 11.Patil RV, Jondhale KC (2010) Edge based technique to estimate number of clusters in k-means color image segmentation. ICCSIT 2:117–121Google Scholar