An efficient nearest neighbor searching algorithm with application to LBG codebook gene ration

檔案

本條目沒有附加檔案。

日期

1996-11-01

作者

類型

期刊名稱

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS

卷期與頁次

第 19 卷第 6 期,頁 719–724

ISSN

0253-3839

語言

英文

摘要

The nearest neighbor (NN) searching problem has wide applications. In vector quantization (VQ), both the codebook generation phase and encoding phase (using the codebook just generated) often need to use the NN search. Improper design of the searching algorithm will make the complexity quite big as vector dimensionality k or codebook size N increases. In this paper, a fast NN searching method is proposed, which can then accelerate the LEG codebook generation process for VQ design. The method successfully modifies and improves the LAESA method. Unlike LAESA, the proposed k/2 ''fixed'' points (allocated far from the data) and the origin are used as the k/2+1 reference points to reduce the searching area. The overhead in memory is only linearly proportional to N and k. The time complexity, including the overhead, is of order O(kN). According to our experiments, the proposed algorithm can reduce the time burden while the distortion remains identical to that of the full search.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Wu, K., & Lin, J. (1996). An efficient nearest neighbor searching algorithm with application to LBG codebook gene ration. JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 19(6), 719–724. https://ir.lib.nycu.edu.tw/handle/11536/950

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/950