APSIPA Transactions on Signal and Information Processing > Vol 8 > Issue 1

Optimal I-frame assignment based on Nash bargaining solution in HEVC

Chia-Hung Yeh, National Taiwan Normal University, Taiwan, chyeh@ntnu.edu.tw , Ren-Fu Tseng, National Sun Yat-sen University, Taiwan, Mei-Juan Chen, National Dong Hwa University, Taiwan, Chuan-Yu Chang, National Yunlin University of Science & Technology, Taiwan
 
Suggested Citation
Chia-Hung Yeh, Ren-Fu Tseng, Mei-Juan Chen and Chuan-Yu Chang (2019), "Optimal I-frame assignment based on Nash bargaining solution in HEVC", APSIPA Transactions on Signal and Information Processing: Vol. 8: No. 1, e1. http://dx.doi.org/10.1017/ATSIP.2018.27

Publication Date: 04 Jan 2019
© 2019 Chia-Hung Yeh, Ren-Fu Tseng, Mei-Juan Chen and Chuan-Yu Chang
 
Subjects
 
Keywords
High efficiency video codingGame theoryNash bargaining solutionIntra-periodI-frame assignment
 

Share

Open Access

This is published under the terms of the Creative Commons Attribution licence.

Downloaded: 559 times

In this article:
I. INTRODUCTION 
II. PROPOSED GAME THEORY BASED I-FRAME ASSIGNMENT METHOD 
III. EXPERIMENTAL RESULTS 
IV. CONCLUSION 

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.

DOI:10.1017/ATSIP.2018.27