What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search?
| 言語 | 英語 |
|---|---|
| 種類 | 国際会議等の予稿 |
| 著者 | Masakazu Iwamura，Tomokazu Sato，Koichi Kise |
| 論文名 | What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? |
| 論文誌名 | Proc. 14th International Conference on Computer Vision (ICCV 2013) |
| ページ | pp.3535-3542 |
| 発表場所 | Sydney, Australia |
| 査読の有無 | 有 |
| 発表の種類 | ポスター発表 |
| 年月 | 2013年12月 |
| 分野 | 最近傍探索 |
| DOI | 10.1109/ICCV.2013.439 |
| キー | Iwamura2013_ICCV (id=1357) |
注記
- 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
関連ファイル
- …
この文献を出力
書式の定義
書式の定義の書き方
{authors} のように波括弧でフィールドを挿入します．[ ... ] で囲んだ部分は，その中のフィールドが空のとき丸ごと省略されます．使えるフィールド：
{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}