Fast wavelet packet image compression

Summary form only given. Presents a new fast wavelet packet compression algorithm that encodes very efficiently textured images. This fast wavelet packet compression technique relies on four stages: 1. Very fast convolution and decimation of the image with factorized filters. 2. Selection of a best basis in a large library of waveforms. The best basis is that basis which is best adapted to the content of the image. 3. Scanning of the wavelet packet coefficients by increasing frequency. This organization yields sequences of coefficients with a rapid decay. 4. Successive embedded approximation quantization, and entropy coding of the coefficients. We implemented the wavelet packet coder and decoder, and actual bit streams were created for each experiment. Our implementation used the 7-9 biorthogonal filters. We present the results of the algorithm, using the test image 512 x 512 Barbara. In order to evaluate the performance of the algorithm, we compared our algorithm to the SPIHT wavelet coder of Said and Pearlman (1996).