A low memory zerotree coding for arbitrarily shaped objects

Chorng Yann Su*, Bing Fei Wu

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

20 引文 斯高帕斯(Scopus)

摘要

The Set Partitioning In Hierarchical Trees (SPIHT) algorithm is a computationally simple and efficient zerotree coding technique for image compression. However, high working memory requirement is its main drawback for hardware realization. In this study, we present a low memory zerotree coder (LMZC), which requires much less working memory than SPIHT. The LMZC coding algorithm abandons the use of lists, defines a different tree structure, and merges the sorting pass and the refinement ass together. The main techniques of LMZC are the recursive programming and a top-bit scheme (TBS). In TBS, the top bits of transformed coefficients are used to store the coding status of coefficients instead of the lists used in SPIHT. In order to achieve high coding efficiency, shape-adaptive discrete wavelet transforms are used to transformation arbitrarily shaped objects. A compact emplacement of the transformed coefficients is also proposed to further reduce working memory. The LMZC carefully treats "don't care" nodes in the wavelet tree and does not use bits to code such nodes. Comparison of LMZC with SPIHT shows that for coding a 768 × 512 color image, LMZC saves at least 5.3 MBytes of memory but only increases a little execution time and reduces minor peak signal-to noise ratio (PSNR) values, thereby making it highly promising for some memory limited applications.

原文英語
頁(從 - 到)271-282
頁數12
期刊IEEE Transactions on Image Processing
12
發行號3
DOIs
出版狀態已發佈 - 2003 三月

ASJC Scopus subject areas

  • 軟體
  • 電腦繪圖與電腦輔助設計

指紋

深入研究「A low memory zerotree coding for arbitrarily shaped objects」主題。共同形成了獨特的指紋。

引用此