Improvement of Retrieval Speed and Required Amount of Memory for Geometric Hashing by Combining Local Invariants

言語英語
種類国際会議等の予稿
著者Masakazu Iwamura,Tomohiro Nakai,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月
分野文書画像解析, 文書画像検索
キーIwamura2007_BMVC (id=978)

要約

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 行目が既定,種類別に変えるには「book: …」のような行を追加
書式の定義の書き方

{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}

← 一覧に戻る