基于Lookahead搜索的H.266/VVC帧内多类型树结构快速决策方法  

Lookahead Search-based Fast Multi-type Tree Pruning Method for Intra Coding in H.266/VVC

作　　者：滕祺 高伟 滕国伟[1] 

机构地区：[1]上海大学通信与信息工程学院,上海200444 [2]上海文广科技(集团)有限公司,上海200233

出　　处：《工业控制计算机》2022年第7期121-123,126,共4页Industrial Control Computer

摘　　要：第四代视频编码标准H.266/VVC引入的诸多新技术在提高了压缩效率的同时引入了很高的编码复杂度,其帧内编码最耗时的部分之一是编码树单元(CTU)结构决策。提出了一种用于H.266/VVC帧内编码的多类型树(MT)结构快速决策方法。该方法首先利用Lookahead搜索来得到深度为2或3的编码单元的近似率失真代价,根据近似率失真代价来移除冗余的MT划分模式。重要性低的划分模式会被优先移除,重要性高的划分模式会被优先保留。实验结果表明,与H.266/VVC参考软件VTM 10.0相比,所提出的算法在节约了46.86%的帧内编码时间的情况下,仅增加了1.02%的BDBR。Many of the new technologies introduced by the fourth generation video coding standard H.266/VVC not only improve the compression efficiency,but also introduce high coding complexity.One of the most time-consuming parts of intra coding is the structure decision of the coding tree unit(CTU).This paper presents a fast decision method for the multi-type tree(MT)structure for H.266/VVC intra coding.Firstly,the approximate rate-distortion cost of coding units at a depth of 2 or 3 is obtained by lookahead search,and the redundant MT partition modes are removed according to the approximate rate-distortion cost.The partition mode with low importance will be removed prior,and the partition mode with high importance will be retained prior.Experimental results show that compared with H.266/VVC reference software VTM 10.0,the proposed algorithm saves 46.86%of intra coding time and only increases BDBR by 1.02%.

关 键 词：H.266/VVC 帧内编码 多类型树 Lookahead搜索 

分 类 号：TN919.81[电子电信—通信与信息系统]