Colour quantisation using the adaptive distributing units algorithm

Abstract

Colour quantisation (CQ) is an important operation with many applications in graphics and image processing. Most CQ methods are essentially based on data clustering algorithms one of which is the popular k-means algorithm. Unfortunately, like many batch clustering algorithms, k-means is highly sensitive to the selection of the initial cluster centres. In this paper, we adapt Uchiyama and Arbib’s competitive learning algorithm to the CQ problem. In contrast to the batch k-means algorithm, this online clustering algorithm does not require cluster centre initialisation. Experiments on a diverse set of publicly available images demonstrate that the presented method outperforms some of the most popular quantisers in the literature.

Keywords:

• Colour quantization
• Clustering
• K-means
• Competitive learning

Acknowledgements

This publication was made possible by grants from the Louisiana Board of Regents (LEQSF2008-11-RD-A-12), US National Science Foundation (0959583, 1117457), and National Natural Science Foundation of China (61050110449, 61073120).