Lossy and lossless compression for color-quantized images
Xin Chen; Ju-fu Feng; Kwong, S.
Image Processing, 2001. Proceedings. 2001 International Conference on
Volume 1, Issue , 2001 Page(s):870 - 873 vol.1
Digital Object Identifier 10.1109/ICIP.2001.959184
Summary: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
View citation and abstract |
Cart
