A fixed-rate product pyramid vector quantization using a Bayesian model

The performance of the pyramid vector quantizer is analyzed. Some useful formulas for the computation of the pyramid numbers N(L, K) are derived from the generating function. The quantization error, when (L-K)-thresholding is employed is estimated. Extending the Laplacian model, the results can be generalized by applying the Bayesian method. Some simulation results for pyramid vector quantization in DCT (discrete cosine transform) image compression are given.<<ETX>>

[1]  Thomas R. Fischer,et al.  A comparison of vector quantization techniques in transform and subband coding of imagery , 1991, Signal Process. Image Commun..

[2]  Jan Biemond,et al.  An optimal bit allocation algorithm for sub-band coding , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[3]  N. J. A. Sloane,et al.  Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.

[4]  Thomas R. Fischer,et al.  Optimum rate allocation in pyramid vector quantizer transform coding of imagery , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  J. Berger.  Statistical Decision Theory and Bayesian Analysis , 1988 .

[6]  Thomas R. Fischer,et al.  A pyramid vector quantizer , 1986, IEEE Trans. Inf. Theory.