• DocumentCode
    387845
  • Title

    Adaptive transform tree coding of images

  • Author

    Pearlman, William A. ; Leung, May M. ; Jakatdar, P.

  • Author_Institution
    Rensselaer Polytechnic Institute, Troy, New York
  • Volume
    10
  • fYear
    1985
  • fDate
    31138
  • Firstpage
    145
  • Lastpage
    148
  • Abstract
    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.
  • Keywords
    Computer errors; Discrete transforms; Distortion measurement; Eigenvalues and eigenfunctions; Electric variables measurement; Image coding; Image reconstruction; Quantization; Smoothing methods; Systems engineering and theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.
  • Type

    conf

  • DOI
    10.1109/ICASSP.1985.1168419
  • Filename
    1168419