HEVC编码单元尺寸快速选择算法

发布时间：2019-03-28 07:39

【摘要】：针对高性能视频编码标准(HEVC)采用递归式的四叉树编码单元划分而引起的高计算复杂度问题,提出一种编码单元尺寸快速选择算法.该算法充分利用时空相邻编码单元深度的相关性.根据当前编码单元与左侧编码单元深度信息的相关性,提出深度单一性,利用这种特性,预测当前编码单元的深度搜索范围;根据前一帧中编码单元的深度信息判断编码单元所覆盖图像区域的复杂度,并根据该区域的复杂度进一步缩减可能的深度搜索,从而提高编码单元划分速度.结果表明,该算法与HEVC参考代码中的标准算法相比,在保证编码效率的前提下,编码时间可以平均节省约25%.该算法可以与HEVC编码器中的快速算法结合使用,进一步提高编码速度.
[Abstract]:In order to solve the problem of high computational complexity caused by recursive quadtree coding unit partition in high performance video coding standard (HEVC), a fast coding unit size selection algorithm is proposed. The algorithm makes full use of the depth correlation of space-time adjacent coding units. According to the correlation between the depth information of the current coding unit and the left coding unit, the depth singleness is proposed, and the depth search range of the current coding unit is predicted by using this characteristic. According to the depth information of the coding unit in the previous frame, the complexity of the image area covered by the coding unit is judged, and the possible depth search is further reduced according to the complexity of the region, thereby increasing the partition speed of the coding unit. The results show that, compared with the standard algorithm in HEVC reference code, the coding time can be saved by about 25% on the premise that the coding efficiency is guaranteed. This algorithm can be used in combination with the fast algorithm in HEVC encoder to further improve the coding speed.
【作者单位】：浙江大学数字技术及仪器研究所;浙江省网络多媒体技术研究重点实验室;
【基金】：国家自然科学基金资助项目(40927001) 中央高校基本科研业务费专项资金资助项目浙江省重点科技创新团队资助项目(2011R09021-06)
【分类号】：TN919.81

【相似文献】