Lossless compression of VQ indexes using search-order and correction codes

In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. Recently, an algorithm called search-order coding has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. We present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair. In addition, the correction codes are also adopted to improve the bit rate further. Simulation results indicate that our algorithm is able to achieve a bit rate up to 7% lower than the search-order coding algorithm.

[1]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[2]  Chaur-Heh Hsieh,et al.  Noiseless coding of VQ index using index grouping algorithm , 1996, IEEE Trans. Commun..

[4]  Chaur-Heh Hsieh,et al.  Lossless compression of VQ index with search-order coding , 1996, IEEE Trans. Image Process..

[5]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

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

[7]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[8]  Rémy Prost,et al.  Image compression by vector quantization: a review focused on codebook generation , 1994, Image Vis. Comput..

[9]  Nasser M. Nasrabadi,et al.  Image coding using vector quantization: a review , 1988, IEEE Trans. Commun..

[10]  Philip A. Chou,et al.  Entropy-constrained vector quantization , 1989, IEEE Trans. Acoust. Speech Signal Process..