Fast Modified Zerotree Algorithm 


Vol. 29,  No. 6, pp. 785-792, Jun.  2004


PDF
  Abstract

In this paper, we propose a fast and efficient method that improves the performance of embedded zerotree wavelet(EZW) algorithm introduced by Shari po. In the EZW algorithm, two bits are allocated for a symbol, but it is inefficient for compression and the zerotree coding wastes much time at encoding. In this paper, in order to increase the efficiency of compression, it will be allocated a variable bit for a symbol at each subband. To reduce the encoding time, we use a backscan method and lifting scheme instead of filter bank in wavelet transform. Experimental result are shown that the algorithm suggested in this paper has a better performance about 0.3-1.5dB PSNR while the encoding time was speeded up more than 2-10 times compared with the EZW algorithm.

  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]

H. Kim, B. Lee, D. Kim, J. Yoo, "Fast Modified Zerotree Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 6, pp. 785-792, 2004. DOI: .

[ACM Style]

Ho-sik Kim, Bok-heun Lee, Dong-wook Kim, and Ji-sang Yoo. 2004. Fast Modified Zerotree Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 29, 6, (2004), 785-792. DOI: .

[KICS Style]

Ho-sik Kim, Bok-heun Lee, Dong-wook Kim, Ji-sang Yoo, "Fast Modified Zerotree Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 6, pp. 785-792, 6. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880