Sample-size adaptive self-organization map for color images quantization

The paper presents a sample-size adaptive SOM (SA-SOM) algorithm for color quantization of images to adapt to the variations of network parameters and training sample size. The sweep size of neighborhood function is modulated by the size of the training data. In addition, the minimax distortion principle which is modulated by training sample size is used to search winning neuron. Based on the SA-SOM, we use the sampling ratio of training data, rather than the conventional weight change between adjacent sweeps, as a stop criterion, to significantly speed up the learning process. The experimental results show that the SA-SOM achieves much better PSNR quality, and smaller PSNR variation under various combinations of network parameters.

[1]  Zhen-Ping Lo,et al.  On the rate of convergence in topology preserving neural networks , 1991, Biological Cybernetics.

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

[3]  Vladimir Cherkassky,et al.  Statistical analysis of self-organization , 1995, Neural Networks.

[4]  Jorma Laaksonen,et al.  Variants of self-organizing maps , 1990, International 1989 Joint Conference on Neural Networks.

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

[6]  Sergio Bermejo,et al.  The effect of finite sample size on on-line K-means , 2002, Neurocomputing.

[7]  Teuvo Kohonen,et al.  Self-Organization and Associative Memory , 1988 .

[8]  Chip-Hong Chang,et al.  New adaptive color quantization method based on self-organizing maps , 2005, IEEE Transactions on Neural Networks.

[9]  Joachim M. Buhmann,et al.  Pairwise Data Clustering by Deterministic Annealing , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Duane DeSieno,et al.  Adding a conscience to competitive learning , 1988, IEEE 1988 International Conference on Neural Networks.

[11]  Allen Gersho,et al.  Asymptotically optimal block quantization , 1979, IEEE Trans. Inf. Theory.

[12]  Edie M. Rasmussen,et al.  Clustering Algorithms , 1992, Information Retrieval: Data Structures & Algorithms.

[13]  Tadao Nakamura,et al.  A systolic memory architecture for fast codebook design based on MMPDCL algorithm , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[14]  Lai-Man Po,et al.  Minimax partial distortion competitive learning for optimal codebook design , 1998, IEEE Trans. Image Process..

[15]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[16]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[17]  Paul S. Heckbert.  Color image quantization for frame buffer display , 1982, SIGGRAPH.

[18]  Kaizhong Zhang,et al.  A better tree-structured vector quantizer , 1991, [1991] Proceedings. Data Compression Conference.

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

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

[21]  Narendra Ahuja,et al.  Advances in Image Understanding: A Festschrift for Azriel Rosenfeld , 1996 .

[22]  Soo-Chang Pei,et al.  Color image compression and limited display using self-organization Kohonen map , 1998, IEEE Trans. Circuits Syst. Video Technol..