{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216509","sets":["1164:3616:10863:10864"]},"path":["10864"],"owner":"44499","recid":"216509","title":["緩和最適輸送問題のためのブロック座標Frank-Wolfeアルゴリズムの拡張手法と画像処理への応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-18"},"_buckets":{"deposit":"15cf5770-96db-4040-b88a-a81d8d5a042a"},"_deposit":{"id":"216509","pid":{"type":"depid","value":"216509","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"緩和最適輸送問題のためのブロック座標Frank-Wolfeアルゴリズムの拡張手法と画像処理への応用","author_link":["558912","558913"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"緩和最適輸送問題のためのブロック座標Frank-Wolfeアルゴリズムの拡張手法と画像処理への応用"}]},"item_type_id":"4","publish_date":"2022-02-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science and Communications Engineering, Graduate School of Fundamental Science and Engineering, Waseda University"},{"subitem_text_value":"Department of Computer Science and Communications Engineering, Graduate School of Fundamental Science and Engineering, Waseda University／Department of Communications and Computer Engineering, School of Fundamental Science and Engineering, Waseda University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science and Communications Engineering, Graduate School of Fundamental Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Communications Engineering, Graduate School of Fundamental Science and Engineering, Waseda University / Department of Communications and Computer Engineering, School of Fundamental Science and Engineering, Waseda University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/216509/files/IPSJ-AVM22116010.pdf","label":"IPSJ-AVM22116010.pdf"},"date":[{"dateType":"Available","dateValue":"2024-02-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AVM22116010.pdf","filesize":[{"value":"650.8 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":"abb72a83-5796-4804-a22e-bcb241343e47","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":"確率分布間の距離を表現可能な最適輸送問題は幅広い分野で注目されている．最適輸送問題は厳密な質量保存を表す制約条件を有する線形計画問題で定式化されるが，一般に線形計画問題を高速に解くことは難しい．当該問題の解決のため，制約条件を緩めた緩和最適輸送問題が提案されており，高速化の実現と応用分野への有効性が確認されている．以前発表した研究では，その緩和問題のうち凸緩和最適輸送問題に注目し，Frank-Wolfe アルゴリズムに基づいた高速最適化手法を提案した．しかし，Frank-Wolfe (FW) アルゴリズムは劣線形性で収束するため，その収束速度は依然遅い．本稿では，Frank-Wolfe アルゴリズムの改良手法である，ギャップサンプリングを考慮したブロック座標 Frank-Wolfe (BCFW-GA) アルゴリズムを提案し，そのアルゴリズムの計算量と最悪収束反復数を示す．数値実験から，改良手法と画像処理に対する凸緩和最適輸送問題の有効性を議論する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告オーディオビジュアル複合情報処理（AVM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2022-AVM-116"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":216509,"updated":"2025-01-19T15:49:55.586253+00:00","links":{},"created":"2025-01-19T01:17:05.132975+00:00"}