Fast Codebook Search Algorithm for Vector Quantization using Sorting Technique

摘要

In this paper we propose partial yet efficient codebook search algorithm which uses sorting technique and uses only comparison. Our proposed algorithm does not use Euclidean distance computation and hence it is fastest as compared to other search methods ES, HOSM, DTPC. Form the results it is observed that proposed algorithm gives more MSE as compared to the exhaustive search method but with good execution speed. We also discuss codebook design methods LBG and FCG. The codebooks of different sizes 128, 256, 512 and 1024 are generated using LBG and FCG algorithm. Both the codebook generation algorithms are compared with respect to the execution speed. All the various search algorithms are implemented on the codebooks of different sizes 128, 256, 512 and 1024 obtained from LBG and FCG algorithms. From the results it is observed that FCG codebook gives better performance parameters MSE and PSNR as compared to LBG codebook and among the search algorithm proposed algorithm gives least time to encode the image with slight degradation in image quality.