WeChat Mini Program
Old Version Features

Adaptive Deep Reinforcement Learning-Based In-Loop Filter for VVC.

IEEE Transactions on Image Processing(2021)CCF ASCI 1区

Peking Univ

Cited 20|Views50
Abstract
Deep learning-based in-loop filters have recently demonstrated great improvement for both coding efficiency and subjective quality in video coding. However, most existing deep learning-based in-loop filters tend to develop a sophisticated model in exchange for good performance, and they employ a single network structure to all reconstructed samples, which lack sufficient adaptiveness to the various video content, limiting their performances to some extent. In contrast, this paper proposes an adaptive deep reinforcement learning-based in-loop filter (ARLF) for versatile video coding (VVC). Specifically, we treat the filtering as a decision-making process and employ an agent to select an appropriate network by leveraging recent advances in deep reinforcement learning. To this end, we develop a lightweight backbone and utilize it to design a network set $\mathcal {S}$ containing networks with different complexities. Then a simple but efficient agent network is designed to predict the optimal network from $\mathcal {S}$ , which makes the model adaptive to various video contents. To improve the robustness of our model, a two-stage training scheme is further proposed to train the agent and tune the network set. The coding tree unit (CTU) is seen as the basic unit for the in-loop filtering processing. A CTU level control flag is applied in the sense of rate-distortion optimization (RDO). Extensive experimental results show that our ARLF approach obtains on average 2.17%, 2.65%, 2.58%, 2.51% under all-intra, low-delay P, low-delay, and random access configurations, respectively. Compared with other deep learning-based methods, the proposed approach can achieve better performance with low computation complexity.
More
Translated text
Key words
In-loop filter,versatile video coding (VVC),deep reinforcement learning
求助PDF
上传PDF
Bibtex
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
  • Pretraining has recently greatly promoted the development of natural language processing (NLP)
  • We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
  • We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
  • The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
  • Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Related Papers
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:本文提出了一种自适应深度强化学习基础的循环滤波器(ARLF),用于提升VVC视频编码的性能,通过动态选择适当的网络结构,提高了编码效率和主观质量,同时降低了计算复杂度。

方法】:论文采用深度强化学习的方法,将滤波过程视为决策过程,并设计了一个轻量级骨干网络和包含不同复杂度网络的网络集合,通过智能体网络选择最优网络,实现自适应调整。

实验】:实验中,作者使用了多种配置(all-intra、low-delay P、low-delay、random access)的CTU级控制标志,基于率失真优化(RDO)进行测试,使用的数据集未明确提及,结果显示ARLF方法在所有配置下平均性能提升分别为2.17%、2.65%、2.58%、2.51%,且计算复杂度较低。