Translator Disclaimer
1 April 2006 Lossless compression of color palette images with one-dimensional techniques
Author Affiliations +
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.
© (2006) Society of Photo-Optical Instrumentation Engineers (SPIE)
Ziya Arnavut and Ferat Sahin "Lossless compression of color palette images with one-dimensional techniques," Journal of Electronic Imaging 15(2), 023014 (1 April 2006). https://doi.org/10.1117/1.2194517
Published: 1 April 2006
JOURNAL ARTICLE
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Towards an animated JPEG
Proceedings of SPIE (September 27 2016)
Coding and transmission of subband coded images on the Internet
Proceedings of SPIE (September 25 2001)
Lossy coding scheme of binary character patterns
Proceedings of SPIE (April 20 1995)
Accessing textual information embedded in Internet images
Proceedings of SPIE (December 26 2000)
Lossless compression of pseudocolor images
Proceedings of SPIE (September 30 1998)

Back to Top