Performance improvement of vector quantization by using threshold

Authors:
Hung-Yi Chang;Pi-Chung Wang;Rong-Chang Chen;Shuo-Cheng Hu
Affiliations:
Department of Information Management, I-Shou University, Ta-Hsu Hsiang, Kaohsiung County, Taiwan, R.O.C.;Institute of Computer Science and Information Technology, National Taichung Institute of Technology, Taichung, Taiwan, R.O.C.;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung, Taiwan, R.O.C.;Department of Information Management, Ming-Hsin University of Science and Technology, Hsinchu, Taiwan, R.O.C.
Venue:
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Year:
2004

Citing 3
Cited 1

Vector quantization and signal compression

Vector quantization and signal compression
An efficient computation of Euclidean distances using approximated look-up table

IEEE Transactions on Circuits and Systems for Video Technology
An efficient Euclidean distance computation for vector quantization using a truncated look-up table

IEEE Transactions on Circuits and Systems for Video Technology

Hardware accelerator for vector quantization by using pruned look-up table

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vector quantization (VQ) is an elementary technique for image compression. However, the complexity of searching the nearest codeword in a codebook is time-consuming. In this work, we improve the performance of VQ by adopting the concept of THRESHOLD. Our concept utilizes the positional information to represent the geometric relation within codewords. With the new concept, the lookup procedure only need to calculate Euclidean distance for codewords which are within the threshold, thus sifts candidate codewords easily. Our scheme is simple and suitable for hardware implementation. Moreover, the scheme is a plug-in which can cooperate with existing schemes to further fasten search speed. The effectiveness of the proposed scheme is further demonstrated through experiments. In the experimental results, the proposed scheme can reduce 64% computation with only an extra storage of 512 bytes.