{"updated":"2025-01-21T00:58:16.214715+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00128372","sets":["6504:8089:8095"]},"path":["8095"],"owner":"1","recid":"128372","title":["接続行列を用いた重なり図形の構造解析法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1995-09-20"},"_buckets":{"deposit":"d1390f91-f58f-44f0-b95c-196ec22d7a0f"},"_deposit":{"id":"128372","pid":{"type":"depid","value":"128372","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"接続行列を用いた重なり図形の構造解析法","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"接続行列を用いた重なり図形の構造解析法"},{"subitem_title":"Analysis on the structure of overlapping figures by using incidence matrix","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1995-09-20","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTヒューマンインタフェース研究所"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Human Interface Laboratories","subitem_text_language":"en"}]},"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/128372/files/KJ00001334646.pdf"},"date":[{"dateType":"Available","dateValue":"1995-09-20"}],"format":"application/pdf","filename":"KJ00001334646.pdf","filesize":[{"value":"151.9 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"1840702d-1262-4b42-82c3-e7bea4682497","displaytype":"detail","licensetype":"license_note"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"これまで抽象的な重なり図形から,人間にとって自然な少数の解釈を自動生成する手法は提案されていなかった.筆者は,先に,これを可能にするための手法を提案してきた.隠れた図形の線を補完して解釈する可能性があるような,複雑な重なり図形を計算機で自動識別する場合には,対象図形において,補完により1つの図形が分節されるごとに,残りの図形でさらなる補完が必要か否かを判断する必要がある.例えば,図1(1)において,まず(2)に示す補完が行われたとする.この段階で補完を終了すべきか,さらに(3)のように補完を続けるかを判断するには,(2)の時点で交点を解放し,その図形が連結図形であるか否かを判断し,(4)のように連結図形であれば,(3)で示すようにさらなる補完を検討する必要がある.このプロセスを自動解析する手法は,今まで提案されていない.本論文では,線素・交点の接続行列により重なり図形の構造を記述した後,補完が行われるごとに,その補完によって結ばれる交点の種類(T型交点,X型交点等)で場合分けして接続行列を縮退させることによって,このプロセスを自動的に行う方法を示す.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"196","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"195","bibliographicIssueDates":{"bibliographicIssueDate":"1995-09-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"メディア情報処理","bibliographicVolumeNumber":"第51回"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-19T00:07:44.725453+00:00","id":128372,"links":{}}