Abstract:
Image-adaptive color palettization chooses a decreased number of colors to represent an image. Palettization is one way to decrease storage and memory requirements for low-end displays. Palettization is generally approached as a clustering problem, where one attempts to find the k palette colors that minimize the average distortion for all the colors in an image. This would be the optimal approach if the image was to be displayed with each pixel quantized to the closest palette color. However, to improve the image quality the palettization may be followed by error diffusion. In this work, we propose a two-stage palettization where the first stage finds some $m /ll k$ clusters, and the second stage chooses palette points that cover the spread of each of the M clusters. After error diffusion, this method leads to better image quality at less computational cost and with faster display speed than full k-means palettization.
Bibtex:
@INPROCEEDINGS{MG02,
AUTHOR = "N. J. Mitra and M. Gupta",
TITLE = "A two-stage color palettization algorithm for error diffusion",
BOOKTITLE = "SPIE Electronic Imaging Conference",
YEAR = "2002",
PAGES = "207--217"
}
