论文部分内容阅读
针对SHVC质量可伸缩编码中递归式的四叉树编码单元(CU)划分引起的高计算复杂度的问题,提出了一种增强层快速编码算法。该算法充分利用层间编码单元深度值的相关性,根据基本层编码单元的深度信息预测增强层编码单元的深度值范围,跳过一些小概率的编码深度;在每一编码深度层下,利用当前预测单元(PU)与时间、空间以及父辈相邻PUs之间的相关性判断当前编码区域的复杂度,然后根据该区域的复杂度快速选择预测模式,从而进一步提高编码速度。实验证明,该算法与SHVC参考代码中的标准算法相比,在保证编码效率的前提下,编码时间可以平均节约78%左右。
Aiming at the problem of high computational complexity caused by recursive quadtree coding unit (CU) partition in SHVC quality scalable coding, an enhancement layer fast coding algorithm is proposed. The algorithm makes full use of the correlation between depth values of inter-layer coding units, predicts the depth value range of enhancement layer coding units according to the depth information of base layer coding units and skips some coding depths with small probability. Under each coding depth layer, The current prediction unit (PU) determines the complexity of the current coding region according to the time, space, and the parents’ adjacent PUs, and then quickly selects the prediction mode according to the complexity of the region to further improve the coding speed. Experimental results show that compared with the standard algorithm in SHVC reference code, the coding time can save about 78% on average under the premise of ensuring coding efficiency.