A low memory degree-K zerotree coder

Li Wern Chew; Li Minn Ang; Kah Phooi Seng

doi:10.1109/ISPACS.2009.4806675

A low memory degree-K zerotree coder

Li Wern Chew, Li Minn Ang, Kah Phooi Seng

University of Nottingham

Research output: Book chapter/Published conference paper › Conference paper › peer-review

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 language	English
Title of host publication	2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008
DOIs	https://doi.org/10.1109/ISPACS.2009.4806675
Publication status	Published - 01 Dec 2008
Event	2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008 - Bangkok, Thailand Duration: 08 Feb 2009 → 11 Feb 2009

Conference

Conference	2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008
Country/Territory	Thailand
City	Bangkok
Period	08/02/09 → 11/02/09

Access to Document

10.1109/ISPACS.2009.4806675

Cite this

@inproceedings{532e5f8d0ecc47e1999cacacf7a4fd74,

title = "A low memory degree-K zerotree coder",

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.",

author = "Chew, {Li Wern} and Ang, {Li Minn} and Seng, {Kah Phooi}",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/ISPACS.2009.4806675",

language = "English",

isbn = "9781424425655",

booktitle = "2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008",

note = "2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008 ; Conference date: 08-02-2009 Through 11-02-2009",

}

TY - GEN

T1 - A low memory degree-K zerotree coder

AU - Chew, Li Wern

AU - Ang, Li Minn

AU - Seng, Kah Phooi

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=66749173637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=66749173637&partnerID=8YFLogxK

U2 - 10.1109/ISPACS.2009.4806675

DO - 10.1109/ISPACS.2009.4806675

M3 - Conference paper

SN - 9781424425655

BT - 2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008

T2 - 2008 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2008

Y2 - 8 February 2009 through 11 February 2009

ER -

A low memory degree-K zerotree coder

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this