Share Email Print

Proceedings Paper

Decomposing bit planes to reduce compression requirement for lossless channels
Author(s): Asif Hayat; Tae-Sun Choi
Format Member Price Non-Member Price
PDF $14.40 $18.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

Segmentation of images to bit planes is one of the techniques for scalable image compression. Assuming our source image to be from a uniform quantizer, we categorize its bit planes on the basis of their significance, into two groups called MSB-planes and LSB-planes. The MSB planes contain low-entropy structural information, whereas LSB planes contain high entropy texture information. Due to the different nature of information and entropy of the two groups, they can be coded and reconstructed by different algorithms. The structural nature of MSB planes, make them more compressible at entropy coding stage, whereas the low significance of LSB-planes can be exploited against their high entropy. We realize the later by subsampling of LSB-planes, which in turn requires attention to the close coupling of MSB and LSB planes at the reconstruction stage. We introduce an estimation algorithm for the LSB planes. The reconstructed images are found to be perceptually comparable to the original images. Quantitative comparison also shows significant coding gain in terms of SNR vs. bit rate.

Paper Details

Date Published: 30 January 2003
PDF: 7 pages
Proc. SPIE 4793, Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications, (30 January 2003); doi: 10.1117/12.451252
Show Author Affiliations
Asif Hayat, Kwangju Institute of Science and Technology (South Korea)
Tae-Sun Choi, Kwangju Institute of Science and Technology (South Korea)

Published in SPIE Proceedings Vol. 4793:
Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications
Mark S. Schmalz, Editor(s)

© SPIE. Terms of Use
Back to Top