Share Email Print

Proceedings Paper

Improved zerotree coding algorithm for wavelet image compression
Author(s): Jun Chen; Yunsong Li; Chengke Wu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A listless minimum zerotree coding algorithm based on the fast lifting wavelet transform with lower memory requirement and higher compression performance is presented in this paper. Most state-of-the-art image compression techniques based on wavelet coefficients, such as EZW and SPIHT, exploit the dependency between the subbands in a wavelet transformed image. We propose a minimum zerotree of wavelet coefficients which exploits the dependency not only between the coarser and the finer subbands but also within the lowest frequency subband. And a ne listless significance map coding algorithm based on the minimum zerotree, using new flag maps and new scanning order different form Wen-Kuo Lin et al. LZC, is also proposed. A comparison reveals that the PSNR results of LMZC are higher than those of LZC, and the compression performance of LMZC outperforms that of SPIHT in terms of hard implementation.

Paper Details

Date Published: 4 December 2000
PDF: 6 pages
Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000); doi: 10.1117/12.408585
Show Author Affiliations
Jun Chen, Xidian Univ. (China)
Yunsong Li, Xidian Univ. (China)
Chengke Wu, Xidian Univ. (China)

Published in SPIE Proceedings Vol. 4119:
Wavelet Applications in Signal and Image Processing VIII
Akram Aldroubi; Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?