A Fast Algorithm for VVC Intra Coding Based on the Most Probable Partition Pattern List
A Fast Algorithm for VVC Intra Coding Based on the Most Probable Partition Pattern List
复制标题
DOI：
10.3390/app131810381
复制
发表时间：
2023-09
期刊：
影响因子：
--
通讯作者：
Haiwu Zhao;Shuai Zhao;Xiwu Shang;Guozhong Wang
中科院分区：
文献类型：
--
作者：
Haiwu Zhao;Shuai Zhao;Xiwu Shang;Guozhong Wang
与高效视频编码（High-Efficiency Video Coding， HEVC）相比，通用视频编码（Versatile Video Coding， VVC）具有更灵活的分割和更高的压缩效率，但其计算复杂度也更高。为了降低编码复杂度，提出了一种基于最可能分割模式列表（MPPPL）和像素内容相似性的快速算法。首先，利用子编码单元在不同分割模式下的平均纹理复杂度差构建MPPPL；然后，利用子块像素均值差来确定最佳分割方式或缩短MPPPL。最后，统计图像内预测过程中参考线的选择规则，并利用像素内容相似度跳过不需要的参考线。实验结果表明，与VTM-13.0相比，该算法可节省52.26%的编码时间，BDBR （bjontegard delta比特率）仅提高1.23%。
Compared with High-Efficiency Video Coding (HEVC), Versatile Video Coding (VVC) has more flexible division and higher compression efficiency, but it also has higher computational complexity. In order to reduce the coding complexity, a fast algorithm based on the most probable partition pattern list (MPPPL)and pixel content similarity is proposed. Firstly, the MPPPL is constructed by using the average texture complexity difference of the sub-coding unit under different partition modes. Then, the sub-block pixel mean difference is used to decide the best partition mode or shorten the MPPPL. Finally, the selection rules of the reference lines in the intra prediction process are counted and the unnecessary reference lines are skipped by using the pixel content similarity. The experimental results show that compared with VTM-13.0, the proposed algorithm can save 52.26% of the encoding time, and the BDBR (Bjontegarrd delta bit rate) only increases by 1.23%.