An image multiresolution representation for lossless and lossy compression

We propose a new image multiresolution transform that is suited for both lossless (reversible) and lossy compression. The new transformation is similar to the subband decomposition, but can be computed with only integer addition and bit-shift operations. During its calculation, the number of bits re...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on image processing Vol. 5; no. 9; pp. 1303 - 1310
Main Authors Said, A., Pearlman, W.A.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.09.1996
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text
ISSN1057-7149
DOI10.1109/83.535842

Cover

More Information
Summary:We propose a new image multiresolution transform that is suited for both lossless (reversible) and lossy compression. The new transformation is similar to the subband decomposition, but can be computed with only integer addition and bit-shift operations. During its calculation, the number of bits required to represent the transformed image is kept small through careful scaling and truncations. Numerical results show that the entropy obtained with the new transform is smaller than that obtained with predictive coding of similar complexity. In addition, we propose entropy-coding methods that exploit the multiresolution structure, and can efficiently compress the transformed image for progressive transmission (up to exact recovery). The lossless compression ratios are among the best in the literature, and simultaneously the rate versus distortion performance is comparable to those of the most efficient lossy compression methods.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1057-7149
DOI:10.1109/83.535842