Abstract
The vector quantization method for image compression inherently requires the generation of a codebook which has to be made available for both the encoding and decoding processes. That necessitates the attachment of this codebook when a compressed image is stored or sent. For the purpose of improving the overall efficiency of the vector quantization method, the need arose for improving a means for the reduction of the codebook size. In this paper, a new method for vector quantization is presented by which the suggested algorithm reduces the size of the codebook generated in vector quantization. This reduction is performed by sorting the codewords of the codebook then the differences between adjacent codewords are computed. Huffman coding (lossless compression) is performed on the differences in order to reduce the size of the codebbook.
Highlights
A fundamental goal of data compression is to reduce the bit rate for transmission or data storage while maintaining an acceptable fidelity or image quality [3]
The merging process is repeated until the desired size of the codebook is reached
The initial codebook is specified as suggested in this paper, sorting all training vectors merging every successive vector
Summary
A fundamental goal of data compression is to reduce the bit rate for transmission or data storage while maintaining an acceptable fidelity or image quality [3]. The advances in video technology, including high-definition television, are creating a demand for a new, better, and faster image compression technology [5]. Another area for the application of efficient coding is where pictures are stored in a database, such as archiving medical images, multispectral images, finger prints, and drawing [3]. The first type is called lossless methods because no data are lost, and the original image can be retrieved exactly from the compressed data. The second type is called lossy methods because they allow a loss in the actual image data, so the original uncompressed image cannot be retrieved exactly from the compressed file [5]
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call