An evolution-based tabu search approach to codebook design

Authors:
Shih-Ming Pan;Kuo-Sheng Cheng
Affiliations:
Institute of Biomedical Engineering, National Cheng Kung University, Tainan, Taiwan 701, ROC and Department of Electrical Engineering, Kao Yuan University, Kaohsiung County, Taiwan 821, ROC;Institute of Biomedical Engineering, National Cheng Kung University, Tainan, Taiwan 701, ROC
Venue:
Pattern Recognition
Year:
2007

Citing 9
Cited 3

Using simulated annealing to design good codes

IEEE Transactions on Information Theory
Vector quantization and signal compression

Vector quantization and signal compression
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Optimizing tabu list size for the traveling salesman problem

Computers and Operations Research
Genetic algorithm with deterministic crossover for vector quantization

Pattern Recognition Letters
Tabu Search

Tabu Search
Globally optimal vector quantizer design by stochastic relaxation

IEEE Transactions on Signal Processing
Evolutionary computation: comments on the history and current state

IEEE Transactions on Evolutionary Computation
Comparison and optimization of methods of color image quantization

IEEE Transactions on Image Processing

A tabu search approach for the minimum sum-of-squares clustering problem

Information Sciences: an International Journal
A fast VQ codebook generation algorithm via pattern reduction

Pattern Recognition Letters
An improved simulated annealing algorithm for vector quantizer design

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents an evolution-based tabu search approach (ETSA) to design codebooks with smaller distortion values in vector quantization. In the ETSA, there is no need for users to determine the size of a tabu memory and to specifically define a set of tabu restrictions and a set of aspiration criteria. During iterations, only the best solution visited is memorized as a tabu point in the search space and the distance from each trial solution to the tabu point is an important factor in the fitness evaluation. In population competition, the new fitness function plays the roles of the tabu restrictions and the aspiration criteria. Based on the new fitness function and a parallel evolutionary mechanism, the ETSA can prevent premature convergence and eventually find a good solution. Seven grayscale images are used to test the performance of the ETSA. Experimental results show that the ETSA performs better than several existing algorithms in terms of the distortion and robustness measures.