An improvement of fast search algorithm for vector quantization

Ming Chieh Chung, Shung Chih Chen, Chao Tang Yu, Pei-Yin Chen

研究成果: Conference contribution

6 引文 斯高帕斯(Scopus)

摘要

One of the major issues of vector quantization encoding is to reduce the computational complexity from searching the best-matched codevector, so as to shorten the search time. In this paper, we extended the partial-sum algorithm to exclude much more codevectors from doing the complex Euclidean distance computation. An optimal trade-off has been found between the computational complexity and the search space. According to the experimental results, our algorithms can significantly reduce the number of redundant codevectors, which do not need to do the distance computation, while obtaining the same encoding quality as that of full search algorithm.

原文English
主出版物標題Proceedings of 2005 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2005
頁面97-100
頁數4
出版狀態Published - 2005 十二月 1
事件2005 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2005 - Hong Kong, China
持續時間: 2005 十二月 132005 十二月 16

出版系列

名字Proceedings of 2005 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2005
2005

Other

Other2005 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2005
國家/地區China
城市Hong Kong
期間05-12-1305-12-16

All Science Journal Classification (ASJC) codes

  • 工程 (全部)

指紋

深入研究「An improvement of fast search algorithm for vector quantization」主題。共同形成了獨特的指紋。

引用此