Fast adaptive wavelet packet image compression

  • Authors:

  • F. G. Meyer;A. Z. Averbuch;J. -O. Stromberg

  • Affiliations:

  • Dept. of Electr. Eng., Colorado Univ., Boulder, CO;-;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

Wavelets are ill-suited to represent oscillatory patterns: rapid variations of intensity can only be described by the small scale wavelet coefficients, which are often quantized to zero, even at high bit rates. Our goal is to provide a fast numerical implementation of the best wavelet packet algorithm in order to demonstrate that an advantage can be gained by constructing a basis adapted to a target image. Emphasis is placed on developing algorithms that are computationally efficient. We developed a new fast two-dimensional (2-D) convolution decimation algorithm with factorized nonseparable 2-D filters. The algorithm is four times faster than a standard convolution-decimation. An extensive evaluation of the algorithm was performed on a large class of textured images. Because of its ability to reproduce textures so well, the wavelet packet coder significantly out performs one of the best wavelet coder on images such as Barbara and fingerprints, both visually and in term of PSNR