Japanese / English


論文の言語 英語
著者 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
年月 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.