Multi-bit-plane parallel algorithm for integer square zerotree wavelet coding
基于整数小波变换的零树编码的多位平面并行算法

In order to solve the threshold-choosing problem caused by combining integer wavelet transform with traditional Embedded Zerotree Wavelet coding(EZW),Integer Square Zerotree Wavelet coding(ISZW) algorithm was proposed.Since ISZW used successive integer squares as quantization thresholds,it shortened the distance between two consecutive thresholds,but increased coding times,thus reduced coding speed.To solve this problem,a parallel multi-bit-plane coding algorithms for ISZW was presented,which required scanning each bit-plane only once,so greatly improved the coding speed of ISZW.