What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search?
| Language | English |
|---|---|
| Type | Proceedings of International Conferences |
| Authors | Masakazu Iwamura, Tomokazu Sato, Koichi Kise |
| Title | What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? |
| Journal | Proc. 14th International Conference on Computer Vision (ICCV 2013) |
| Pages | pp.3535-3542 |
| Location | Sydney, Australia |
| Reviewed | Reviewed |
| Presentation type | Poster |
| Date | December 2013 |
| Research fields | Nearest Neighbor Search |
| DOI | 10.1109/ICCV.2013.439 |
| Key | Iwamura2013_ICCV (id=1357) |
Note
- C and P in Table 1 are typos for c and p, respectively.
- Experimental result of the following paper [a] that shows BDH was worse than IMI is theoretically wrong because BDH is a generalization of IMI and never gets worse than IMI.
[a] Heo, J.-P.; Lin, Z.; Shen, X.; Brandt, J. & Yoon, S.-E.
Shortlist Selection with Residual-Aware Distance Estimator for K-Nearest Neighbor Search
Proc. CVPR, IEEE, 2016, pp.2009-2017
Files
- …
Export this publication
Format definition
How to write the definition
Insert a field with braces like {authors}. A part enclosed in [ ... ] is omitted entirely when any field inside it is empty. Available fields:
{authors}{authors_and}{authors_ja}{authors_ja_tight}{authors_en}{authors_en_and}{authors_tight}{first_author}{title}{title_ja}{title_en}{journal}{journal_ja}{journal_en}{book_title}{volume}{number}{series}{presen_id}{pages}{pp}{num_pages}{year}{month}{month_en}{month_short}{ym}{date}{date_ja}{date_en}{publisher}{address}{location}{review}{review_ja}{review_en}{reviewed_mark}{presen_type}{type}{type_label}{doi}{url}{key}{awards}