Unsupervised neural-morphological colour image segmentation using the mahalanobis as criteria of resemblance

In this paper, we present a new unsupervised colour image segmentation algorithm using competitive and morphological concepts. The algorithm is carried out in three processing stages. It starts by an estimation of the density function, followed by a training competitive neural network with a new criterion of resemblance called Mahalanobis distance which detects local maxima of the density function, and ends by the extraction of modal regions using an original method based on the morphological concept. The so detected modes are then used for the classification process. Compared to the K-means clustering or to the clustering approaches based on the different competitive learning schemes, the proposed algorithm has proven, under a number of real and synthetic test images, that it is automatic, has a fast convergence and does not need priori information about the data structure.

[1]  Andrew Calway,et al.  Proceedings of the IEEE International Conference on Image Processing , 1996 .

[2]  UchiyamaToshio,et al.  Color Image Segmentation using Competitive Learning , 1994 .

[3]  R. Hunt Colour Science : Concepts and Methods, Quantitative Data and Formulas , 1968 .

[4]  Sim Heng Ong,et al.  Colour image segmentation using the self-organizing map and adaptive resonance theory , 2005, Image Vis. Comput..

[5]  Abderrahmane Sbihi,et al.  Neural-morphological approach for pattern classification , 2001, Intell. Data Anal..

[6]  Antanas Verikas,et al.  Colour image segmentation by modular neural network , 1997, Pattern Recognit. Lett..

[7]  F. Girosi,et al.  Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification , 1993 .

[8]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

[9]  E. Parzen On Estimation of a Probability Density Function and Mode , 1962 .

[10]  Larry D. Hostetler,et al.  The estimation of the gradient of a density function, with applications in pattern recognition , 1975, IEEE Trans. Inf. Theory.

[11]  G H Ball,et al.  A clustering technique for summarizing multivariate data. , 1967, Behavioral science.

[12]  Jack-Gérard Postaire,et al.  A Fast Algorithm for Nonparametric Probability Density Estimation , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[14]  James C. Bezdek,et al.  Two soft relatives of learning vector quantization , 1995, Neural Networks.

[15]  Jack-Gérard Postaire,et al.  Cluster Analysis by Binary Morphology , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Wen-Jyi Hwang,et al.  A novel entropy-constrained competitive learning algorithm for vector quantization , 1999, Neurocomputing.

[17]  Hiroyuki Yamada,et al.  A Model for Detecting Cost-Prone Classes Based on Mahalanobis-Taguchi Method , 2006, IEICE Trans. Inf. Syst..

[18]  Abderrahmane Sbihi,et al.  Mode Extraction by Multivalue Morphology for Cluster Analysis , 1996 .

[19]  James C. Bezdek,et al.  Generalized clustering networks and Kohonen's self-organizing scheme , 1993, IEEE Trans. Neural Networks.

[20]  Riichiro Mizoguchi,et al.  Nonparametric Learning Without a Teacher Based on Mode Estimation , 1976, IEEE Transactions on Computers.

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

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

[23]  Jack-Gérard Postaire,et al.  Clustering by mode boundary detection , 1989, Pattern Recognit. Lett..