By Topic

A fast search algorithm for vector quantization using a directed graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Q. Cao ; Dept. of Electr. Eng. & Comput., Lehigh Univ., Bethlehem, PA, USA ; W. Li

A fast search algorithm for vector quantization (VQ) is presented. This approach provides a practical solution to the implementation of a multilevel search based on a special designed directed graph (DG). An algorithm is also given of the optimal DG for any given practical source. Simulation results obtained from applying this approach to still images have shown that it can reduce the searching complexity to 3% of the exhaustive search vector quantization (ESVQ) while introducing only negligible searching errors. It has also been shown that the searching complexity is close to a linear growth with the bit rate rather than an exponential growth in ESVQ,

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:10 ,  Issue: 4 )