Improving the Performance of K-Means for Color Quantization

Abstract

Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms. However, despite its popularity as a general purpose clustering algorithm, k-means has not received much respect in the color quantization literature because of its high computational requirements and sensitivity to initialization. In this paper, we investigate the performance of k-means as a color quantizer. We implement fast and exact variants of k-means with several initialization schemes and then compare the resulting quantizers to some of the most popular quantizers in the literature. Experiments on a diverse set of images demonstrate that an efficient implementation of k-means with an appropriate initialization strategy can in fact serve as a very effective color quantizer.

26 pages, 4 figures, 13 tables

References in corpus (1)

• Fast Color Space Transformations Using Minimax Approximations

Cited by in corpus (8)

• A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm
• Deterministic Initialization of the K-Means Algorithm Using Hierarchical Clustering
• Improved Lite Audio-Visual Speech Enhancement
• Electron dynamics in a three-dimensional Brillouin zone analysed by machine learning
• Ultrafast carrier dynamics throughout the three-dimensional Brillouin zone of the Weyl semimetal PtBi${}_2$
• Compressing Colour Images with Joint Inpainting and Prediction
• Lossy Image Compression with Stochastic Quantization
• GIFnets: Differentiable GIF Encoding Framework