Premium
On the fast search algorithms for vector quantization encoding
Author(s) -
Chen WenShiung,
Hsieh Lili,
Yuan ShangYuan
Publication year - 2002
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.10030
Subject(s) - codebook , vector quantization , algorithm , encoding (memory) , linde–buzo–gray algorithm , computer science , discrete cosine transform , computational complexity theory , search algorithm , quantization (signal processing) , pattern recognition (psychology) , artificial intelligence , image (mathematics)
One of the major difficulties arising in vector quantization (VQ) is high encoding time complexity. Based on the well‐known partial distance search (PDS) method and a special order of codewords in VQ codebook, two simple and efficient methods are introduced in fast full search vector quantization to reduce encoding time complexity. The exploitation of the “move‐to‐front” method, which may get a smaller distortion as early as possible, combined with the PDS algorithm, is shown to improve the encoding efficiency of the PDS method. Because of the feature of energy compaction in DCT domain, search in DCT domain codebook may be further speeded up. The experimental results show that our fast algorithms may significantly reduce search time of VQ encoding. © 2003 Wiley Periodicals, Inc. Int J Imaging Syst Technol 12, 204–210, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.10030