3D-HEVC深度图帧内编码快速算法

编码3D视频的3D-HEVC编码标准采用多视点加深度图的编码格式,新增的深度信息使编码复杂度剧增。本文针对编码块(Coding Unit,CU)的四叉树分割模型和帧内预测模式,提出了深度图帧内编码的快速算法。用Otsu’s算子计算当前CU的最大类间方差值,判断当前CU是否平坦,对平坦CU终止四叉树分割和减少帧内模式的遍历数目。根据子CU与上一层CU的相似性,利用已编码的上一层CU对提前终止CU分割算法做优化。本算法与原始3D-HEVC算法相比减少40.1%的编码时间,而合成视点的质量几乎无变化。      

3D-HEVC深度图像帧内编码单元划分快速算法

针对3维高性能视频编码(3D-HEVC)中深度图像帧内编码单元(Coding Unit, CU)划分复杂度高的问题,该文提出一种基于角点和彩色图像的自适应快速CU划分算法。首先利用角点算子,并根据量化参数选取一定数目的角点,以此进行CU的预划分;然后联合彩色图像的CU划分对预划分的CU深度级进行调整;最后依据调整后的CU深度级,缩小当前CU的深度级范围。实验结果表明,与原始3D-HEVC的算法相比,该文所提算法平均减少了约63%的编码时间;与只基于彩色图像的算法相比,该文的算法减少了约13%的编码时间,同时降低了约3%的平均比特率,有效地提高了编码效率。     

纹理-深度图共同优化的3D-HEVC帧内快速算法

随着立体及3D视频需求的日益增多,针对3D视频编码方法的研究受到越来越多的关注。3D-HEVC编码标准对采用纹理和深度图格式融合的3D视频进行编码,由于加入了深度图编码,因此新增了深度图编码模式、组件间预测和分段直流编码等技术,使其编码复杂度急剧升高。为了减少3D-HEVC的编码时间,本文提出了针对纹理图和深度图的编码单元（Coding Unit,CU）尺寸提前决策快速算法。利用梯度矩阵和作为当前CU和子CU复杂度的判断依据,将CU分为三类：不划分CU(Non-Split Coding Unit,NSCU)、直接划分CU(Split Coding Unit,SCU)以及普通CU。对NSCU,跳过小尺寸的帧内预测过程;对SCU,直接跳过当前CU的帧内预测过程;对普通CU,执行原平台操作。实验结果表明,与原始平台相比,本文算法在合成视点质量基本不变的情况下,平均减少40.92%的编码时间;与最新的联合纹理-深度图优化的3D-HEVC快速算法相比,可以在质量相当的情况下减少更多的编码时间。     

3D-HEVC合并模式快速判决方法研究

基于高效视频编码的3D视频编码（3D-HEVC）是目前正在研究的新一代3D视频编码标准。为降低3D-HEVC中模式选择的计算复杂度,根据非独立视点纹理图中合并模式采用率高的特点,该文提出了一种3D-HEVC合并模式快速判决方法。在B帧中,分析了当前编码单元（CU）与视点方向参考帧中参考块间编码模式的相关性;在P帧中,分析了位于相邻划分深度的CU间编码模式的相关性。根据分析的视点间和划分深度间的相关性设计快速判决条件,预判采用合并/合并-跳过模式编码的CU,判别出的CU在模式选择过程中只检查相关的候选预测模式,从而降低计算复杂度。实验结果表明,与3D-HEVC原始算法相比,该文算法能够在率失真性能损失很小的前提下,平均节省11.2%的总编码时间和25.4%的非独立视点纹理图的编码时间。      

基于深层特征学习的高效率视频编码中帧内快速预测算法

高效视频编码(HEVC)标准相对于H.264/AVC标准提升了压缩效率,但由于引入的编码单元四叉树划分结构也使得编码复杂度大幅度提升.对此,该文提出一种针对HEVC帧内编码模式下编码单元(CU)划分表征矢量预测的多层特征传递卷积神经网络(MLFT-CNN),大幅度降低了视频编码复杂度.首先,提出融合CU划分结构信息的降分辨率特征提取模块;其次,改进通道注意力机制以提升特征的纹理表达性能;再次,设计特征传递机制,用高深度编码单元划分特征指导低深度编码单元的划分;最后建立分段特征表示的目标损失函数,训练端到端的CU划分表征矢量预测网络.实验结果表明,在不影响视频编码质量的前提下,该文所提算法有效地降低了HEVC的编码复杂度,与标准方法相比,编码复杂度平均下降了70.96％.     

基于深层特征学习的高效率视频编码中帧内快速预测算法

高效视频编码(HEVC)标准相对于H.264/AVC标准提升了压缩效率,但由于引入的编码单元四叉树划分结构也使得编码复杂度大幅度提升。对此,该文提出一种针对HEVC帧内编码模式下编码单元(CU)划分表征矢量预测的多层特征传递卷积神经网络(MLFT-CNN),大幅度降低了视频编码复杂度。首先,提出融合CU划分结构信息的降分辨率特征提取模块;其次,改进通道注意力机制以提升特征的纹理表达性能;再次,设计特征传递机制,用高深度编码单元划分特征指导低深度编码单元的划分;最后建立分段特征表示的目标损失函数,训练端到端的CU划分表征矢量预测网络。实验结果表明,在不影响视频编码质量的前提下,该文所提算法有效地降低了HEVC的编码复杂度,与标准方法相比,编码复杂度平均下降了70.96%。     

采用灰度共生矩阵进行深度预判的3D-HEVC深度图帧内快速编码算法

针对3D视频的3D-HEVC编码标准以多视点纹理视频和深度视频格式进行编码,其深度图编码仍延续纹理视频编码的模式和编码尺寸遍历选择,使得3D-HEVC的编码复杂度居高不下。本文针对深度图帧内预测编码,采用灰度共生矩阵对深度图中的CTU进行计算,统计并分析其矩阵中非零值个数与CTU分割深度的关系,根据非零值个数分布规律,设定阈值,使得帧内编码时可以预判编码模块的分割深度,从而选择性跳过部分不同深度CU的帧内预测过程。经过HTM16.0测试平台的检验,本算法在全帧内编码模式下,测试序列合成视点比特率仅增加0.08%的同时,平均节省了16.8%的编码时间,与其他同类较新算法在HTM16.0平台上的性能比较也有一定的优势。      

结合预处理的深度视频帧内快速编码算法

多视点彩色加深度(MVD)视频是三维(3D)视频的 主流格式。在3D高效视频编码中,深度视频帧内编码 具有较高的编码复杂度;深度估计软件获取的深度视频由于不够准确会使深度图平坦 区域纹理增加, 从而进一步增加帧内编码复杂度。针对以上问题,本文提出了一种联合深度处理的深度视频 帧内低复杂度 编码算法。首先,在编码前对深度视频进行预处理,减少由于深度图不准确而出现的纹理信 息;其次,运 用反向传播神经网络(BPNN,backpropagation neural network)预测最大编码单元 (LCU,la rgest coding unit)的最大划分深度;最后联合深度视频的边缘信 息及对应的彩色LCU最大划分深度进行CU提前终止划分和快速模式选取。实验结果表明, 本文算法在保证 虚拟视点质量的前提下,BDBR下降0.33% ,深度视频编码时间平均节省50.63%。     

基于感兴趣区域的高性能视频编码帧内预测优化算法

针对高性能视频编码(HEVC)帧内预测编码算法复杂度较高的问题,该文提出一种基于感兴趣区域的高性能视频编码帧内预测优化算法。首先,根据图像显著性划分当前帧的感兴趣区域(ROI)和非感兴趣区域(NROI);然后,对ROI基于空域相关性采用提出的快速编码单元(CU)划分算法决定当前编码单元的最终划分深度,跳过不必要的CU划分过程;最后,基于ROI采用提出的预测单元(PU)模式快速选择算法计算当前PU的能量和方向,根据能量和方向确定当前PU的预测模式,减少率失真代价的相关计算,达到降低编码复杂度和节省编码时间的目的。实验结果表明,在峰值信噪比(PSNR)损失仅为0.0390 dB的情况下,所提算法可以平均降低47.37%的编码时间。     

一种HEVC帧内快速编码算法

高效视频编码(HEVC)采用编码单元(CU)四叉树的 分割结构,相比H.264/AVC显著地提升了编码效 率,但却使编码复杂度急剧增加。为此,本文提出一种帧内快速编码算法。首先,根据视 频图像纹理复 杂度,提前判断是否进行最大编码单元(LCU)分割。然后,根据空域相邻CU的深度预测当前C U的深度范围, 跳过不必要的计算;最后,根据预测模式被选为最优预测模式的统计特性,去掉可能性小的 帧内预测模式。本文算法在HM14.0的基础上实现。 仿真结果表明,本文算法在全I帧模式下与HM14.0相比,帧内编码时 间平均减少38%,码率(BR)只增加1.41%,峰值信噪比(PSNR)只降低0.29dB,在保证编码性能和视频质量几乎不变的 情况下,本文算法降低了编码的计算复杂度。     

Self-learning residual model for fast intra CU size decision in 3D-HEVC

As an extension of the High Efficiency Video Coding (HEVC) standard, 3D-HEVC requires to encode multiple texture views and depth maps, which inherits the same quad-tree coding structure as HEVC. Due to the distinct properties of texture views and depth maps, existing fast intra prediction approaches were presented for the coding of texture views and depth maps, respectively. To further reduce the coding complexity of 3D-HEVC, a self-learning residual model-based fast coding unit (CU) size decision approach is proposed for the intra coding of both texture views and depth maps. Residual signal, which is defined as the difference between the original luminance pixel and the optimal prediction luminance pixel, is firstly extracted from each CU. Since residue signal is strongly correlated with the optimal CU partition, it is used as the feature of each CU. Then, a self-learning residual model is established by intra feature learning, which iteratively learns the features of the previously encoded coding tree unit (CTU) generated by itself. Finally, a binary classifier is developed with the self-learning residual model to early terminate CU size decision of both texture views and depth maps. Experimental results show the proposed fast intra CU size decision approach achieves 33.3% and 49.3% encoding time reduction on average for texture views and depth maps with negligible loss of overall video quality, respectively.     

Early Merge mode decision algorithm for 3D-HEVC based on learning model

3D-high efficiency video coding (3D-HEVC) standard is an extension of HEVC.Though 3D-HEVC effectively improves the compression efficiency of 3D video,it also brings huge computational complexity.To greatly reduce the 3D-HEVC coding complexity,an early Merge mode decision approach was proposed.The residual signal that encoded by the Merge mode was firstly extracted as feature information.A learning model was established in terms of the residual signals of the coding unit (CU) in current frame that used early Merge mode as the optimal mode.Finally,the residual signal was extracted for the Merge mode of current CU,and the learning model was used to predict whether the Merge mode was the optimal mode or not.Experimental results show that the proposed early Merge mode decision approach reduces the coding times of 3D-HEVC texture views and depth maps about 41.9% and 24.3%,respectively,and the coding performance degradation is almost negligible.Compared with existing early Merge mode decision approaches,the proposed approach further reduces the coding time,and can be easily integrated into the 3D-HEVC test model due to its design simplicity.     

Fast depth map mode decision based on depth–texture correlation and edge classification for 3D-HEVC

The 3D extension of High Efficiency Video Coding (3D-HEVC) has been adopted as the emerging 3D video coding standard to support the multi-view video plus depth map (MVD) compression. In the joint model of 3D-HEVC design, the exhaustive mode decision is required to be checked all the possible prediction modes and coding levels to find the one with least rate distortion cost in depth map coding. Furthermore, new coding tools (such as depth-modeling mode (DMM) and segment-wise depth coding (SDC)) are exploited for the characteristics of depth map to improve the coding efficiency. These achieve the highest possible coding efficiency to code depth map, but also bring a significant computational complexity which limits 3D-HEVC from real-time applications. In this paper, we propose a fast depth map mode decision algorithm for 3D-HEVC by jointly using the correlation of depth map-texture video and the edge information of depth map. Since the depth map and texture video represent the same scene at the same time instant (they have the same motion characteristics), it is not efficient to use all the prediction modes and coding levels in depth map coding. Therefore, we can skip some specific prediction modes and depth coding levels rarely used in corresponding texture video. Meanwhile, the depth map is mainly characterized by sharp object edges and large areas of nearly constant regions. By fully exploiting these characteristics, we can skip some prediction modes which are rarely used in homogeneity regions based on the edge classification. Experimental results show that the proposed algorithm achieves considerable encoding time saving while maintaining almost the same rate-distortion (RD) performance as the original 3D-HEVC encoder.     

Fast intra mode decision for depth coding in 3D-HEVC

The emergent 3D High Efficiency Video Coding (3D-HEVC) is an extension of the High Efficiency Video Coding (HEVC) standard for the compression of the multi-view texture videos plus depth maps format. Since depth maps have different statistical properties compared to texture video, various new intra tools have been added to 3D-HEVC depth coding. In current 3D-HEVC, new intra tools are utilized together with the conventional HEVC intra prediction modes for depth coding. This technique achieves the highest possible coding efficiency, but leads to an extremely high computational complexity which limits 3D-HEVC from practical applications. In this paper, we propose a fast intra mode decision algorithm for depth coding in 3D-HEVC. The basic idea of the proposed algorithm is to utilize the depth map characteristics to predict the current depth prediction mode and skip some specific depth intra modes rarely used in 3D-HEVC depth coding. Based on this analysis, two fast intra mode decision strategies are proposed including reduction of the number of conventional intra prediction modes, and simplification of depth modeling modes (DMMs). Experimental results demonstrate that the proposed algorithm can save 30 % coding runtime on average while maintaining almost the same rate-distortion (RD) performance as the original 3D-HEVC encoder.     

An image feature-based method to efficiently determine inter-coding depth in HEVC

The quad-tree based picture partition scheme in High Efficiency Video Coding (HEVC) results in a more substantial increase in computational complexity than those incurred by its predecessor video coding standards because of the need in this scheme to determine the best coding unit (CU) partitions. In this paper, we propose a method to effectively reduce the computational complexity of inter-prediction coding in the HEVC standard. The relative displacement of the largest coding unit (LCU) at the corresponding position between adjacent frames is tested through optical flow (motion estimation). The texture intensity of the LCU at the given time is tested if the condition that determines the coding depth in advance cannot be satisfied. The depth of the coding unit (CU) can be determined in advance beyond the xCompressCU function by using our proposed method, which does not require the calculation of the rate-distortion (RD) cost for each level of depth, and thus reduces the circular traversal times of the xCompressCU function. Experimental results proved that our proposed method is effective, as it reduced the computational complexity of an encoder by 53.2% on average, and had a slight influence on coding performance.     

Machine learning based fast H.264/AVC to HEVC transcoding exploiting block partition similarity

Video transcoding is to convert one compressed video stream to another. In this paper, a fast H.264/AVC to High Efficiency Video Coding (HEVC) transcoding method based on machine learning is proposed by considering the similarity between compressed streams, especially the block partition correlations, to reduce the computational complexity. This becomes possible by constructing three-level binary classifiers to predict quad-tree Coding Unit (CU) partition in HEVC. Then, we propose a feature selection algorithm to get representative features to improve predication accuracy of the classification. In addition, we propose an adaptive probability threshold determination scheme to achieve a good trade-off between low coding complexity and high compression efficiency during the CU depth prediction in HEVC. Extensive experimental results demonstrate the proposed transcoder achieves complexity reduction of 50.2% and 49.2% on average under lowdelay P main and random access configurations while the rate-distortion degradation is negligible. The proposed scheme is proved more effective as comparing with the state-of-the-art benchmarks.