A New Image Coding Technique with Low Entropy Using a Flexible Zerotree

Sanghyun JOO  Hisakazu KIKUCHI  Shigenobu SASAKI  Jaeho SHIN  

Publication
IEICE TRANSACTIONS on Communications   Vol.E81-B   No.12   pp.2528-2535
Publication Date: 1998/12/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Source Encoding
Keyword: 
image compression,  wavelet transform,  zerotree coding,  entropy coding,  

Full Text: PDF(732KB)>>
Buy this Article




Summary: 
A zerotree image-coding scheme is introduced that effectively exploits the inter-scale self-similarities found in the octave decomposition by a wavelet transform. A zerotree is useful for efficiently coding wavelet coefficients; its efficiency was proved by Shapiro's EZW. In the EZW coder, wavelet coefficients are symbolized, then entropy-coded for further compression. In this paper, we analyze the symbols produced by the EZW coder and discuss the entropy for a symbol. We modify the procedure used for symbol-stream generation to produce lower entropy. First, we modify the fixed relation between a parent and children used in the EZW coder to raise the probability that a significant parent has significant children. The modified relation is flexibly modified again based on the observation that a significant coefficient is more likely to have significant coefficients in its neighborhood. The three relations are compared in terms of the number of symbols they produce.