z-logo
open-access-imgOpen Access
Color Quantization Based on Hierarchical Frequency Sensitive Competitive Learning
Author(s) -
Jun Zhang,
Jinglu Hu
Publication year - 2010
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2010.p0375
Subject(s) - computer science , merge (version control) , color quantization , quantization (signal processing) , competitive learning , binary tree , tree structure , artificial intelligence , tree (set theory) , binary number , pattern recognition (psychology) , algorithm , binary image , unsupervised learning , image (mathematics) , image processing , mathematics , mathematical analysis , information retrieval , arithmetic
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 the proposed HFSCL has desired ability for CQ.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom