{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00080796","sets":["1164:3925:6698:6699"]},"path":["6699"],"owner":"10","recid":"80796","title":["kd-treeにより構造化された大規模高次元ベクトル群に対するGPUを用いた高速最近傍探索法の検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-02-22"},"_buckets":{"deposit":"b413bc69-6643-4d20-9e04-bd602954e0d6"},"_deposit":{"id":"80796","pid":{"type":"depid","value":"80796","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"kd-treeにより構造化された大規模高次元ベクトル群に対するGPUを用いた高速最近傍探索法の検討","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"kd-treeにより構造化された大規模高次元ベクトル群に対するGPUを用いた高速最近傍探索法の検討"},{"subitem_title":"Nearest Neighbor Search using GPU for Massive and High-dimensional Vectors Structured by kd-tree","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ミドルウェア","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2012-02-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTサイバースペース研究所"},{"subitem_text_value":"NTTサイバースペース研究所"},{"subitem_text_value":"NTTサイバースペース研究所"},{"subitem_text_value":"NTTサイバースペース研究所"},{"subitem_text_value":"NTTサイバースペース研究所"},{"subitem_text_value":"NTTサイバースペース研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Cyber Space Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Space Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Space Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Space Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Space Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Space Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/80796/files/IPSJ-CSEC12056024.pdf"},"date":[{"dateType":"Available","dateValue":"2014-02-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC12056024.pdf","filesize":[{"value":"874.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"30"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0e01685e-f94f-43af-b6ca-127cf0805a08","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松村, 聖司"},{"creatorName":"毛受, 崇"},{"creatorName":"赤間, 浩樹"},{"creatorName":"松尾, 嘉典"},{"creatorName":"奥村, 昌和"},{"creatorName":"山室, 雅司"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Seiji, Matsumura","creatorNameLang":"en"},{"creatorName":"Takashi, Menjo","creatorNameLang":"en"},{"creatorName":"Hiroki, Akama","creatorNameLang":"en"},{"creatorName":"Yoshinori, Matsuo","creatorNameLang":"en"},{"creatorName":"Masakazu, Okumura","creatorNameLang":"en"},{"creatorName":"Masashi, Yamamuro","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"局所特徴量を用いた物体認識処理での高次元ベクトル群の最近傍探索処理において，ベクトル間のユークリッド距離計算が行われている．データベース中のベクトル数が大規模になると，最近傍探索の処理時間は膨大になる．本検討では，kd-tree によるデータ構造化と GPU でのユークリッド距離計算の並列化を用いることで，探索精度の低下を抑えた最近傍探索処理高速化の手法を提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"When the total number of local characteristic high-dimensional vectors in object recognition becomes massive, it takes long time to process nearest neighbor search. In this study, we propose a method that makes nearest neighbor search fast with kd-tree structure and GPUs. Moreover, our method reduces deterioration of an accuracy of approximate nearest neighbor search.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2012-02-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"24","bibliographicVolumeNumber":"2012-CSEC-56"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":80796,"updated":"2025-01-21T19:39:06.163055+00:00","links":{},"created":"2025-01-18T23:35:09.890662+00:00"}