A Simple Algorithm for Ordering and Compression of Vector Codebooks
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies on structuring and ordering properties of a binary split algorithm used for codebook design. A simple algorithm is presented for automatic ordering of the codebook entries in order to group similar codevectors. This similarity is exploited in efficient compression of the codebook content by the means of lossless differential coding and lossy DCT-based coding. Experimental results of two compression experiments are reported and show that a small compression gain can be achieved in this way.
Keywordsvector quantization codebook compression
Unable to display preview. Download preview PDF.
- 1.Linde, Y., Buzo, A., Gray, R.M.: An Algorithm for Vector Quantizer Design. IEEE Trans. on Communications (1980) 84–89Google Scholar
- 2.MacQueen, J.B.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proc. 5th Berkeley Symp. Math. Statistics and Probability (1967) 281–297Google Scholar