Premium
An efficient tree‐structured vector quantization using dynamic triangular inequality elimination
Author(s) -
Chu ChaoPing,
Yeh ChengYu,
Hwang ShawHwa
Publication year - 2014
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.22038
Subject(s) - vector quantization , codebook , codec , algorithm , tree (set theory) , linde–buzo–gray algorithm , computer science , search algorithm , mathematics , reduction (mathematics) , theoretical computer science , mathematical optimization , telecommunications , combinatorics , geometry
As applied to a vector quantization (VQ) codebook search, a combined version of a dynamic triangular inequality elimination (DTIE) and a tree‐structured VQ (TSVQ) algorithm, designated as the DTIE–TSVQ approach, is presented in this letter as an efficient way to reach the aim of search performance improvement by successive updating of the search scope and reduced search load through the DTIE algorithm. In this manner, this proposal features the combined advantages of a TIE and a TSVQ algorithm such that 100% search accuracy is rendered together with a remarkable reduction in computational load. At the end of this work, this proposal is validated as a superior algorithm over TIE and conventional TSVQ algorithms by a high computational load saving up to 97.45% when dealing with line spectral frequency (LSF) quantization in a G.729 speech codec and image VQ encodings. © 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.