Tuned degree-K zerotree wavelet coding with virtual nodes

Li Wern Chew, Wai Chong Chia, Li Minn Ang .L.-M., Kah Phooi Seng

Research output: Book chapter/Published conference paperConference paper

Abstract

A degree-k zerotree coder codes the significance of a spatial orientation tree(SOT) up to k levels. A SOT is referred to as a degree-k zerotree if all the nodes are insignificant with respect to a threshold except for the nodes in the top k levels. Coding with a higher degree zerotree requires fewer encoding bits especially at lower bit-rates where most of the coefficients are insignificant. However, it may be less efficient at higher bit-rates since the wavelet coefficients are more likely to be significant as the number of planes encoded is increased. In this paper, a tuned degree-k zerotree wavelet (TDKZW) coding scheme where the degree of zerotree tested is tuned at each coding pass is presented. The concept of virtual coding is also applied in conjunction with the proposed algorithm. Simulation results show that our proposed coding scheme consistently outperforms the traditional SPIHT binary encoded coding.

Original languageEnglish
Title of host publication2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008
DOIs
Publication statusPublished - 01 Dec 2008
Event2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008 - Bangkok, Thailand
Duration: 08 Feb 200911 Feb 2009

Conference

Conference2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008
CountryThailand
CityBangkok
Period08/02/0911/02/09

Fingerprint Dive into the research topics of 'Tuned degree-K zerotree wavelet coding with virtual nodes'. Together they form a unique fingerprint.

  • Cite this

    Chew, L. W., Chia, W. C., Ang .L.-M., L. M., & Seng, K. P. (2008). Tuned degree-K zerotree wavelet coding with virtual nodes. In 2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008 [4806754] https://doi.org/10.1109/ISPACS.2009.4806754