Fast codebook search algorithms based on tree-structured vector quantization

Abstract

Tree-structured vector quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the selected codeword is the closest one to the input vector. Consequently, the image quality of TSVQ is worse than that of full-search VQ (FSVQ). Although researchers have proposed multipath TSVQ and DP-TSVQ to enhance the image quality, these methods are still too slow for achieving high image quality. Therefore, this study presents a novel full search equivalent TSVQ (FSE-TSVQ) to obtain efficiently the closest codeword for each input vector. FSE-TSVQ employs the triangle inequality to achieve efficient pruning of impossible codewords. Moreover, this study also develops the enhanced DP-TSVQ (EDP-TSVQ) algorithm, which achieves a better trade-off than DP-TSVQ between encoding time and image quality. EDP-TSVQ is a hybrid technique which adds DP-TSVQ’s critical function to FSE-TSVQ. EDP-TSVQ always provides an image quality identical to that of DP-TSVQ, but by searching fewer codebook tree nodes. Simulation results reveal that FSE-TSVQ requires only 21–38% of the running time of FSVQ. For a high image quality application, the performance of EDP-TSVQ is always better than that of DP-TSVQ. Using the example of a codebook tree with 512 codewords, with the threshold of the critical function set to 0.6, simulation results indicate that EDP-TSVQ requires only 37% of the execution time of DP-TSVQ.