{"created":"2024-11-22T07:39:33.294999+00:00","id":2008736,"links":{},"metadata":{"_buckets":{"deposit":"7db9e6d2-7371-483b-92a6-8509910bfb3b"},"_deposit":{"created_by":7,"id":"2008736","owners":[7],"pid":{"revision_id":0,"type":"depid","value":"2008736"},"status":"published"},"_oai":{"id":"oai:tokushima-u.repo.nii.ac.jp:02008736","sets":["1713853213384:1713853295607"]},"author_link":["976","1231"],"control_number":"2008736","item_10001_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2020-01-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageStart":"113","bibliographicVolumeNumber":"12","bibliographic_titles":[{"bibliographic_title":"Symmetry","bibliographic_titleLang":"en"}]}]},"item_10001_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Symmetry considerations play a key role in modern science, and any differentiable symmetry of the action of a physical system has a corresponding conservation law. Symmetry may be regarded as reduction of Entropy. This work focuses on reducing the computational complexity of modern video coding standards by using the maximum entropy principle. The high computational complexity of the coding unit (CU) size decision in modern video coding standards is a critical challenge for real-time applications. This problem is solved in a novel approach considering CU termination, skip, and normal decisions as three-class making problems. The maximum entropy model (MEM) is formulated to the CU size decision problem, which can optimize the conditional entropy; the improved iterative scaling (IIS) algorithm is used to solve this optimization problem. The classification features consist of the spatio-temporal information of the CU, including the rate–distortion (RD) cost, coded block flag (CBF), and depth. For the case analysis, the proposed method is based on High Efficiency Video Coding (H.265/HEVC) standards. The experimental results demonstrate that the proposed method can reduce the computational complexity of the H.265/HEVC encoder significantly. Compared with the H.265/HEVC reference model, the proposed method can reduce the average encoding time by 53.27% and 56.36% under low delay and random access configurations, while Bjontegaard Delta Bit Rates (BD-BRs) are 0.72% and 0.93% on average.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10001_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"MDPI","subitem_publisher_language":"en"}]},"item_10001_rights_15":{"attribute_name":"権利情報","attribute_value_mlt":[{"subitem_rights":"This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).","subitem_rights_language":"en"}]},"item_10001_source_id_9":{"attribute_name":"収録物ID","attribute_value_mlt":[{"subitem_source_identifier":"20738994","subitem_source_identifier_type":"ISSN"}]},"item_10001_version_type_20":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_1715043197608":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access"}]},"item_1722929371688":{"attribute_name":"出版社版DOI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_language":"ja","subitem_relation_name_text":"10.3390/SYM12010113"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.3390/SYM12010113","subitem_relation_type_select":"DOI"}}]},"item_1723180141928":{"attribute_name":"EID","attribute_value_mlt":[{"subitem_identifier_type":"URI","subitem_identifier_uri":"362654"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Jiang, Xiantao","creatorNameLang":"en"}]},{"creatorAffiliations":[{"affiliationNameIdentifiers":[{"affiliationNameIdentifier":"","affiliationNameIdentifierScheme":"ISNI","affiliationNameIdentifierURI":"http://www.isni.org/isni/"}],"affiliationNames":[{"affiliationName":"","affiliationNameLang":"ja"}]}],"creatorNames":[{"creatorName":"宋, 天","creatorNameLang":"ja"},{"creatorName":"ソウ, テン","creatorNameLang":"ja-Kana"},{"creatorName":"Song, Tian","creatorNameLang":"en"}],"familyNames":[{"familyName":"宋","familyNameLang":"ja"},{"familyName":"ソウ","familyNameLang":"ja-Kana"},{"familyName":"Song","familyNameLang":"en"}],"givenNames":[{"givenName":"天","givenNameLang":"ja"},{"givenName":"テン","givenNameLang":"ja-Kana"},{"givenName":"Tian","givenNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"1231","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"79439/profile-ja.html","nameIdentifierScheme":"徳島大学 教育研究者総覧","nameIdentifierURI":"http://pub2.db.tokushima-u.ac.jp/ERD/person/79439/profile-ja.html"},{"nameIdentifier":"10380130","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/ja/search/?qm=10380130"}]},{"creatorAffiliations":[{"affiliationNameIdentifiers":[{"affiliationNameIdentifier":"","affiliationNameIdentifierScheme":"ISNI","affiliationNameIdentifierURI":"http://www.isni.org/isni/"}],"affiliationNames":[{"affiliationName":"","affiliationNameLang":"ja"}]}],"creatorNames":[{"creatorName":"片山, 貴文","creatorNameLang":"ja"},{"creatorName":"カタヤマ, タカフミ","creatorNameLang":"ja-Kana"},{"creatorName":"Katayama, Takafumi","creatorNameLang":"en"}],"familyNames":[{"familyName":"片山","familyNameLang":"ja"},{"familyName":"カタヤマ","familyNameLang":"ja-Kana"},{"familyName":"Katayama","familyNameLang":"en"}],"givenNames":[{"givenName":"貴文","givenNameLang":"ja"},{"givenName":"タカフミ","givenNameLang":"ja-Kana"},{"givenName":"Takafumi","givenNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"976","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"350321/profile-ja.html","nameIdentifierScheme":"徳島大学 教育研究者総覧","nameIdentifierURI":"http://pub2.db.tokushima-u.ac.jp/ERD/person/350321/profile-ja.html"},{"nameIdentifier":"70848522","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/ja/search/?qm=70848522"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2021-05-21"}],"displaytype":"detail","filename":"sym_12_1_113.pdf","filesize":[{"value":"544 KB"}],"format":"application/pdf","licensetype":"license_0","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://tokushima-u.repo.nii.ac.jp/record/2008736/files/sym_12_1_113.pdf"},"version_id":"bac40908-e7ea-4033-b650-999cd593b481"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"modern video coding standards","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"maximum entropy","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"inter-prediction","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"complexity reduction","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Maximum-Entropy-Model-Enabled Complexity Reduction Algorithm in Modern Video Coding Standards","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Maximum-Entropy-Model-Enabled Complexity Reduction Algorithm in Modern Video Coding Standards","subitem_title_language":"en"}]},"item_type_id":"40001","owner":"7","path":["1713853295607"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2021-05-21"},"publish_date":"2021-05-21","publish_status":"0","recid":"2008736","relation_version_is_last":true,"title":["Maximum-Entropy-Model-Enabled Complexity Reduction Algorithm in Modern Video Coding Standards"],"weko_creator_id":"7","weko_shared_id":-1},"updated":"2025-04-28T05:09:18.652775+00:00"}