计算机工程

• •    

H.266合并模式候选决策的研究与改进

  

  • 发布日期:2021-01-05

Research and Improvement of Merge Mode Candidate Decision for H.266

  • Published:2021-01-05

摘要: 针对 H.266 中新增的 HMVP 技术在换行更新列表过程中无法参考之前的 HMVP 候选列表中的运动信息的缺点以及 构建的 HMVP 候选列表在加入 Merge 列表过程中繁琐且耗时的去冗余过程,文章提出了一种改进算法。该算法通过临时存储 一个 HMVP 候选列表的方式来解决 HMVP 列表在换行清空时的缺陷,以便更好的预测运动信息;然后通过 Merge 候选列表 中原有的空时域候选的数量来确定需要进行去冗余的 HMVP 候选数量,简化不必要的去冗余过程。实验结果表明:与 H.266 的标准算法相比,该改进算法在随机接入的配置下,测试图像序列的亮度分量平均节省了 0.46%的码率,编码总时间平均降 低了 4.09%,帧间预测时间平均降低了 10.87%,该改进算法提高了编码性能的同时降低了编码复杂度。

Abstract: In view of the shortcomings of the new HMVP technology in H.266 that cannot refer to the motion information in the previous HMVP candidate list during the line-feeding update list and the cumbersome and time-consuming de-redundancy process of the constructed HMVP candidate list in the process of adding the Merge list, this paper proposes an improved algorithm. The algorithm temporarily stores a HMVP candidate list to solve the defects of the HMVP list when it is cleared in line breaks, so as to better predict the motion information; then, the number of original spatial-temporal candidates in the Merge candidate list is used to determine the number of HMVP candidates with the need for de-redundancy. The way simplifies the unnecessary de-redundancy process. The experimental results show that compared with the standard algorithm of H.266, the improved algorithm saves 0.46% of the code rate on the luminance component of the test image sequence in the random access configuration, the total coding time is reduced by 4.09% on average, and the inter-frame prediction time is reduced by 10.87% on average. The improved algorithm improves coding performance while reducing coding complexity.