{"id":216502,"updated":"2025-01-19T15:50:06.055836+00:00","links":{},"created":"2025-01-19T01:17:04.734305+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216502","sets":["1164:3616:10863:10864"]},"path":["10864"],"owner":"44499","recid":"216502","title":["電子透かしを用いた学習済みモデルの世代管理に関する一検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-18"},"_buckets":{"deposit":"440b3a5f-39b5-40a2-8766-58339cd6d12b"},"_deposit":{"id":"216502","pid":{"type":"depid","value":"216502","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"電子透かしを用いた学習済みモデルの世代管理に関する一検討","author_link":["558891","558890"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"電子透かしを用いた学習済みモデルの世代管理に関する一検討"}]},"item_type_id":"4","publish_date":"2022-02-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪工業大学"},{"subitem_text_value":"大阪工業大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Osaka Institute of Technology","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/216502/files/IPSJ-AVM22116003.pdf","label":"IPSJ-AVM22116003.pdf"},"date":[{"dateType":"Available","dateValue":"2024-02-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AVM22116003.pdf","filesize":[{"value":"679.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":"27"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1f83f5b2-6558-47e4-a0fa-f644ea090b5b","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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10438399","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-8582","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"DNN（ディープニューラルネットワーク）の需要が拡大している．この DNN の需要の拡大に応えるにはモデルを初期状態から構築するのではなく，既存の学習済みモデルから個別の案件に調整した派生モデルを生成することが効率的である．DNN モデルの権利管理においては，これらの派生モデルに対応可能な電子透かしの技術が必要である．しかし，現時点での研究動向は違法な利用者による不正利用への対策が主であり，正当な利用者による派生モデルの世代管理等の二次利用に適した電子透かし技術は未検討である．そこで本論文では，初期検討として，学習済みの親世代のモデルに子世代の情報を追加的に埋め込む実験的検証を行ったので報告する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告オーディオビジュアル複合情報処理（AVM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2022-AVM-116"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}