A low memory degree-K zerotree coder

Li Wern Chew, Li Minn Ang, Kah Phooi Seng

Research output: Book chapter/Published conference paperConference paper

Abstract

Image compression based on zerotree coding such as set-partitioning in hierarchical trees (SPIHT) yield very good performance. SPIHT uses bit-plane coding where the wavelet coefficients are scanned at every encoding pass. This requires a lot of memory space since the whole image has to be stored for the process of set-partitioning coding. In this paper, a low memory degree-k zerotree wavelet coding scheme is presented. The proposed algorithm uses a new tree structure with a lower scale of wavelet decomposition. Besides this, the degree of zerotree tested is tuned at each encoding pass.Simulation results show that our proposed coding scheme gives an almost equivalent performance as the SPIHT algorithm and achieves a memory reduction of 93.75% compared to SPIHT.

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 'A low memory degree-K zerotree coder'. Together they form a unique fingerprint.

  • Cite this

    Chew, L. W., Ang, L. M., & Seng, K. P. (2008). A low memory degree-K zerotree coder. In 2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008 [4806675] https://doi.org/10.1109/ISPACS.2009.4806675