Unsupervised segmentation of color images

A novel technique for unsupervised learning in feature space is presented. The feature space is considered as composed of two distinct sources, "mode" and "valley", in the point of view of information theory. An entropy-based thresholding is taken to distinguish the discretized cells in the feature space. The cells labeled as "mode" are then chained to form mode areas. Thereafter a modified Akaike's information criterion is proposed to solve the cluster validity problem. After all the parameters are estimated, a labeling algorithm is developed based on the majority game theory. The method is applied to color image segmentation. The segmentation process is completely autonomous.

[1]  Michael A. Arbib,et al.  Color Image Segmentation using Competitive Learning , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Shan Yu,et al.  A Game Strategy Approach for Image Labeling , 1995, Comput. Vis. Image Underst..

[3]  Jack-Gérard Postaire,et al.  Mode Detection by Relaxation , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Dorin Comaniciu,et al.  Robust analysis of feature spaces: color image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[5]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[6]  Gunther Wyszecki,et al.  Color Science: Concepts and Methods, Quantitative Data and Formulae, 2nd Edition , 2000 .

[7]  James W. Modestino,et al.  A model-fitting approach to cluster validation with application to stochastic model-based image segmentation , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[8]  Alan L. Yuille,et al.  Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..