×

Weight selection in \(W-k\)-means algorithm with an application in color image segmentation. (English) Zbl 1228.94007

Summary: A weight selection procedure in the \(W-k\)-means algorithm is proposed based on the statistical variation viewpoint. This approach can solve the \(W-k\)-means algorithm’s problem that the clustering quality is greatly affected by the initial value of weight. After the statistics of data, the weights of data are designed to provide more information for the character of \(W-k\)-means algorithm so as to improve the precision. Furthermore, the corresponding computational complexity is analyzed as well. We compare the clustering results of the \(W-k\)-means algorithm with the different initialization methods. Results from color image segmentation illustrate that the proposed procedure produces better segmentation than the random initialization according to Liu and Yang’s evaluation function.

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
62H30 Classification and discrimination; cluster analysis (statistical aspects)
68U10 Computing methodologies for image processing
94A17 Measures of information, entropy
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chen, Y. X.; Wang, J. Z.; Krovetz, R., CLUE: clustering-based retrieval of images by unsupervised learning, IEEE Trans. Image Process., 14, 1187-1201 (2005)
[2] J. MacQueen, Some methods for classification and analysis of multivariate observation, in: Proc. Fifth Berkeley Symp. Math. Statcistica and Probability, 1957, pp. 281-297.; J. MacQueen, Some methods for classification and analysis of multivariate observation, in: Proc. Fifth Berkeley Symp. Math. Statcistica and Probability, 1957, pp. 281-297.
[3] Likas, A.; Vlassis, M.; Verbeek, J., Theglobal \(k\)-means clustering algorithm, Pattern Recognit., 35, 451-461 (2003)
[4] Bagirov, A. M., Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems, Pattern Recognit., 41, 3192-3199 (2008) · Zbl 1147.68669
[5] Huang, J. Z.; Ng, M. K.; Rong, H.; Li, Z., Automated variable weighting in \(k\)-means type clustering, IEEE Trans. Pattern Anal. Mach. Intell., 27, 657-668 (2005)
[6] Khan, S. S.; Ahmad, A., Cluster center initialization algorithm for \(K\)-means clustering, Pattern Recognit. Lett., 25, 1293-1302 (2004)
[7] Hung, W. L.; Yang, M. S.; Chen, D. H., Bootstrapping approach to feature-weight selection in fuzzy \(c\)-means algorithms with an application in color image segmentation, Pattern Recognit. Lett., 25, 1293-1302 (2004)
[8] W.L. Hung, M.S. Yang, D.H. Chen, Variation approaches to feature-weight selection and application to fuzzy clustering, in: IEEE International Conference on Fuzzy Systems, 2008, pp. 276-280.; W.L. Hung, M.S. Yang, D.H. Chen, Variation approaches to feature-weight selection and application to fuzzy clustering, in: IEEE International Conference on Fuzzy Systems, 2008, pp. 276-280.
[9] Cherry, C., On Human Communication (1957), John Wiley & Sons: John Wiley & Sons New York
[10] Kim, D. W.; Lee, K. H.; Lee, D., A novel initialization for the fuzzy \(c\)-means algorithm for color clustering, Pattern Recognit. Lett., 25, 227-237 (2004)
[11] Liu, J.; Yang, Y. H., Multiresolution color image segmentation technique, IEEE Trans. Pattern Anal. Mach. Intell., 16, 689-700 (1994)
[12] Cao, F.; Liang, J.; Jiang, G., An initialization method for the \(K\)-means algorithm using neighborhood model, Comput. Math. Appl., 58, 474-483 (2009) · Zbl 1189.68095
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.