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

Chia Hung Yeh; Ren Fu Tseng; Mei Juan Chen; Chuan Yu Chang

doi:10.1017/ATSIP.2018.27

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

Chia Hung Yeh^*, Ren Fu Tseng, Mei Juan Chen, Chuan Yu Chang

^*Corresponding author for this work

Department of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	e1
Journal	APSIPA Transactions on Signal and Information Processing
Volume	8
DOIs	https://doi.org/10.1017/ATSIP.2018.27
Publication status	Published - 2019

Keywords

Game theory
High efficiency video coding
I-frame assignment
Intra-period
Nash bargaining solution

ASJC Scopus subject areas

Signal Processing
Information Systems

Access to Document

10.1017/ATSIP.2018.27

Cite this

@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 = "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",

}

TY - JOUR

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

AU - Yeh, Chia Hung

AU - Tseng, Ren Fu

AU - Chen, Mei Juan

AU - Chang, Chuan Yu

N1 - Publisher Copyright: © The Authors, 2019.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Game theory

KW - High efficiency video coding

KW - I-frame assignment

KW - Intra-period

KW - Nash bargaining solution

UR - http://www.scopus.com/inward/record.url?scp=85059624093&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059624093&partnerID=8YFLogxK

U2 - 10.1017/ATSIP.2018.27

DO - 10.1017/ATSIP.2018.27

M3 - Article

AN - SCOPUS:85059624093

SN - 2048-7703

VL - 8

JO - APSIPA Transactions on Signal and Information Processing

JF - APSIPA Transactions on Signal and Information Processing

M1 - e1

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this