Performance improvement of vector quantization by using threshold

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Chang, H. Y., Wang, P. C., Chen, R. C., & Hu, S. C. (2004). Performance improvement of vector quantization by using threshold. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3333, 647–654. https://doi.org/10.1007/978-3-540-30543-9_81

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free