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. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. [References: 13]
展开▼
