An Approach to Image Segmentation using K-means Clustering Algorithm

This paper presents a new approach for image segmentation by applying k-means algorithm. In image segmentation, clustering algorithms are very popular as they are intuitive and are also easy to implement. The K-means clustering algorithm is one of the most widely used algorithm in the literature, and many authors successfully compare their new proposal with the results achieved by the k-Means. This paper proposes a color-based segmentation method that uses K-means clustering technique . The k-means algorithm is an iterative technique used to partition an image into k clusters. The standard K-Means algorithm produces accurate segmentation results only when applied to images defined by homogenous regions with respect to texture and color since no local constraints are applied to impose spatial continuity. At first, the pixels are clustered based on their color and spatial features, where the clustering process is accomplished. Then the clustered blocks are merged to a specific number of regions. This approach thus provides a feasible new solution for image segmentation which may be helpful in image retrieval. The experimental results clarify the effectiveness of our approach to improve the segmentation quality in aspects of precision and computational time. The simulation results demonstrate that the proposed algorithm is promising.