Full-Searching-Equivalent Vector Quantization Using Two-Bounds Triangle Inequality

Abstract

The encoding process of vector quantization (VQ) is indeed computational complex and time consuming. Compared with actual Euclidean distance computation, some inequalities can generate estimations with less computation to filter out the impossible codevectors as well as to reduce the computation time. In this paper, we introduce a new estimation for the Euclidean distance using two-bounds triangle inequality. The experimental results show that our proposed scheme can reduce Euclidean distance computation by 71% to 94% for full search. Having been proved, our proposed scheme can reduce the computing time by 42% to 51%.