{"links":{},"id":222794,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00222794","sets":["1164:2735:10865:11051"]},"path":["11051"],"owner":"44499","recid":"222794","title":["制約最適化に基づく画像の時間順並び替え"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-12-05"},"_buckets":{"deposit":"ffe1c180-45f2-49d3-b8c6-22eb6101476b"},"_deposit":{"id":"222794","pid":{"type":"depid","value":"222794","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"制約最適化に基づく画像の時間順並び替え","author_link":["584972","584971","584970"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"制約最適化に基づく画像の時間順並び替え"}]},"item_type_id":"4","publish_date":"2022-12-05","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":"UEC","subitem_text_language":"en"},{"subitem_text_value":"UEC","subitem_text_language":"en"},{"subitem_text_value":"UEC","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/222794/files/IPSJ-MPS22141012.pdf","label":"IPSJ-MPS22141012.pdf"},"date":[{"dateType":"Available","dateValue":"2024-12-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS22141012.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a81ace56-70aa-486f-978c-89d5d9900efa","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"久保, 拓巳"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"戸田, 貴久"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"古賀, 久志"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"画像群をデータとして扱いやすくするため，同じ場所で撮影した画像を計算機を用いて時間順に並び替えることを考える．従来研究では特徴点を手動で定めて各画像に定めた点が写っているかを調べ，制約充足問題 (CSP) として定式化を行うことで並び替えを行っていた．従来手法では特徴点の検出および存在判定を手動で行う必要があり，枚数が多くなるとこの手法で並び替えをするのは現実的に実現困難となる．本研究では，従来手法では手動で行われた特徴点の検出と画像における存在判定を特徴点マッチングを用いて自動的に行う．またその結果を用いて最適化を行うことで並び替えを効率的に行う．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-12-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"2022-MPS-141"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:22:43.889139+00:00","updated":"2025-01-19T13:36:53.407878+00:00"}