{"updated":"2025-01-21T20:45:22.910841+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00077882","sets":["6164:6165:6543:6544:6550"]},"path":["6550"],"owner":"10","recid":"77882","title":["高速かつメモリ消費量の少ない局所特徴量"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-10-01"},"_buckets":{"deposit":"dd55f838-94cc-4fdb-bca5-bb594302b980"},"_deposit":{"id":"77882","pid":{"type":"depid","value":"77882","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"高速かつメモリ消費量の少ない局所特徴量","author_link":["0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"高速かつメモリ消費量の少ない局所特徴量"}]},"item_type_id":"18","publish_date":"2011-10-01","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社デンソーアイティーラボラトリ"},{"subitem_text_value":"株式会社デンソーアイティーラボラトリ"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/77882/files/IPSJ-MIRU2011242.pdf"},"date":[{"dateType":"Available","dateValue":"2013-10-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MIRU2011242.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f428ab5c-b09a-47bb-96e1-9d08dc61aa02","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"安倍満"},{"creatorName":"吉田悠一"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，高速に計算可能であり，128ビット程度のバイナリコードで表現可能な局所特徴量Compact And Real-time Descriptors(CARD)を提案する．CARDはSIFTやGLOHと同様に，勾配ヒストグラム特徴量の一種である．提案手法は，(1) ルックアップテーブルによる高速な局所特徴量抽出，(2) Supervised Sparse Hashing(SSH)による高速なバイナリコード化の2段階から成る．本手法では，2種類のルックアップテーブルを用いることで，1つのキーポイントあたりSIFTの約16倍の速度で局所特徴量を計算可能とした．また，抽出された特徴量をハッシュ関数によりバイナリコードに変換することで，メモリ消費量を低減した．ここで用いるハッシュ関数は疎行列の掛け算により構成されているため，高速にバイナリコードへ変換が可能である．実験により，CARDは実行速度，メモリ消費量の二つの点において，既存の手法よりも優れていることを示した．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1689","bibliographic_titles":[{"bibliographic_title":"画像の認識・理解シンポジウム(MIRU2011)論文集"}],"bibliographicPageStart":"1682","bibliographicIssueDates":{"bibliographicIssueDate":"2011-07-20","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:33:22.473355+00:00","id":77882,"links":{}}