Share Email Print

Proceedings Paper

New approach to palette selection for color images
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We apply the vector quantization algorithm proposed by Equitz to the problem of efficiently selecting colors for a limited image palette. The algorithm performs the quantization by merging pairwise nearest neighbor (PNN) clusters. Computational efficiency is achieved by using k- dimensional trees to perform fast PNN searches. In order to reduce the number of initial image colors, we first pass the image through a variable-size cubical quantizer. The centroids of colors that fall in each cell are then used as sample vectors for the merging algorithm. Tremendous computational savings is achieved from this initial step with very little loss in visual quality. To account for the high sensitivity of the human visual system to quantization errors in smoothly varying regions of an image, we incorporate activity measures both at the initial quantization step and at the merging step so that quantization is fine in smooth regions and coarse in active regions. The resulting images are of high visual quality. The computation times are substantially smaller than that of the iterative Lloyd-Max algorithm and are comparable to a binary splitting algorithm recently proposed by Bouman and Orchard.

Paper Details

Date Published: 1 June 1991
PDF: 12 pages
Proc. SPIE 1453, Human Vision, Visual Processing, and Digital Display II, (1 June 1991); doi: 10.1117/12.44345
Show Author Affiliations
Raja Balasubramanian, Purdue Univ. (United States)
Jan P. Allebach, Purdue Univ. (United States)

Published in SPIE Proceedings Vol. 1453:
Human Vision, Visual Processing, and Digital Display II
Bernice E. Rogowitz; Michael H. Brill; Jan P. Allebach, Editor(s)

© SPIE. Terms of Use
Back to Top