Lossy and lossless compression for color-quantized images


Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

1 Citation (Scopus)


An efficient compression scheme for color-quantized images based on progressive coding of color information has been developed. Rather than sorting color indexes into a linear list structure, a binary-tree structure of color indexes is proposed. With this structure the new algorithm can progressively recover an image from 2 colors up to all of the colors contained in the original image, i.e., a lossless recovery achieved. Experimental results show that it can efficiently compress images in both lossy and lossless cases. Typically for color-quantized Lena image with 256 colors, the algorithm achieved 0.5 bpp lower than state-of-the-art lossless compression methods while preserving the efficient lossy compression. Such a compression scheme is very attractive to many applications that require the ability to fast browsing or progressive transmission, and if necessary, to exactly recover the original image.
Original languageEnglish
Title of host publicationIEEE International Conference on Image Processing
Publication statusPublished - 2001
Externally publishedYes


Dive into the research topics of 'Lossy and lossless compression for color-quantized images'. Together they form a unique fingerprint.

Cite this