A fast computational approach to the design of block quantization

The computational approach to bit allocation based on marginal analysis has been found to achieve performance superior to that of the rate-distortion theoretic approach. However, the computational complexity of marginal analysis is also much higher. A fast computational method is proposed to reduce the heavy computational burden. This new method also takes into account the non-Shannon quantization error of the scalar quantizer.

[1]  P. Schultheiss,et al.  Block Quantization of Correlated Gaussian Random Variables , 1963 .

[2]  Anil K. Jain,et al.  Image data compression: A review , 1981, Proceedings of the IEEE.

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

[4]  Adrian Segall Bit allocation and encoding for vector sources , 1976, IEEE Trans. Inf. Theory.

[5]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[6]  Yair Shoham,et al.  Efficient codebook allocation for an arbitrary set of vector quantizers , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[7]  P. Wintz Transform picture coding , 1972 .

[8]  L. Davisson Rate-distortion theory and application , 1972 .

[9]  Jerry D. Gibson,et al.  Distributions of the Two-Dimensional DCT Coefficients for Images , 1983, IEEE Trans. Commun..