Codebook design algorithms based on tabu search (TS) approach are presented for vector quantization (VQ).The key questions of the tabu search are how to define a solution and how to generate neighboring solutions of the current solution.The two optimality criteria of codebook design are nearest neighbor condition and centroid condition

so two corresponding methods to generate new solutions that are called codebook-based tabu search (CB-TS) algorithm and partitioning-based tabu search (PB-TS) algorithm are presented respectively.In order to improve the performance of the tabu search algorithm

simulated annealing technique is introduced.In order to improve the codebook performance

the conventional LBG algorithm is introduced in each iteration of the tabu search algorithm.Tests show that the proposed two algorithms based on the tabu search approach can greatly improve the codebook performance compared to the conventional LBG algorithm.