Fast and Low Memory Scalable Image Compression Using Scanning Tree

摘要

In this paper, we develop a fast and low memory image bitplane coding algorithm based on scanning tree (BCST) by exploiting both intraband clustering of significant coefficients and interband dependency in significant fields. In BCST, subband quadtrees are combined to a scanning tree, and then the bitplanes are encoded with the information provided by the scanning tree. Experimental results for some images show that BCST algorithm provides better performance than EZW and SPIHT algorithm.