Tabu Search for Codebook Design

1. Tabu Search for Codebook Design An evolution-based tabu search approach to codebook design Pattern Recognition, 2006 Shih-Ming Pan, Kuo-Sheng Cheng

2. Glover(1986) 1. Proposed the tabu search to solve the combinational optimization. 2. Use tabu memory to record the previously search result. Six steps of tabu search • Initialization • A set of moves (neighboring solution) • A memory of a certain size • Tabu restriction rule • A set of aspiration rule • Stop criterion Tabu memory

5. Codebook generation (Franti, pattern recognition, 1998) • Initial solution: K-mean algorithm • Neighboring solution: use swap the closest training vector to replace the codeword of cluster • Tabu memory is determined empirically • Tabu restriction is defined by “oldest solution is removed. • No aspiration rule. • Stopping criterion, N iteration • Disadvantage: Single initial solution

6. Generating Parent Population Pp Best solution population Ibest Tabu memory asexual reproduction Sexual reproduction update Par Offspring generation I’ Psr I’’ Ioi

7. Normal Defective Ibest Number = 2p Tabu distance Evolution/ Degeneration Number = p Ioi Compute Tabu Distance Compute Distortion competition Fitness Evaluation foi

8. Evolution-based tabu search

15. competition

19. Evolution-based tabu search