$\lambda$-domain VVC Rate Control Based on Game Theory

TL;DR

This paper introduces a novel $mbda$-domain rate control method for VVC that models the problem as a Nash equilibrium game among coding units, leading to improved rate allocation and coding efficiency.

Contribution

It is the first to apply game theory to $mbda$-domain rate control in VVC, proposing a two-step strategy for optimal $mbda$ calculation and CTU-level rate allocation.

Findings

Outperforms state-of-the-art CTU-level rate allocation algorithms.

Demonstrates improved rate-distortion performance on standard test conditions.

Validates the effectiveness of game theory in video coding rate control.

Abstract

Versatile Video Coding (VVC) has set a new milestone in high-efficiency video coding. In the standard encoder, the $\lambda$-domain rate control is incorporated for its high accuracy and good Rate-Distortion (RD) performance. In this paper, we formulate this task as a Nash equilibrium problem that effectively bargains between multiple agents, {\it i.e.}, Coding Tree Units (CTUs) in the frame. After that, we calculate the optimal $\lambda$ value with a two-step strategy: a Newton method to iteratively obtain an intermediate variable, and a solution of Nash equilibrium to obtain the optimal $\lambda$. Finally, we propose an effective CTU-level rate allocation with the optimal $\lambda$ value. To the best of our knowledge, we are the first to combine game theory with $\lambda$-domain rate control. Experimental results with Common Test Conditions (CTC) demonstrate the efficiency of the proposed method, which outperforms the state-of-the-art CTU-level rate allocation algorithms.