Classified Zerotree Wavelet Image Coding and Adaptive Pakcetization for Low Bit Rate Transport

Published

September 14, 2001

Author(s)

T Kim, S K. Choi, R E. Van Dyck, N K. Bose

Abstract

In this paper, we suggest a novel robust image coding and adaptive packetization algorithm suitable for very low bit rate transport. This algorithm can be applied to any zerotree-based encoder such as the embedded zerotree wavelet coder of Shapiro and set partitioning in hierarchical trees by Said and Pearlman. We propose a very explicit segmentation and packetization method of an image bit stream, where the lowest frequency subband is separately encoded from the higher frequency subbands for unequal protection over a noisy channel. The trees in the higher frequency subbands are split, classified, and assembled for efficient image coding and packetization according to their initial threshold and subband. The use of these classified trees enables one to make robust packets, while giving priority to some packets. Each packet has a different initial threshold and can be decoded independently. In spite of relatively heavy overhead for packetization, our algorithm is comparable to the original zerotree-based image coders used in ours at low bit rates. Additionally, simulation results show that the new method is resilient under severe packet losses.

Citation

IEEE Transactions on Circuits and Systems for Video Technology

Pub Type

Journals

Keywords

adaptive packetization, error resilient, image compression, low bit rate, subband coding, wavelet transform, zerotree

Citation

Kim, T. , Choi, S. , Van dyck, R. and Bose, N. (2001), Classified Zerotree Wavelet Image Coding and Adaptive Pakcetization for Low Bit Rate Transport, IEEE Transactions on Circuits and Systems for Video Technology (Accessed December 10, 2024)