Abstract

We investigate an efficient color-image quantization technique that is based on an existing binary splitting algorithm [ IEEE Trans. Signal Process . 39, 2677 ( 1991)]. The algorithm sequentially splits the color space into polytopal regions and picks a palette color from each region. As originally proposed, the complexity of this algorithm is a function of the image size. We introduce a fast histogramming step so that the complexity will depend only on the number of distinct image colors. Data structures are employed that permit the storage of a full-color histogram at moderate memory cost. In addition, we apply a prequantization step that reduces the number of initial image colors while preserving image quality along visually important color coordinates. Finally, we incorporate a spatial-activity measure to reflect the increased sensitivity of the human observer to quantization errors in smooth image regions. This technique preserves the quantitative and qualitative performance of the original binary splitting algorithm while considerably reducing the computation time.

© 1994 Optical Society of America

Fast color quantization using weighted sort-means clustering

M. Emre Celebi
J. Opt. Soc. Am. A 26(11) 2434-2443 (2009)

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)

Method for estimating scene parameters from color histograms

Carol L. Novak and Steven A. Shafer
J. Opt. Soc. Am. A 11(11) 3020-3036 (1994)

Temporal-color space analysis of reflection

Yoichi Sato and Katsushi Ikeuchi
J. Opt. Soc. Am. A 11(11) 2990-3002 (1994)

Effects of spatial sampling and luminance quantization on the image quality of color matrix displays

Louis D. Silverstein, John H. Krantz, Frank E. Gomer, Yei-Yu Yeh, and Robert W. Monty
J. Opt. Soc. Am. A 7(10) 1955-1968 (1990)