一种HEVC的CU分割模式快速算法

A Fast CU Partition Mode Algorithm for HEVC

由于高效视频编码(H.265/HEVC)的复杂度高和编码时间长,提出了一种CU(编码单元)分割模式的快速算法。该算法利用相邻编码单元具有很强的时空相关性,缩小编码单元深度遍历范围,提前终止或跳过不必要的深度,同时根据前一帧中与当前CU对应位置CU的深度关系,分别进行率失真代价的比较,确定CU的最佳分割模式。实验结果证明,与HM16.9标准算法相比,本文提出的算法能在保持编码性能的情况下使平均编码时间大约减少21.68%,说明该方案可以广泛应用在实时视频中。

Due to the high complexity and long coding time of efficient video coding(H.265/HEVC),a fast algorithm for CU partition mode is proposed.The algorithm uses adjacent coding unit with strong spatial-temporal correlation,narrowing the scope of coding unit depth traversal,the depth of the early termination or skip unnecessary,at the same time,according to the comparison in the previous frame and the depth of the current coding unit corresponding location coding unit,respectively rate-distortion cost comparison,determine the optimal partition model of CU.Experimental results show that compared with HM16.9 standard algorithm,the proposed algorithm can reduce the average coding time by about 21.68%while maintaining the coding performance,indicating that the proposed algorithm can be widely used in real-time video.