Comparison and optimization of methods of color image quantization
- 1 July 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 6 (7) , 1048-1052
- https://doi.org/10.1109/83.597280
Abstract
Color image quantization, the process of reducing the number of colors in a digital color image, has been widely studied for the last fifteen years. The different steps of clustering methods are studied. The methods are compared step by step and some optimizations of the algorithms and data structures are given. A new color space called H1H2H3 is introduced, which improves the quantization heuristics. A low-cost quantization scheme is proposed.Keywords
This publication has 10 references indexed in Scilit:
- A better tree-structured vector quantizerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Color image quantization by agglomerative clusteringIEEE Computer Graphics and Applications, 1994
- Sequential scalar quantization of color imagesJournal of Electronic Imaging, 1994
- Color quantization by dynamic programming and principal analysisACM Transactions on Graphics, 1992
- Color quantization of imagesIEEE Transactions on Signal Processing, 1991
- MAPPING RGB TRIPLES ONTO 16 DISTINCT VALUESPublished by Elsevier ,1991
- A SIMPLE METHOD FOR COLOR QUANTIZATION: OCTREE QUANTIZATIONPublished by Elsevier ,1990
- An algorithm for multidimensional data clusteringACM Transactions on Mathematical Software, 1988
- Color image quantization for frame buffer displayPublished by Association for Computing Machinery (ACM) ,1982
- Color information for region segmentationComputer Graphics and Image Processing, 1980