Fast CU Partition Decision Algorithm for Inter Coding in H.266/VVC Based on LightGBM
The new generation video codec standard H.266/VVC introduces many new technologies in several core cod-ing modules,aiming to improve the compression efficiency of video coding.But it also brings a significant increase in com-plexity.In the aspect of block partitioning,multi-tree partitioning(MT)is added on the basis of quadtree partitioning(QT)in H.265/HEVC,which leads to more partitioning cases.In addition,many coding modes are introduced between frames,which makes the calculation process of determining the optimal mode between frames of each CU more complicated.These inter-frame prediction techniques greatly increase the complexity and hinder its application in practice.Therefore,this paper pro-poses a fast interframe block partitioning algorithm based on LightGBM,and introduces several new features by analyzing the conventional spatio-temporal and contextual characteristics.By selecting a large number of highly relevant features and building multiple LightGBM models,a new block partitioning process is designed,which significantly shortened the whole block partitioning process.The experimental results show that compared with H.266/VVC reference software VTM10.0,the computational complexity is reduced by 33.98％on average,and the BDBR is increased by 1.77％.
万方数据
维普
