文献の詳細
| 論文の言語 | 英語 |
|---|---|
| 著者 | Katsufumi Inoue,Koichi Kise |
| 論文名 | Compressed Representation of Feature Vectors Using a Bloomier Filter and Its Application to Specific Object Recognition |
| 論文誌名 | Proceedings of the 1st International Workshop on Emergent Issues in Large Amount of Visual Data (WS-LAVD2009) |
| ページ | pp.2133-2140 |
| 査読の有無 | 有 |
| 年月 | 2009年10月 |
| 要約 | Nearest Neighbor search of feature vectors representing local features is often employed for specific object recognition. In such a method, it is required to store many feature vectors to match them by distance calculation. The number of feature vectors is, in general, so large that a huge amount of memory is needed for their storage. A way to solve this problem is to skip the distance calculation because no feature vectors need to be stored if there is no need to calculate the distance. In this paper, we propose a method of object recognition without distance calculation. The characteristic point of the proposed method is to use a Bloomier filter, which is far memory efficient than hash tables, for storage and matching of feature vectors. From experiments of planar and 3D specific object recognition, the proposed method is evaluated in comparison to a method with a hash table. |
- 次のファイルが利用可能です．
- BibTeX用エントリー
@InProceedings{Inoue2009, author = {Katsufumi Inoue and Koichi Kise}, title = {Compressed Representation of Feature Vectors Using a Bloomier Filter and Its Application to Specific Object Recognition}, booktitle = {Proceedings of the 1st International Workshop on Emergent Issues in Large Amount of Visual Data (WS-LAVD2009)}, year = 2009, month = oct, pages = {2133--2140} }