Listless Zerotree Image Compression Algorithm

A new listless zerotree image compression algorithm is presented. The classic SPIHT algorithm need to maintain three lists to store temporarily the image´s zerotree structure and significance information, which represents a major drawback for hardware implementation because a large amount of memory is needed to maintain these lists. Memory requirement of the algorithm is reduced significantly in LZC because of the replacement of lists by flag maps. But the performance of codec is also lowered. Besides, there is still some redundancy in the zerotree structure of SPIHT. In this paper, an improved zerotree structure and a new coding procedure are adopted, which improves the reconstructed image quality. Moreover, the lists in SPIHT are replaced by flag maps and lifting scheme is adopted to realize wavelet transform, which lowers the memory requirements and speeds up the coding process. Experimental results show that the algorithm is more effective and efficient compared to SPIHT