Generalized nash bargaining solution to rate control optimization for spatial scalable video coding

Xu WANG, Sam KWONG, Long XU, Yun ZHANG

Research output: Journal PublicationsJournal Article (refereed)peer-review

19 Citations (Scopus)

Abstract

Rate control (RC) optimization is indispensable for scalable video coding (SVC) with respect to bitstream storage and video streaming usage. From the perspective of centralized resource allocation optimization, the inner-layer bit allocation problem is similar to the bargaining problem. Therefore, bargaining game theory can be employed to improve the RC performance for spatial SVC. In this paper, we propose a bargaining game-based one-pass RC scheme for spatial H.264/SVC. In each spatial layer, the encoding constraints, such as bit rates, buffer size are jointly modeled as resources in the inner-layer bit allocation bargaining game. The modified rate-distortion model incorporated with the inter-layer coding information is investigated. Then, the generalized nash bargaining solution (NBS) is employed to achieve an optimal bit allocation solution. The bandwidth is allocated to the frames from the generalized NBS adaptively based on their own bargaining powers. Experimental results demonstrate that the proposed RC algorithm achieves appealing image quality improvement and buffer smoothness. The average mismatch of our proposed algorithm is within the range of 0.19%-2.63%. © 2014 IEEE.
Original languageEnglish
Pages (from-to)4010-4021
JournalIEEE Transactions on Image Processing
Volume23
Issue number9
DOIs
Publication statusPublished - Sept 2014
Externally publishedYes

Keywords

  • bargaining game
  • bargaining power.
  • generalized nash bargaining solution
  • rate control
  • Spatial scalable video coding

Fingerprint

Dive into the research topics of 'Generalized nash bargaining solution to rate control optimization for spatial scalable video coding'. Together they form a unique fingerprint.

Cite this