@article{e832693871734aff90aaf2fafe272e09,
title = "Optimal I-frame assignment based on Nash bargaining solution in HEVC",
abstract = "In most of video coding standards such as high efficiency video coding (HEVC), I-frame assignment is periodic even when the content change is minor, which degrades the coding efficiency. This paper proposes an I-frame assignment method based on Nash bargaining solution (NBS) in game theory to solve this problem. The encoded sequence is divided into several subsequences. Each subsequence is regarded as a game. All group of picture (GOP) in a subsequence is further divided into several sets of GOP. Each set of GOP is regarded as a player and compete for the number of I-frames. The optimal I-frame assignment is determined based on the generalized NBS. Experimental results show the proposed method outperforms HEVC by 5.21% bitrate saving.",
keywords = "Game theory, High efficiency video coding, I-frame assignment, Intra-period, Nash bargaining solution",
author = "Yeh, {Chia Hung} and Tseng, {Ren Fu} and Chen, {Mei Juan} and Chang, {Chuan Yu}",
note = "Funding Information: The authorswould like to thank the Ministry of Science and Technology, Taiwan, R.O.C. for financially supporting this research under contract no. MOST 107-2218-E-003-003-, MOST 106-2221-E-110-083-MY2, and MOST 105-2221-E- 110-094-MY3. This work was financially supported by the {"}Intelligent Recognition Industry Service Center{"} from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan. Publisher Copyright: {\textcopyright} The Authors, 2019.",
year = "2019",
doi = "10.1017/ATSIP.2018.27",
language = "English",
volume = "8",
journal = "APSIPA Transactions on Signal and Information Processing",
issn = "2048-7703",
publisher = "Cambridge University Press",
}