Listless zerotree image compression algorithm

Abstract

In this paper, an improved zerotree structure and a new coding procedure are adopted, which improve the reconstructed image qualities. 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 with SPIHT.

References

[1] J. Shapiro,in Proc. IEEE Int. Conf. Acoust., Speech, Signal Proc., IV, San Francisco CA, 1992, 657.

[2] SaidA., PearlmanW. A.. IEEE Transaction on Circuit and Systems for Video Technology, 1996, 6: 243-243

[3] MallatS. G.. IEEE Trans. on Pattern Anal. Math. Intell., 1989, 11: 674-674

[4] Wei-guoWang, Bao-longGuo. Journal of Xidian University, 1997, 14: 1-1

[5] Wen Kuo Lin and N. Burgess,Proc of the 32nd, Asilomar Conf on Signals, Systems and Computers, 1998, 231.

[6] LinWen Kuo, BurgessN.. Information, Decision and Control, 1999, 2: 91-91

[7] I. Daubechies and W. Sweldens,Factoring wavelet transforms into lifting steps Technical report, Bell Laboratories, Lucent Technologies, 1996.

[8] WangNa, Chuan-yingJia, Yin-shanJia. Signal Processing, 2000, 19: 269-269

[9] Jian-fenZeng, Zhen-mingMa. Journal of Image and Graphics, 2001, 6: 1111-1117

[10] Jian-fenZeng, Zheng-mingMa. Journal of Sun Yat-sen University, 2002, 41: 32-32