By Topic

Adaptive transform tree coding of images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pearlman, W.A. ; Rensselaer Polytechnic Institute, Troy, New York ; Leung, M. ; Jakatdar, P.

A transform tree code, theoretically optimal for stationary Gaussian sources and the squared-error distortion measure at all rates, is adaptively applied in a blockwise fashion to the encoding of images. The rate of the basic tree code is 0.5 bits/pel and the overhead rate ranges from .24 to .36 bits/pel. A smoothing and block quantization is used for effective reduction of the rate for transmitting a set of eigenvalue estimates, which comprise the main contribution to the overhead. In encoding simulations the adaptation with smoothing and quantization gave better performance with a block size of 16 at lower search intensity and with more uniformity and less blocking effect. At a block size of 32, where the reconstruction quality is higher, the same adaptation technique yielded nearly the same results as the non-adaptive one at the same overall rate, but with a savings of search and computational complexity.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.  (Volume:10 )

Date of Conference:

Apr 1985