This paper presents a zerotree coding method for color images that uses no lists during encoding and decoding permitting the omission as the lists requirement in Said and Pearlman's (see IEEE Transactions on Circuit and System for Video Technology, vol.6, no.3, p.243-50, 1996) set partitioning in hierarchical trees (SPIHT) algorithm. Without the lists, the memory requirement in a VLSI implementation is reduced significantly. This coding algorithm is also developed to reduce the circuit complexity of an implementation. Our experimental results show only a minor reduction of PSNR values when compared with the PSNR values obtained by the SPIHT codec illustrating well the trade-off between memory requirement and hardware simplicity.
[1]
Ian H. Witten,et al.
Arithmetic coding for data compression
,
1987,
CACM.
[2]
Zixiang Xiong,et al.
Very low bit-rate embedded video coding with 3-D set partitioning in hierarchical trees
,
2000
.
[3]
William A. Pearlman,et al.
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
,
1996,
IEEE Trans. Circuits Syst. Video Technol..
[4]
Michel Barlaud,et al.
Image coding using wavelet transform
,
1992,
IEEE Trans. Image Process..
[5]
Jerome M. Shapiro,et al.
Embedded image coding using zerotrees of wavelet coefficients
,
1993,
IEEE Trans. Signal Process..