A tabu search based maximum descent algorithm for VQ codebook design
檔案
- 000171597200003.pdf (105.8 KB, Adobe PDF)
日期
2001-09-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
卷期與頁次
第 17 卷第 5 期,頁 753–762
ISSN
1016-2364
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
Huang, H., Chu, S., Pan, J., & Lu, Z. (2001). A tabu search based maximum descent algorithm for VQ codebook design. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 17(5), 753–762. https://ir.lib.nycu.edu.tw/handle/11536/29425
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29425