LowComplexity Geometric InterPrediction for Versatile Video Coding Nonrectangular block partitioning is a wellknown method for improved interpicture prediction in video coding, enabling better spatial adaptation to the signal properties. This contribution presents the most recent proposal of geometric interprediction (GIP) made to the Versatile Video Coding (VVC) standardization activity led by the Joint Video Experts Team (JVET). Implemented in the latest test model VTM5.0 and evaluated according to the JVET Common Test Conditions, the proposed lowcomplexity GIP scheme provides objective luma BDrate reductions of 0.22 % for random access and 0.44 % for lowdelay test cases at 7% encoder runtime increase and negligible decoder runtime increase. The coding gain is provided by nontriangular partitioned blocks and in the presence of multiple other VVC coding tools. Furthermore, BDrate reductions of 2.58 % and 2.78 % can be achieved specifically for pure screen content by employing an adaptive blending filter.

Fast QTMT Partition Decision Algorithm in VVC Intra Coding based on Variance and Gradient Quadtree with nested multitype tree (QTMT) partition structure in Versatile Video Coding (VVC) contributes to superior encoding performance compared to the basic quadtree (QT) structure in High Efficiency Video Coding (HEVC). However, the improvement of performance leads to an unavoidable increase of computational complexity. To achieve a balance between coding efficiency and compression quality, we propose a fast intra partition algorithm based on variance and gradient to solve the rectangular partition problem in VVC. First, further splitting of smooth areas is terminated. Then, QT partition is chosen depending on the gradient features extracted by Sobel operator. Finally, one partition from five possible QTMT partitions is directly chosen by computing the variance of variance of subCUs. The theoretical basis of our method is that a homogeneous area tends to be predicted with a larger coding unit (CU), and subparts of a split CU are prone to have different textures from each other. To our knowledge, this is the first attempt to apply traditional method to accelerating the rectangular partition problem in VVC intra prediction. Experimental results show that the proposed method can save averagely 53.17% encoding time with only 1.62% BDBR increase and 0.09dB BDPSNR loss compared to anchor VTM4.0.