- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Automatic Translation feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Simplified Anchor Point Method for Fast Nearest Neighbor Search Algorithm
-
- YAMADA Yoshio
- Ehime University, Faculty of Engineering
-
- ISHIDA Mitsunobu
- Ehime University, Faculty of Engineering
-
- TSUZUKI Shinji
- Ehime University, Faculty of Engineering
-
- TAZAKI Saburo
- Ehime University, Faculty of Engineering
Bibliographic Information
- Other Title
-
- 単純化アンカｰポイント法による最近傍探索アルゴリズム
Search this article
Description
Huang et al. proposed a fast nearest algorithm in which, based on the triangle inequality, candidate codewords are examined using inter-codeword distance table. Their method requires a large distance table propotional to N(N-1)/2, where N denotes codebook size. Ramasubramanian et al. proposed the anchor point method that improves the memory complexity of Huang's method. This paper propose a simplified anchor point method in order to reduce the overhead of candidate selection, thus computational complexity, in Ramasubramanian's anchor point method.
Journal
-
- IEICE technical report. Circuits and systems
-
IEICE technical report. Circuits and systems 96 (476), 71-76, 1997-01-24
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1571698602307547392
-
- NII Article ID
- 110003197943
-
- NII Book ID
- AN10013094
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
