Effective algorithm for determining the number of clusters and its application in image segmentation
- 613 Downloads
The k-means algorithm is a popular clustering method for image segmentation. However, the main disadvantage of this algorithm is its dependence on the number of initial clusters. In this paper, we present an optimal criterion which can select the best segmentation result with less number of clusters. The optimal criterion overcomes the shortcoming of initialization based on the intra-class and inter-class difference. Eight digital images were employed to verify the segmentation results of the optimal criterion. Simultaneously, we have improved the traditional k-means algorithm to find the initial clustering centers efficiently. Experimental results show that the segmented images selected by the optimal criterion have sufficient stability and robustness. In addition, we verify the consistency of results by two kinds of objective assessment measures. The proposed optimal criterion can successfully display the best segmentation results precisely and efficiently so as to instead of artificial selection.
KeywordsImage segmentation k-Means algorithm Clustering method Intra-class Inter-class
This work was partly supported by National Natural Science Foundation of China (71271125, 61502260). We thank the National Natural Science Foundation of China and Natural Science Foundation of Shandong Province for funding. The authors also thank the USC-SIPI image test library in University of Southern California for providing digital images. We are grateful to every researcher who made comments to our work.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflicts of interests.
- 7.Jiang, X., Li, C., Sun, J.: A modified K-means clustering for mining of multimedia databases based on dimensionality reduction and similarity measures. Clust. Comput. 6(2), 1–8 (2017)Google Scholar
- 9.Gibou, F., Fedkiw, R.: A fast hybrid k-means level set algorithm for segmentation. In: 4th Annual Hawaii International Conference on Statistics and Mathematics, pp. 281–291 (2005)Google Scholar
- 15.Ray, S., Turi, R.: Determination of number of clusters in k-means clustering and application in colour image segmentation. In: Proceedings of the 4th International Conference on Advances in Pattern Recognition and Digital Techniques, pp. 137–143 (1999)Google Scholar
- 17.Luo, M., Ma, Y.F., Zhang, H.J.: A spatial constrained k-means approach to image segmentation. In: Proceedings of the 2003 Joint Conference of the Fourth International Conference on Information Communications and Signal Processing and the Fourth Pacific Rim Conference on Multimedia, vol. 2, pp. 738–742. IEEE (2003)Google Scholar
- 20.MC Cooper, G.M., The effect of measurement error on determining the number of clusters in cluster analysis. Data, expert knowledge and decisions. Springer Berlin Heidelberg, 1988: p. 319-328Google Scholar
- 22.Weber, A.: The USC-SIPI Image Database: Version 5. Signal and Image Processing Institute (1997)Google Scholar
- 23.Lee, M.C., et al.: Fuzzy C-means clustering of magnetic resonance imaging on apparent diffusion coefficient maps for predicting nodal metastasis in head and neck cancer. Br. J. Radiol. 2016(89), 20150059 (1063)Google Scholar
- 24.Vala, M.H.J., Baxi, A.: A review on Otsu image segmentation algorithm. Int. J. Adv. Res. Comput. Eng. Technol. 2(2), 387–389 (2013)Google Scholar