IEEE Transactions on Image Processing · 1996 · 619 citations · 19 references
ArtsHeritage ConservationDigital ImagingImage InterpretationInformation TheoryData CompressionDigital Image ProcessingImage CompressionImage ProcessingLossless Data CompressionRate-distortion TheoryCodingEntropy CodingImage RepresentationLossless Image CompressionMultiresolution Data RepresentationMultiresolution RepresentationSubband StructureTransform Coding
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.
19
The JPEG still picture compression standard
Gregory K. Wallace · Communications of the ACM · 1991 · 3.7K citations · Full text
Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM · 1987 · 2.9K citations · Full text