A rearrangement algorithm of wavelet packet coefficients for zerotree coding

Zerotree coding based on the wavelet transform is a very effective image compression technique. Since it exploits the dyadic multiresolution characteristic of wavelet transform, however, it is not easy to adapt it to the wavelet packet decomposition, which provides better energy compaction than the wavelet transform, but does not have dyadic multiresolution structures. In this paper appropriate coefficient rearrangement in the wavelet packet transform domain is considered for efficient zerotree coding. The proposed coding scheme is proved to be simple and superior to the existing zerotree coding schemes