A Hierarchical Clustering Method for Color Quantization

In this paper, we propose a hierarchical frequency sensitive competitive learning (HFSCL) method to achieve color quantization (CQ). In HFSCL, the appropriate number of quantized colors and the palette can be obtained by an adaptive procedure following a binary tree structure with nodes and layers. Starting from the root node that contains all colors in an image until all nodes are examined by split conditions, a binary tree will be generated. In each node of the tree, a frequency sensitive competitive learning (FSCL) network is used to achieve two-way division. To avoid over-split, merging condition is defined to merge the clusters that are close enough to each other at each layer. Experimental results show that HFSCL has the desired ability for CQ.

[1]  Mark A. Girolami,et al.  Mercer kernel-based clustering in feature space , 2002, IEEE Trans. Neural Networks.

[2]  José Alfredo Ferreira Costa,et al.  Cluster Analysis using Growing Neural Gas and Graph Partitioning , 2007, 2007 International Joint Conference on Neural Networks.

[3]  Hujun Yin,et al.  Adaptive topological tree structure for document organisation and visualisation , 2004, Neural Networks.

[4]  Korris Fu-Lai Chung,et al.  Fuzzy competitive learning , 1994, Neural Networks.

[5]  Charalambos Strouthopoulos,et al.  Adaptive color reduction , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[6]  Weidong Chen,et al.  An Improved Median-Cut Algorithm of Color Image Quantization , 2008, 2008 International Conference on Computer Science and Software Engineering.

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

[8]  George Economou,et al.  Color-based image retrieval using vector quantization and multivariate graph matching , 2005, IEEE International Conference on Image Processing 2005.