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

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 tim...

Full description

Saved in:
Bibliographic Details
Published inFundamenta informaticae Vol. 76; no. 1-2; pp. 25 - 37
Main Authors Chang, Chin-Chen, Chen, Chang-Chu
Format Journal Article
LanguageEnglish
Published 01.01.2007
Online AccessGet full text

Cover

Loading…
More Information
Summary: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%.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0169-2968