Share Email Print

Journal of Electronic Imaging

Lossless compression of color palette images with one-dimensional techniques
Format Member Price Non-Member Price
PDF $20.00 $25.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

Palette images are widely used on the World Wide Web (WWW) and in game-cartridge applications. Many images used on the WWW are stored and transmitted after they are compressed losslessly with the standard graphics interchange format (GIF), or portable network graphics (PNG). Well-known 2-D compression schemes, such as JPEG-LS and JPEG-2000, fail to yield better compression than GIF or PNG due to the fact that the pixel values represent indices that point to color values in a look-up table. To improve the compression performance of JPEG-LS and JPEG-2000 techniques, several researchers have proposed various reindexing algorithms. We investigate various compression techniques for color palette images. We propose a new technique comprised of a traveling salesman problem (TSP)-based reindexing scheme, Burrows-Wheeler transformation, and inversion ranks. We show that the proposed technique yields better compression gain on average than all the other 1-D compressors and the reindexing schemes that utilize JPEG-LS or JPEG-2000.

Paper Details

Date Published: 1 April 2006
PDF: 11 pages
J. Electron. Imag. 15(2) 023014 doi: 10.1117/1.2194517
Published in: Journal of Electronic Imaging Volume 15, Issue 2
Show Author Affiliations
Ziya Arnavut, SUNY/Fredonia (United States)
Ferat Sahin, Rochester Institute of Technology (United States)

© SPIE. Terms of Use
Back to Top