JISE

[1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Information Science and Engineering, Vol. 17 No. 5, pp. 753-762

A Tabu Search Based Maximum Descent Algorithm for VQ Codebook Design

Hsiang-Cheh Huang, Shu-Chuan Chu^*, Jeng-Shyang Pan^**
and Zhe-Ming Lu^*** Department of Electronics Engineering
National Chiao Tung University
Hsinchu, 300 Taiwan
^*School of Informatics and Engineering
Flinders University of South Australia
Australia
^**Department of Electronic Engineering
National Kaohsiung Institute of Technology
Kaohsiung, 807 Taiwan
E-mail: jspan@cc.nkit.edu.tw
^***Department of Automatic Test and Control
Harbin Institute of Technology
Harbin, China

A maximum descent (MD) method has been proposed for vector quantization (VQ) codebook design. Compared with the traditional generalized Lloyd algorithm (GLA), the MD algorithm achieves better codebook performance with far less computation time. However, searching for the optimal partitioning hyperplane of a multidimensional cluster is a difficult problem in the MD algorithm. Three partition techniques have been proposed for the MD method in the literature. In this paper, a new partition technique based on the tabu search (TS) approach is presented for the MD algorithm. Experimental results show that the tabu search based MD algorithm can produce a better codebook than can the conventional MD algorithms.

Keywords: VQ, codebook design, maximum descent method, tabu search, GLA

Retrieve PDF document (JISE_200105_03.pdf)