Stochastic generation of the codebook in vector quantization of images: compression systems

A major objective of image coding is to represent an image with as few bits as possible while preserving the level of quality and intelligibility required for the given application. Among the most widely used schemes, vector quantization has received considerably attention. The vector quantization scheme has proven to be very effective in speech and image coding. One of the most important steps in the whole process is the design of the codebook. The codebook is generally designed using the LBG algorithm, that is in essence a clustering algorithm which uses a large training set of empirical data that is statistically representative of the image to be quantized. The problem that we are addressing in the paper is the stochastic generation of the codebook

[1]  Manfred R. Schroeder,et al.  Code-excited linear prediction(CELP): High-quality speech at very low bit rates , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

[3]  Bhaskar Ramamurthi,et al.  Image coding using vector quantization , 1982, ICASSP.

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

[5]  Joel Max,et al.  Quantizing for minimum distortion , 1960, IRE Trans. Inf. Theory.