𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tabu search algorithm for codebook generation in vector quantization

✍ Scribed by Pasi Fränti; Juha Kivijärvi; Olli Nevalainen

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
496 KB
Volume
31
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis

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 is then fine-tuned by the generalized Lloyd algorithm (GLA). For a set of gray-scale images, the new algorithm was better than GLA alone, and its results were comparable to simulated annealing. For binary images, the tabu search approach gave the best MSE-values.

📜 SIMILAR VOLUMES

A novel encoding algorithm for vector qu
A novel encoding algorithm for vector quantization using transformed codebook
✍ Jim Z.C. Lai; Yi-Ching Liaw 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 183 KB

In this paper, a novel encoding algorithm for vector quantization is presented. Our method uses a set of transformed codewords and partial distortion rejection to determine the reproduction vector of an input vector. Experimental results show that our algorithm is superior to other methods in terms

Fast Search Algorithms for VQ Codebook G
Fast Search Algorithms for VQ Codebook Generation
✍ Jim Z.C. Lai; C.C. Lue 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we propose two fast codebook generation algo-book. Some alternative methods are also available [14]. rithms by making use of the information in the iterative process. The pairwise Nearest Neighbor (PNN) algorithm is a new Comparing to the conventional full search method (the LBG alter

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