✦ LIBER ✦

High-speed closest codeword search algorithms for vector quantization

✍ Scribed by Chang-Hsing Lee; Ling-Hwei Chen

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 759 KB
Volume: 43
Category: Article
ISSN: 0165-1684
DOI: 10.1016/0165-1684(95)00009-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the fast search algorithms for vector

On the fast search algorithms for vector quantization encoding

✍ Wen-Shiung Chen; Lili Hsieh; Shang-Yuan Yuan 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract 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 qu

Tabu search algorithm for codebook gener

Tabu search algorithm for codebook generation in vector quantization

✍ Pasi Fränti; Juha Kivijärvi; Olli Nevalainen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

A tabu search algorithm is proposed for the codebook generation in vector quantization. The key question is the definition of neighboring solution. Making random modifications to the current solution alone is not sufficient. The proposed algorithm first makes non-local changes to the codebook which

Fast adaptive search algorithm for vecto

Fast adaptive search algorithm for vector quantization by progressive codebook arrangement

✍ A. Nyeck; H. Mokhtari; A. Tosser-Roussey 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 220 KB