低复杂度多变换选择结合多类型树分割算法的通用视频编码。

Low-Complexity Multiple Transform Selection Combining Multi-Type Tree Partition Algorithm for Versatile Video Coding.

机构信息

College of Electronics and Information Engineering, Sichuan University, No. 24 South Section 1, Yihuan Road, Chengdu 610065, China.

出版信息

Sensors (Basel). 2022 Jul 25;22(15):5523. doi: 10.3390/s22155523.

DOI:10.3390/s22155523

PMID:35898027

原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9331267/

Abstract

Despite the fact that Versatile Video Coding (VVC) achieves a superior coding performance to High-Efficiency Video Coding (HEVC), it takes a lot of time to encode video sequences due to the high computational complexity of the tools. Among these tools, Multiple Transform Selection (MTS) require the best of several transforms to be obtained using the Rate-Distortion Optimization (RDO) process, which increases the time spent video encoding, meaning that VVC is not suited to real-time sensor application networks. In this paper, a low-complexity multiple transform selection, combined with the multi-type tree partition algorithm, is proposed to address the above issue. First, to skip the MTS process, we introduce a method to estimate the Rate-Distortion (RD) cost of the last Coding Unit (CU) based on the relationship between the RD costs of transform candidates and the correlation between Sub-Coding Units' (sub-CUs') information entropy under binary splitting. When the sum of the RD costs of sub-CUs is greater than or equal to their parent CU, the RD checking of MTS will be skipped. Second, we make full use of the coding information of neighboring CUs to terminate MTS early. The experimental results show that, compared with the VVC, the proposed method achieves a 26.40% reduction in time, with a 0.13% increase in Bjøontegaard Delta Bitrate (BDBR).

摘要

尽管多功能视频编码（VVC）在编码性能上优于高效视频编码（HEVC），但由于工具的计算复杂度高，对视频序列进行编码需要花费大量时间。在这些工具中，多变换选择（MTS）需要使用率失真优化（RDO）过程获得几种变换的最佳效果，这增加了视频编码的时间，这意味着 VVC 不适合实时传感器应用网络。在本文中，提出了一种低复杂度的多变换选择方法，结合多类型树分区算法，以解决上述问题。首先，为了跳过 MTS 过程，我们引入了一种基于变换候选的率失真（RD）代价与二叉划分下子编码单元（sub-CUs）信息熵之间相关性的方法，来估计最后一个编码单元（CU）的 RD 代价。当 sub-CUs 的 RD 代价之和大于等于其父 CU 的 RD 代价时，将跳过 MTS 的 RD 检查。其次，我们充分利用相邻 CU 的编码信息来提前终止 MTS。实验结果表明，与 VVC 相比，所提出的方法的时间减少了 26.40%，Bjøntegaard Delta 比特率（BDBR）增加了 0.13%。