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

Fast coding unit size decision for HEVC

作　　者：周承涛[1,2] 田翔[1,2] 陈耀武[1,2] 

机构地区：[1]浙江大学数字技术及仪器研究所,浙江杭州310027 [2]浙江省网络多媒体技术研究重点实验室,浙江杭州310027

出　　处：《浙江大学学报（工学版）》2014年第8期1451-1460,共10页Journal of Zhejiang University：Engineering Science

基　　金：国家自然科学基金资助项目(40927001);中央高校基本科研业务费专项资金资助项目;浙江省重点科技创新团队资助项目(2011R09021-06)

摘　　要：针对高性能视频编码标准(HEVC)采用递归式的四叉树编码单元划分而引起的高计算复杂度问题,提出一种编码单元尺寸快速选择算法.该算法充分利用时空相邻编码单元深度的相关性.根据当前编码单元与左侧编码单元深度信息的相关性,提出深度单一性,利用这种特性,预测当前编码单元的深度搜索范围;根据前一帧中编码单元的深度信息判断编码单元所覆盖图像区域的复杂度,并根据该区域的复杂度进一步缩减可能的深度搜索,从而提高编码单元划分速度.结果表明,该算法与HEVC参考代码中的标准算法相比,在保证编码效率的前提下,编码时间可以平均节省约25%.该算法可以与HEVC编码器中的快速算法结合使用,进一步提高编码速度.To reduce the coding computational complexity of the quadtree block partition process in high efficiency video coding （HEVC）, a fast coding unit （CU） size decision based on the spatio-temporal correlation of CU depth was proposed. First, characteristic called depth monotonicity using the depth information of left CU was introduced to predict the depth of the current CU. Second, the spilt structure of the current CU was predicted using the similar structure of temporal neighboring CUs, as the spilt structure of the CU was highly related to the complexity of the region covered by CU. As compared to the original HEVC encoder, experimental results show that the proposed algorithm can save 25% encoding time on average with almost the same Rate-Distortion performance. The proposed algorithm can be incorporated with the fast algorithms adopted by HEVC reference software to maximize the encoder complexity reduction for HEVC.

关 键 词：HEVC 编码单元尺寸 四叉树块划分 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]