Abstract

Color quantization is an important operation with numerous 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, a fast color quantization method based on K-means is presented. The method involves several modifications to the conventional (batch) K-means algorithm, including data reduction, sample weighting, and the use of the triangle inequality to speed up the nearest-neighbor search. Experiments on a diverse set of images demonstrate that, with the proposed modifications, K-means becomes very competitive with state-of-the-art color quantization methods in terms of both effectiveness and efficiency.

© 2009 Optical Society of America

Color-image quantization with use of a fast binary splitting technique

Raja Balasubramanian, Jan P. Allebach, and Charles A. Bouman
J. Opt. Soc. Am. A 11(11) 2777-2786 (1994)

Quantization and multilevel halftoning of color images for near-original image quality

Ronald S. Gentile, Eric Walowit, and Jan P. Allebach
J. Opt. Soc. Am. A 7(6) 1019-1026 (1990)

Histological image color normalization using a skewed normal distribution mixed model

Xiaoyan Fan, Zhanquan Sun, and Engang Tian
J. Opt. Soc. Am. A 39(3) 441-451 (2022)

Sensitivity evaluation of dynamic speckle activity measurements using clustering methods

Pablo Etchepareborda, Alejandro Federico, and Guillermo H. Kaufmann
Appl. Opt. 49(19) 3753-3761 (2010)

K-means clustering for support construction in diffractive imaging

Shunsuke Hattanda, Hiroyuki Shioya, Yosuke Maehara, and Kazutoshi Gohara
J. Opt. Soc. Am. A 31(3) 470-474 (2014)