DocumentCode :
676273
Title :
VARIANCE-CUT: A fast color quantization method based on hierarchical clustering
Author :
Celebi, M. Emre ; Quan Wen
Author_Institution :
Dept. of Comput. Sci., Louisiana State Univ. in Shreveport, Shreveport, LA, USA
fYear :
2013
fDate :
7-9 Nov. 2013
Firstpage :
103
Lastpage :
106
Abstract :
Color quantization is an important operation with many applications in graphics and image processing. Clustering algorithms have been extensively applied to this problem. In this paper, we propose a simple yet effective color quantization method based on divisive hierarchical clustering. Our method utilizes the commonly used binary splitting strategy along with several carefully selected heuristics that ensure a good balance between effectiveness and efficiency. We also propose a slightly computationally expensive variant of this method that employs local optimization using the Lloyd-Max algorithm. Experiments on publicly available test images demonstrate that the proposed method outperforms some of the most popular quantizers in the literature.
Keywords :
computer graphics; image colour analysis; optimisation; pattern clustering; Lloyd-Max algorithm; binary splitting strategy; color quantization method; divisive hierarchical clustering; graphics; image processing; local optimization; variance-cut; Clustering algorithms; Color; Graphics; Image color analysis; Partitioning algorithms; Quantization (signal); Wide area networks; Color quantization; Lloyd-Max algorithm; binary splitting; divisive hierarchical clustering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronics, Computer and Computation (ICECCO), 2013 International Conference on
Conference_Location :
Ankara
Type :
conf
DOI :
10.1109/ICECCO.2013.6718239
Filename :
6718239
Link To Document :
بازگشت