An optimal transform tree coding method applied to images

We have utilized for image coding a transform tree coding technique that is theoretically optimal for Gaussian sources and the squared error criterion at all nonzero rates. In the interest of affordable computation, we used a suboptimal discrete cosine transform to encode image sub-blocks and a selective search through the code tree. Coding simulations of a woman's face image at rates of 1.0 and 0.25 bits/pel gave good to excellent results. The rate 1.0 results were superior to previous ones using another tree coding method. Until now there have been no reported results with searched codes for images using a rate under 1.0 bit/pel. Encoding a computer-generated image source indicated SNR performance about 2dB less than the optimal SNR of the rate-distortion bound.

[1]  Yechiam Yemini,et al.  Asymptotic Properties of Discrete Unitary Transforms , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Bennett Fox,et al.  Discrete Optimization Via Marginal Analysis , 1966 .

[3]  Anil K. Jain,et al.  A Sinusoidal Family of Unitary Transforms , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[5]  John B. Anderson,et al.  Tree encoding of images in the presence of channel errors , 1981, IEEE Trans. Inf. Theory.

[6]  J. Modestino,et al.  Robust Two-Dimensional Tree Encoding of Images , 1981, IEEE Trans. Commun..