𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast search algorithms for vector quantization in orthogonal transform domain

✍ Scribed by Hiroshi Nakaide; Kiyoharu Aizawa; Hiroshi Harashima

Book ID
112075659
Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
836 KB
Volume
71
Category
Article
ISSN
8756-6621

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