Fast adaptive wavelet packet image compression

François G. Meyer

doi:10.1109/83.841526

Return

Fast adaptive wavelet packet image compression

2000-05-01

107

PRE

François G. Meyer *

Averbuch, AZ

Jan-Olov Strömberg

DOI：10.1109/83.841526

Original

Original request for help

Save

Abstract

En 中文

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 in this paper is to provide a fast numerical implementation of the best wavelet packet algorithm [1] in order to demonstrate that an advantage can be gained by constructing a basis adapted to a target image. Emphasis in this paper has been 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 [2] on images such as Barbara and fingerprints, both visually and in term of PSNR.

Keywords:

adaptive transform

best basis

image compression

ladder structure

wavelet packet

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.