A comparison study of image segmentation by clustering techniques

Many image segmentation methods based on clustering are available in the literature. Some of these techniques use classical clustering, some use fuzzy sets. Most of these techniques are not suitable for noisy environments. Some work has been done using the possibilist clustering approach which is robust to noise, but requires knowledge of the number of clusters. The probabilistic approach can be used to assess the number of components. This paper reviews and summarizes some of these techniques. Attempts have been made to cover hard, fuzzy and possibilist approaches as well as mixture model clustering. Adequate attention is paid to possibilist clustering in discarding noisy pixels and to entropy criteria in assessing the number of clusters. We also propose a quantitative evaluation of segmentation results.

[1]  G.B. Coleman,et al.  Image segmentation by clustering , 1979, Proceedings of the IEEE.

[2]  James M. Keller,et al.  A possibilistic approach to clustering , 1993, IEEE Trans. Fuzzy Syst..

[3]  King-Sun Fu,et al.  A survey on image segmentation , 1981, Pattern Recognit..

[4]  Sankar K. Pal,et al.  A review on image segmentation techniques , 1993, Pattern Recognit..

[5]  Martin D. Levine,et al.  Dynamic Measurement of Computer Generated Image Segmentations , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Walter D. Fisher On Grouping for Maximum Homogeneity , 1958 .

[7]  R. Hathaway Another interpretation of the EM algorithm for mixture distributions , 1986 .

[8]  J. Wolfe PATTERN CLUSTERING BY MULTIVARIATE MIXTURE ANALYSIS. , 1970, Multivariate behavioral research.