Fast and Memory Saving Instance Search with Approximate Reverse Nearest Neighbor Search Using Reverse Lookup
| 言語 | 英語 |
|---|---|
| 種類 | 国際会議等の予稿 |
| 著者 | Tomokazu Sato,Masakazu Iwamura,Kitahiro Kaneda,Koichi Kise |
| 論文名 | Fast and Memory Saving Instance Search with Approximate Reverse Nearest Neighbor Search Using Reverse Lookup |
| 論文誌名 | Proc. Second IEEE International Conference on Multimedia Big Data (BigMM2016) |
| ページ | pp.326-333 |
| 発表場所 | Taipei, Taiwan |
| 査読の有無 | 有 |
| 発表の種類 | 口頭発表 |
| 年月 | 2016年4月 |
| 分野 | 最近傍探索 |
| DOI | 10.1109/BigMM.2016.76 |
| キー | Sato2016 (id=1505) |
要約
Recently more and more videos have been shared through the websites such as youtube.com. In order to utilize them efficiently, instance search (INS) techniques which find a specific person, object and place from a video database without metadata has been desired. It is known that the BM25 scoring method is a powerful tool for the INS task. It is, however, also known that it requires a time consuming process. It has been pointed out that the time consuming process is equivalent to the bichromatic reverse nearest neighbor (BRNN) search problem and a method to approximate it has been proposed. However, the algorithm needs a huge reference table which causes large memory usage and computational complexity. In this paper, we propose a more efficient way to search BRNNs using a reverse lookup structure. An experimental result using the database of TRECVID 2012 INS task showed that the proposed method was 2.8 times faster with 10% less memory usage than the conventional method.
この文献を出力
書式の定義
書式の定義の書き方
{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}