用分区图加速VVC帧间编码，显著降低计算量。
Partition Map-Based Fast Block Partitioning for VVC Inter Coding
- 基于分区图与MTT掩码实现早期终止，提升搜索效率。
- 融合时空特征的神经网络预测分区图，平均提速51.30%。
- 双阈值决策机制平衡速度与画质损失，适合实时编码场景。
在通用视频编码（VVC）中，带有嵌套多类型树（QT+MTT）的四叉树结构通过更灵活的块划分模式带来显著编码增益。然而，递归划分搜索使编码器复杂度大幅上升。为此，本文提出一种基于分区图的快速帧间编码方法。基于先前针对帧内编码的分区图方法，分析VVC帧间编码特性，改进分区图并引入MTT掩码以实现早期终止。进一步设计一个结合空间与时间特征的神经网络，包含堆叠式上下文处理、量化参数调制层及自适应变形模块。此外，提出双阈值决策策略，在复杂度降低与率失真性能之间实现细粒度权衡。实验表明，该方法在随机访问配置下平均编码时间减少51.30%，仅带来2.12%的Bjontegaard Delta Bit Rate（BDBR）增加。
原文摘要 · Abstract (English)
Among the new techniques of Versatile Video Coding (VVC), the quadtree with nested multi-type tree (QT+MTT) block structure yields significant coding gains by providing more flexible block partitioning patterns. However, the recursive partition search in the VVC encoder increases the encoder complexity substantially. To address this issue, we propose a partition map-based algorithm to pursue fast block partitioning in inter coding. Based on our previous work on partition map-based methods for intra coding, we analyze the characteristics of VVC inter coding, and thus improve the partition map by incorporating an MTT mask for early termination. Next, we develop a neural network that uses both spatial and temporal features to predict the partition map. It consists of several special designs including stacked top-down and bottom-up processing, quantization parameter modulation layers, and partitioning-adaptive warping. Furthermore, we present a dual-threshold decision scheme to achieve a fine-grained trade-off between complexity reduction and rate-distortion (RD) performance loss. The experimental results demonstrate that the proposed method achieves an average 51.30% encoding time saving with a 2.12% Bjontegaard Delta Bit Rate (BDBR) under the random access configuration.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。