A Sensitivity Analysis of the Self Organizing Maps as an Adaptive One-pass Non-stationary Clustering Algorithm: the Case of Color Quantization of Image Sequences

In this paper we study the sensitivity of the Self Organizing Map to several parameters in the context of the one-pass adaptive computation of cluster representatives over non-stationary data. The paradigm of Non-stationary Clustering is represented by the problem of Color Quantization of image sequences.

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

[2]  Keinosuke Fukunaga,et al.  Introduction to statistical pattern recognition (2nd ed.) , 1990 .

[3]  Paul S. Heckbert Color image quantization for frame buffer display , 1998 .

[4]  Keinosuke Fukunaga,et al.  Statistical Pattern Recognition , 1993, Handbook of Pattern Recognition and Computer Vision.

[5]  Yihong Gong,et al.  A color video image quantization method with stable and efficient color selection capability , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[6]  Long-Wen Chang,et al.  Fast color image quantization with error diffusion and morphological operations , 1995, Signal Process..

[7]  Anil K. Jain,et al.  A self-organizing network for hyperellipsoidal clustering (HEC) , 1996, IEEE Trans. Neural Networks.

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

[9]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[10]  Stanley C. Ahalt,et al.  Competitive learning algorithms for vector quantization , 1990, Neural Networks.

[11]  Manuel Graña,et al.  Self organizing map for adaptive non-stationary clustering: some experimental results on color quantization of image sequences , 1997, ESANN.

[12]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[13]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[14]  Christopher Chan,et al.  LOSSY COMPRESSION OF INDIVIDUAL SIGNALS BASED ON ONE PASS CODEBOOK , 1995 .

[15]  HeckbertPaul Color image quantization for frame buffer display , 1982 .

[16]  Mohan S. Kankanhalli,et al.  Cluster-based color matching for image retrieval , 1996, Pattern Recognit..

[17]  Michael T. Orchard,et al.  Color quantization of images , 1991, IEEE Trans. Signal Process..

[18]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[19]  Xiaolin Wu,et al.  EFFICIENT STATISTICAL COMPUTATIONS FOR OPTIMAL COLOR QUANTIZATION , 1991 .

[20]  Teuvo Kohonen,et al.  Self-organization and associative memory: 3rd edition , 1989 .

[21]  Sungzoon Cho,et al.  Effects of varying parameters on properties of self-organizing feature maps , 1996, Neural Processing Letters.

[22]  Martin Vetterli,et al.  Lossy compression of individual signals based on string matching and one pass codebook design , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.