8 September 1993 Lossy compression of palettized images
Author Affiliations +
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yung Chen, Heidi A. Peterson, Walter R. Bender, "Lossy compression of palettized images", Proc. SPIE 1913, Human Vision, Visual Processing, and Digital Display IV, (8 September 1993); doi: 10.1117/12.152703; https://doi.org/10.1117/12.152703
PROCEEDINGS
6 PAGES


SHARE
KEYWORDS
Image compression

Image processing

Image quality

Digital filtering

Image filtering

Image quality standards

Linear filtering

RELATED CONTENT

Preprocessing of compressed digital video
Proceedings of SPIE (December 29 2000)
Integer wavelet decomposition for lossy image compression
Proceedings of SPIE (October 18 1999)
Two Channel Image Coding Scheme
Proceedings of SPIE (November 01 1989)

Back to Top