A fast search algorithm for vector quantization using a directed graph

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

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems for video technology Vol. 10; no. 4; pp. 585 - 593
Main Authors Cao, H.Q., Li, W.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Bit rate
Complexity
Computational complexity
Degradation
Encoding
Graph theory
Multilevel
Nearest neighbor searches
Optimization
Search algorithms
Searching
Tree data structures
Vector quantization
Video compression
Video sequences
Online AccessGet full text

Cover

More Information
Summary: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,.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1051-8215
1558-2205
DOI:10.1109/76.845003