文献の詳細

論文の言語	英語
著者	Masakazu Iwamura, Tomohiro Nakai, and Koichi Kise
論文名	Improvement of Retrieval Speed and Required Amount of Memory for Geometric Hashing by Combining Local Invariants
論文誌名	Proc. 18th British Machine Vision Conference (BMVC2007)
Vol.	2
ページ	pp.1010-1019
発表場所	Warwick, UK
査読の有無	有
年月	2007年9月
要約	The geometric hashing (GH) is a well-known model-based object recognition technique with good properties both in retrieval speed and required amount of memory. However, it has a significant weak point; as the number of objects increases, both retrieval speed and required amount of memory increase in the cubic, fourth or higher order. Recently, a new technique ``locally likely arrangement hashing (LLAH)'' whose computational cost is a linear order has been proposed. The objective of the current paper is to reveal how LLAH improves the performance. By comparing GH and LLAH, we describe four primary factors of the performance improvement.

• 次のファイルが利用可能です．
1. paper.pdf (552.4KB)
• BibTeX用エントリー

  @InProceedings{Iwamura2007,
    author =	{Masakazu Iwamura and Tomohiro Nakai and Koichi Kise},
    title =	{Improvement of Retrieval Speed and Required Amount of Memory for Geometric Hashing by Combining Local Invariants},
    booktitle =	{Proc. 18th British Machine Vision Conference (BMVC2007)},
    year =	2007,
    month =	sep,
    volume =	{2},
    pages =	{1010--1019},
    location =	{Warwick, UK}
  }
  
  
  

一覧に戻る