Low Memory Zerotree Coding 


Vol. 27,  No. 8, pp. 814-821, Aug.  2002


PDF
  Abstract

The SPIHT(set partitioning in hierarchical tred)^[1] is efficient and well-known in the zerotree coding algorithm. However SPIHT's high memory requirement is a major difficulty for hardware implementation. In this paper we propose low-memory and fast zerotree algorithm. We present following three methods for reduced memory and fast coding speed. First, wavelet transform by lifting has a low memory requirement and reduced complexity than traditional filter bank implementation. The second method is to divide the wavelet coefficients into a block and to code each of them. This block is STB(spatial tree-based block) which is zerotree preserving block. Finally, we use NLS algorithm proposed by Wheeler and Pearlman in our codec. Performance of NLS is nearly same as SPIHT and reveals low and fixed memory and fast coding speed.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

C. Shin, H. Kim, J. Yoo, "Low Memory Zerotree Coding," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 8, pp. 814-821, 2002. DOI: .

[ACM Style]

Cheol Shin, Ho-Sik Kim, and Ji-sang Yoo. 2002. Low Memory Zerotree Coding. The Journal of Korean Institute of Communications and Information Sciences, 27, 8, (2002), 814-821. DOI: .

[KICS Style]

Cheol Shin, Ho-Sik Kim, Ji-sang Yoo, "Low Memory Zerotree Coding," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 8, pp. 814-821, 8. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880