{"created":"2025-01-18T22:51:29.925666+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018885","sets":["1164:1165:1174:1175"]},"path":["1175"],"owner":"1","recid":"18885","title":["動的計画法を用いた類似画像検索における検索効率の向上"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-07-13"},"_buckets":{"deposit":"6c2d3e64-e2b6-4574-8df9-054b2d687b2d"},"_deposit":{"id":"18885","pid":{"type":"depid","value":"18885","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"動的計画法を用いた類似画像検索における検索効率の向上","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"動的計画法を用いた類似画像検索における検索効率の向上"},{"subitem_title":"Improvement of Efficiency in Image Retrieval using Dynamic Programming","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2006-07-13","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"愛媛大学大学院理工学研究科"},{"subitem_text_value":"愛媛大学大学院理工学研究科"},{"subitem_text_value":"愛媛大学総合情報メディアセンター"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Engineering, Ehime University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Science and Engineering, Ehime University","subitem_text_language":"en"},{"subitem_text_value":"Center for Information Technology, Ehime university","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/18885/files/IPSJ-DBS06140032.pdf"},"date":[{"dateType":"Available","dateValue":"2008-07-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS06140032.pdf","filesize":[{"value":"512.9 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e9a5e7d2-8b1d-4815-b8b9-832a6428fd70","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"濱岡, 圭"},{"creatorName":"上田, 和章"},{"creatorName":"中川, 祐治"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kei, HAMAOKA","creatorNameLang":"en"},{"creatorName":"Kazuaki, UEDA","creatorNameLang":"en"},{"creatorName":"Yuji, NAKAGAWA","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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":"問合せ画像を検索キーとして類似した画像を画像データベースから検索するとき，登録画像数が増加するに従って検索時間は膨大なものとなってしまう．その解決案として，初めに計算量の少ない荒い検索を行うことで候補画像を絞り込み，さらに細かい検索を行う二段階の絞り込みによる画像検索が考えられる．本研究では細かい検索を実現するための一手法として，画像間で対応するエッジの類似性に着目し動的計画法により対応付けを行い，その際，求められた最適経路の直線性を評価することで類似度を求める手法を開発した．さらに世襲境界の概念を導入することで，検索効率が向上した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In present day, the more we register lots of images in the database, the more it takes processing time to find the image similar to the query image in the database. As a solution, we perform the perfunctory search, and then we perform detail search. This paper presents the detail search method using dynamic programming, straightness of optimum path and the concept of hereditary boundary. As a result, we can improve of efficienncy in image retrieval.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"22","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"2006-07-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"78(2006-DBS-140)","bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"links":{},"id":18885,"updated":"2025-01-22T22:28:50.974873+00:00"}