Image Segmentation Using the K-means Algorithm for Texture Features

This study aims to segment objects using the K-means algorithm for texture features. Firstly, the algorithm transforms color images into gray images. This paper describes a novel technique for the extraction of texture features in an image. Then, in a group of similar features, objects and backgrounds are differentiated by using the K-means algorithm. Finally, this paper proposes a new object segmentation algorithm using the morphological technique. The experiments described include the segmentation of single and multiple objects featured in this paper. The region of an object can be accurately segmented out. The results can help to perform image retrieval and analyze features of an object, as are shown in this paper. Keyword—k-mean, multiple objects, segmentation, texture features.

[1]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Felice Andrea Pellegrino,et al.  Edge detection revisited , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Hideyuki Tamura,et al.  Textural Features Corresponding to Visual Perception , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Ardeshir Goshtasby,et al.  On the Canny edge detector , 2001, Pattern Recognit..

[5]  Chih-Yi Chiu,et al.  Finding textures by textual descriptions, visual examples, and relevance feedbacks , 2003, Pattern Recognit. Lett..

[6]  Frank Y. Shih,et al.  Automatic seeded region growing for color image segmentation , 2005, Image Vis. Comput..

[7]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[8]  Qingmao Hu,et al.  On minimum variance thresholding , 2006, Pattern Recognit. Lett..