A Fast Algorithm for Designing Better Codebooks in Image Vector Quantization

Abstract

Vector quantization (VQ) is an effective method of data compression. Its decoding process is very simple and a high compression ratio can be obtained. So, VQ has been extensively used in image and speech compression. However, VQ has some difficulties such as the efficiency of codebook design process and the degradation of edges. In the codebook design and encoding phases, searching for the closest codeword is a highly computational process, especially for high dimensional vectors. So, the Linde-Buzo-Gray (LBG) algorithm, the earliest and the most famous algorithm for codebook generation, is a time consuming algorithm. In this paper, our efforts are to design an algorithm to generate a better codebook and to reduce the computation time compared with the previous algorithms in codebook generation.