hevc角度预测_3D-HEVC深度图帧内预测快速算法

1e1c9430c85a328b5759c1a04ec65875.png

发布时间: 2018-01-16

摘要点击次数:

全文下载次数:

DOI: 10.11834/jig.170176

2018 | Volume 23 | Number 1

图像处理和编码

e74f7828b9472378917eb44510fe49da.png

3D-HEVC深度图帧内预测快速算法

abda9b0b761f5702f3539ba871f6371d.png

王驰, 冯桂, 蔡春亭, 韩雪

华侨大学信息科学与工程学院, 厦门 361021

收稿日期: 2017-05-08; 修回日期: 2017-10-02

基金项目: 福建省自然科学基金项目(2016J01306);华侨大学研究生科研创新能力培育计划资助项目

第一作者简介:

王驰(1991-), 男, 华侨大学通信与信息系统专业硕士研究生, 主要研究方向为3D视频编码中的算法优化。E-mail:929854291@qq.com.

中图法分类号: TN919.81

文献标识码: A

文章编号: 1006-8961(2018)01-0018-10

摘要

目的

多视点纹理加深度视频(MVD)格式逐渐成为立体视频的主流表现形式之一。新一代高效率立体视频编码(3D-HEVC)继承了HEVC的编码结构并引入一些新的编码技术,导致深度图帧内编码过程具有较高的计算复杂度。针对这一问题,提出了一种深度图帧内编码快速算法。方法

本文算法利用深度图的特征分别对CU分割过程和粗略模式选择(RMD)过程进行优化。首先在四叉树编码结构上,利用基于纹理元的图像分析方法计算编码单元的梯度矩阵,若梯度矩阵中的梯度值之和小于给定的阈值,则终止该CU的分割进程。同时,对大尺寸的PU和小尺寸的PU分别利用纹理特征与粗略模式选择过程中Planar和DC进行低复杂度率失真计算后的最小率失真代价,跳过RMD中角度模式的检查过程。结果

实验结果表明,与原始算法相比,本文算法平均节省40.64%的深度图编码时间,而合成视点的平均比特率仅仅增加了0.17%。本文算法不仅能对平坦的CU跳过不必要的深度决策过程,而且有效地减少了RMD中需要遍历的模式数目,提高了编码器的效率。结论

该算法对CU分割进程和粗略模式选择过程都进行优化,在合成视点的视频质量几乎不变的前提下,有效降低了深度图的帧内编码复杂度。

关键词

3维高效率立体视频编码(3D-HEVC); 计算复杂度; 深度图; 帧内编码; 编码单元; 梯度矩阵

Fast intra prediction algorithm for depth maps in 3D-HEVC

abda9b0b761f5702f3539ba871f6371d.png

Wang Chi, Feng Gui, Cai Chunting, Han Xue

Huaqiao University, Department of Information Science and Engineering, Xiamen 361021, China

Supported by: Natural Science Foundation of Fujian Province, China(2016J01306)

Abstract

Objective

The multi-view video plus depth (MVD) format is gradually becoming one of the main representations for 3D videos. The 3D high-efficiency video coding (3D-HEVC) is the latest coding standard for compressing the MVD format. The 3D-HEVC inherits the coding structure of HEVC. Consequently, the splitting process of coding units (CUs) and the intra mode search process in depth map intra coding have great computational complexity. New techniques for depth map intra coding, such as depth modeling mode and simplified depth coding, have been introduced in recent years to preserve the sharp edges of depth maps. These techniques play an important role in the coding of depth maps. However, the adoption of these techniques further increases the computational complexity in 3D-HEVC encoder. A fast algorithm for depth map intra coding is proposed in this study to reduce the computational complexity of depth map intra coding.

Method

There are a lot of large smooth regions which are separated by sharp edges in depth maps. The CU splitting process and the rough mode decision (RMD) process are improved by the proposed algorithm by using the unique characteristics of depth maps. An algorithm based on the concept of texture primitive is proposed for the hierarchical quad-tree coding structure to early terminate the CU splitting process. First, the gradient matrix of the current CU can be calculated by using the texture analysis algorithm based on texture primitive. On the basis of statistical analysis, a strong correlation between the optimal size and sum of gradient values in gradient matrix is considered for each CU. If the sum of gradient values in gradient matrix is small, then the optimal size of current CU will be large. By contrast, if the sum of gradient values in gradient matrix is large, then the optimal size of current CU will be small. Therefore, if the sum of gradient values in gradient matrix is smaller than a given threshold, then the CU splitting process should be terminated. For the RMD process, the texture features and the smallest $LCRD_{\rm cost}$ of Planar and DC are used to skip the search of angular modes in RMD for prediction units (PUs) of large size and PUs of small size, respectively. Planar and DC are two intra prediction modes that are highly suited to code smooth PUs. If the texture of current PU is flat, then Planar or DC is likely to be selected as the optimal mode. Hence, for PUs of large size, if the sum of the gradient values in the gradient matrix is zero, then only Planar and DC are added to the full-RD search list, and the RMD process is skipped. When the size of PUs is small, if the smallest $LCRD_{\rm cost}$ of Planar and DC is smaller than a given threshold, then the RMD process is terminated immediately and the search of angular modes in RMD is skipped.

Results

In the proposed approach, the unnecessary depth levels of smooth CUs can be skipped, and the number of intra mode candidates for RMD is effectively reduced. The reference software HTM 13.0 of the 3D-HEVC standard is used to verify the coding performance of the proposed algorithm. Eight JCT-3V specified test sequ

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值