Share Email Print

Proceedings Paper

Lossy compression of palettized images
Author(s): Yung Chen; Heidi A. Peterson; Walter R. Bender
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Many digital display systems economize by rendering color images with the use of a limited palette. Palettized images differ from continuous-tone images in two important ways: they are less continuous due to their use of lookup table indices instead of physical intensity values, and pixel values may be dithered for better color rendition. These image characteristics reduce the spatial continuity of the image, leading to high bit rates and low image quality when compressing these images using a conventional lossy coder. We present an algorithm that uses a debinarization technique to approximate the original continuous-tone image, before palettization. The color components of the reconstructed image are then compressed using standard lossy compression techniques. The decoded images must be color quantized to obtain a palettized image. We compare our results with a second algorithm that applies a combination of lossy and lossless compression directly to the color quantized image in order to avoid color quantization after decoding.

Paper Details

Date Published: 8 September 1993
PDF: 6 pages
Proc. SPIE 1913, Human Vision, Visual Processing, and Digital Display IV, (8 September 1993); doi: 10.1117/12.152703
Show Author Affiliations
Yung Chen, Merck & Co. (United States)
Heidi A. Peterson, IBM Thomas J. Watson Research Ctr. (United States)
Walter R. Bender, Media Lab./MIT (United States)

Published in SPIE Proceedings Vol. 1913:
Human Vision, Visual Processing, and Digital Display IV
Jan P. Allebach; Bernice E. Rogowitz, Editor(s)

© SPIE. Terms of Use
Back to Top