一种HEVC帧内预测编码CU结构快速选择算法

为了提升高效视频编码(HEVC) 帧内预测编码部分的编码效率,提出了一种HEVC帧内预测编码编码单元(CU)结构快速选择算 法。算法通过 对CTU(coding tree unit)四叉树结构的遍历过程进行优化,设计了两种不同的最优CU结 构快速决策算 法,分别从最大划分深度和最小划分深度开始遍历,并在每一步遍历之前,判断是否提前终 止遍历操作。 同时,在对每个CTU进行求解时,依据其纹理复杂度和当前编码状态,从两种算法中选择出 最优快速决策 算法对其进行求解。在HM 15.0的基础上实现了提出的快速选择算法 。实验结果表明,本文算法能够在 保证编码性能的同时,降低31.14%的编码时间,提高了HEVC的编码效 率。     

CU encoding depth prediction,early CU splitting termination and fast mode decision for fast HEVC intra-coding

High Efficiency Video Coding (HEVC) is a new video coding standard achieving about a 50% bit rate reduction compared to the popular H.264/AVC High Profile with the same subjective reproduced video quality. Better coding efficiency is attained, however, at the cost of significantly increased encoding complexity. Therefore, fast encoding algorithms with little loss in coding efficiency is necessary for HEVC to be successfully adopted for real applications. In this paper we propose a fast encoding technique applicable to HEVC all intra encoding. The proposed fast encoding technique consists of coding unit (CU) search depth prediction, early CU splitting termination, and fast mode decision. In CU search depth prediction, the depth of encoded CU in the current coding tree unit (CTU) is limited to predicted range, which is mostly narrower than the full depth range. Early CU splitting skips mode search of its sub-CUs when rate distortion (RD) cost of current CU is below the estimated RD cost at the current CU depth. RD cost and encoded CU depth distribution of the collocated CTU of the previous frame are utilized both to predict the encoding CU depth search range and to estimate the RD cost for CU splitting termination. Fast mode decision reduces the number of candidate modes for full rate distortion optimized quantization on the basis of the low complexity costs computed in the preceding rough mode decision step. When all these three methods are applied, proposed fast HEVC intra encoding technique reduces the encoding time of the reference encoder by 57% on the average, with only 0.6% of coding efficiency loss in terms of Bjontegaard delta (BD) rate increase under the HEVC common test conditions.     

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

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

参数重用的HEVC多描述视频编码

为了提高视频编码的容错性能,保证视频经不可靠信道传输后的重建质量。本文提出了一种面向高效视频编码标准（High Efficiency Video Coding,HEVC）的基于参数重用的多描述视频编码方法。原始视频进行空间梅花下采样,生成四个行列交错的子序列,其中两个子序列采用标准编码器进行编码,并在编码过程中提取视频中每个编码单元（Coding Unit,CU）的深度信息、预测单元（Predicting Unit,PU）的分割方式以及帧内预测模式。而其余两个子序列利用已编码的视频序列信息,进行简化的编码过程。选取一个经标准编码的子序列,与一个简化编码的子序列,结合生成描述1,其余子序列生成描述2,不同描述分信道传输。多描述的编码结构可以保证即使只接收到单一描述也能保证视频的重建质量,参数重用的方法利用子序列间的相关性,减少了冗余信息,降低了编码开销。实验结果表明,参数重用的HEVC多描述视频编码针对高清视频编码效果明显,边缘解码质量PSNR值仅略低于中心解码0.7 dB,有效地提高了高清视频编码的容错性能。进行简化编码子序列的平均编码时间节省了91.7%,实现了高编码效率、低复杂度的HEVC容错编码。      

基于纹理方向和空域相关的HEVC帧内快速编码算法

为了降低高效视频编码(HEVC)的复杂度,提出了一种基于纹理方向和空域相关性的帧内快速编码算法。一方面,利用相邻编码单元(CU,coding unit)的最佳分割尺寸确定相关性的权重,并根据已编码CU的率失真代价值定义了CU分割尺寸的相关性因子,通过比较该因子提前终止CU分割;另一方面,利用Sobel算子求取预测单元(PU,prediction unit)子块的纹理方向,通过判定其纹理方向显著性确定相应的候选模式集,然后根据PU大小对所得的预测模式修正处理,最后遍历这些候选模式选取最优模式。实验结果表明:本文算法相对于原始HEVC编码方法,在全I帧模式下编码时间平均减少36.84%,BDBR(Bjntegaard delta bit rate)上升约0.81%,BDPSNR(Bjntegaard delta peak signal-to-noise rate)降低了0.047dB。     

基于朴素贝叶斯分类的DVC-HEVC快速转码

分布式视频编码(DVC)与传统视频编码之间的转码为移动终端设备之间的低功耗视频通信提供了一种有效的实现思路。以DVC与HEVC转码为研究对象,利用DVC解码端信息,针对高效视频编码(HEVC)中复杂度极高的编码单元(CU)划分过程进行复杂度优化研究。在DVC解码端提取与CU划分相关的纹理复杂度、运动矢量及预测残差3种特征信息;在HEVC编码端基于朴素贝叶斯原理建立CU快速划分模型,模型生成后便可以通过输入特征信息对当前CU划分进行快速决策,避免大量率失真(RD)代价计算过程。实验结果表明,本方案在编码比特率略有上升的情况下大幅缩短了HEVC编码时间,平均下降幅度达到58.26%,且几乎不影响视频质量。     

面向VVC帧内编码的快速CU划分和角度模式决策

多功能视频编码(versatile video coding,VVC)是最新的视频编码标准,与高效视频编码(high efficiency video coding,HEVC)相比进一步提高了压缩效率,但由于引入了包括二叉树和三叉树在内的多类树结构,同时帧内角度模式从35种增加到67种,导致编码复杂度剧增.为了降低计算...     

高效率视频编码帧内预测编码单元划分快速算法

高效率视频编码(HEVC)采用基于编码单元(CU)的四叉树块分区结构,能灵活地适应各种图像的纹理特征,显著提高编码效率,但编码复杂度大大增加,该文提出一种缩小深度范围且提前终止CU划分的快速CU划分算法。首先,在学习帧中,基于Sobel边缘检测算子计算一帧中各深度边缘点阈值,缩小后面若干帧中CU遍历的深度范围;同时,统计该帧中各CU划分为各深度的率失真(RD)代价,计算各深度的RD代价阈值。然后,在后续视频帧中,利用RD代价阈值在缩小的深度范围内提前终止CU划分。为了符合视频内容的变化特性,统计参数是周期性更新的。经测试,在平均比特率增加仅1.2%时,算法时间平均减少约59%,有效提高了编码效率。     

Early merge mode decision for texture coding in 3D-HEVC

As the upcoming 3D video coding standard, high efficiency video coding (HEVC) based 3D video coding (3D-HEVC) has been drafted. In 3D-HEVC, the computational complexity of mode decision process is significantly high due to exhaustive modes’ checks for coding units (CU) derived from recursive quad-tree partitioning. In this paper, we propose an early merge mode decision method for complexity reduction of dependent texture views. First, inter-view correlation and hierarchical depth correlation of coding modes are separately analyzed for B frame and P frame. Then, conditions to early determine merge mode coded CUs are derived based on the correlations. All of the early determined CUs only check merge modes in the mode decision process, which brings considerable complexity reduction. Experimental results demonstrate that the proposed method can achieve average 20.4% of encoding time saving for dependent texture views with negligible rate distortion performance loss.     

SVM based approach for complexity control of HEVC intra coding

The High Efficiency Video Coding (HEVC) is adopted by various video applications in recent years. Because of its high computational demand, controlling the complexity of HEVC is of paramount importance to appeal to the varying requirements in many applications, including power-constrained video coding, video streaming, and cloud gaming. Most of the existing complexity control methods are only capable of considering a subset of the decision space, which leads to low coding efficiency. While the efficiency of machine learning methods such as Support Vector Machines (SVM) can be employed for higher precision decision making, the current SVM-based techniques for HEVC provide a fixed decision boundary which results in different coding complexities for different video content. Although this might be suitable for complexity reduction, it is not acceptable for complexity control. This paper proposes an adjustable classification approach for Coding Unit (CU) partitioning, which addresses the mentioned problems of complexity control. Firstly, a novel set of features for fast CU partitioning is designed using image processing techniques. Then, a flexible classification method based on SVM is proposed to model the CU partitioning problem. This approach allows adjusting the performance-complexity trade-off, even after the training phase. Using this model, and a novel adaptive thresholding technique, an algorithm is presented to deliver video encoding within the target coding complexity, while maximizing the coding efficiency. Experimental results justify the superiority of this method over the state-of-the-art methods, with target complexities ranging from 20% to 100%.     

基于时空相关性的HEVC帧间模式决策快速算法

新一代的高效率视频编码标准HEVC采用编码树单元（CTU）四叉树划分技术和多达10种的帧间预测单元（PU）模式,有效地提高了编码压缩效率,但也极大地增加了编码计算复杂度。为了减少编码单元（CU）的划分次数和候选帧间PU模式个数,提出了一种基于时空相关性的帧间模式决策快速算法。首先,利用当前CTU与参考帧中相同位置CTU、当前帧中相邻CTU的深度信息时空相关性,有效预测当前CTU的深度范围。然后,通过分析当前CU与其父CU之间的最佳PU模式空间相关性,以及利用当前CU已估计PU模式的率失真代价,跳过当前CU的冗余帧间PU模式。实验结果表明,提出的算法与HEVC测试模型（HM）相比,在不同编码配置下降低了52%左右的编码时间,同时保持了良好的编码率失真性能;与打开快速算法选项的HM相比,所提算法进一步降低了30%左右的编码时间。     

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.     

一种基于时空相关性的编码单元深度快速分级判决算法

新一代视频编码标准HEVC采用编码树单元(CTU) 结构进行编码,通过遍历比较所有不同深度编码 单元(CU)的率失真代价值得到最佳编码单元,在显著提升编码效率的同时,计算复杂度增 加数倍。为此,本文提出了一种基于时空相关的编码单元深度快速分级判决算法,通过量化 分析时 空相邻CTU/CU之间相关性权重,利用已编码时空相邻CTU/CU的最佳深度预测当前CTU/CU可能 的深度范围(DR)和深度值, 跳过和提前终止不必要的深度计算。仿真结果表明,在不同的编码配置条件下,本文算法在 保证编码性能的同时,平均可节省40%以上的编码时间 ,极大地降低了计算复杂度。     

x265的低复杂度帧内编码快速算法

为了降低x265的帧内编码复杂度,减少编码所需时间,本文针对新一 代高效视频编码标准(HEVC)帧内编码单元(CU)划分以 及预测单元(PU)模式选择的快速算法进行研究。采用经典的差分矩阵计算纹理复杂度,提出 了一种根据当前编码单元子块的纹理复杂 相似度与其编码所需要的总比特数以及量化参数之间的关系作为提前终止CU划分的判决 条件,通过增加SATD的计算进一 步减少PU模式选择的RDO候选列表的个数从而减少率失真代价计算的快速算法。实验结果 表明,与x265的标准算法相比, 该算法在平均峰值信噪比(PSNR)仅减少0.028dB和码率平均增加1.27%的情况下,能够平均减少32.34%的帧内编 码时间。     

Fast motion and disparity estimation for HEVC based 3D video coding

The emerging international standard for high efficiency video coding (HEVC) based 3D video coding (3D-HEVC) is an extension of HEVC. In the test model of 3D-HEVC, variable size motion estimation (ME) and disparity estimation (DE) are both employed to select the best coding mode for each treeblock in the encoding process. This technique achieves the highest possible coding efficiency, but it brings extremely high computational complexity which limits 3D-HEVC from practical applications. In this paper, a fast ME/DE algorithm based on inter-view and spatial correlations is proposed to reduce 3D-HEVC computational complexity. Since the multi-view videos represent the same scene with similar characteristic, there is a high correlation among the coding information from inter-view prediction. Besides, the homogeneous regions in texture video have a strong spatial correlation, and thus spatially neighboring treeblocks have similar coding information. Therefore, we can determine ME search range and skip some specific ME and DE rarely used in the previously coded view frames and spatially neighboring coding unit. Experimental results demonstrate that the proposed algorithm can significantly reduce computational complexity of 3D-HEVC encoding while maintaining almost the same rate-distortion performance.     

基于零块分析的高效视频编码通信

为了实现高清、超高清视频实时编码通信传输, 针对高效视频编码(HEVC)帧间编码计算复杂度过高的问题,根据图像的文理复杂度和 编码单元的零块统计特征,提出一种新的HEVC快速帧间模式判决算法。根据Merge模式下 整单元一分为四的4个子编码单元纹 理相似度确定是否提前终止编码单元(CU)划分,同时利用帧间2N×2N预测模式下零系数与非零系数分布的区域统计特征,选择符合零块分 布特征的最佳预测单元(PU)模式。实验结果表明,在低延迟B(LDB,low-delay B)和随机访 问(RA,random access)配置条件下,提出的算法在保持编码 性能基本不变的情况下,HEVC帧间预测编码时间分别平均减少了60.2%与59.4%。     

基于决策树的HEVC SCC帧内编码快速算法

为减少HEVC屏幕内容编码的编码时间,提高编码 效率,本文提出了一种基于决策树的HEVC屏幕内容帧内编码快速 CU划分和简单PU模式选择的算法。对视频序列特性分析,提取有效的特征值,生成决策树模 型。使用方差、梯度信息熵和 像素种类数用于生成CU划分决策树,使用平均非零梯度、像素信息熵等用于生成PU模式分类 决策树。在一定深度的决策 树模型中,通过对相应深度的CU的特征值的计算快速决策当前CU的划分与PU模式的类型。这 种利用决策树做判决的算法 通过减少CU深度和PU的模式遍历而降低编码复杂度,达到快速帧内编码的效果。实验结果表 明,与HEVC屏幕内容的标 准算法相比,该算法在峰值信噪比(PSNR)平均下降0. 05 dB和码率 平均增加1.15%的情况下,能平均减少30.81% 的编码时间。     

Fast prediction unit selection method for HEVC intra prediction based on salient regions

In order to reduce the computational complexity of the high efficiency video coding(HEVC) standard, a new algorithm for HEVC intra prediction, namely, fast prediction unit(PU) size selection method for HEVC based on salient regions is proposed in this paper. We first build a saliency map for each largest coding unit(LCU) to reduce its texture complexity. Secondly, the optimal PU size is determined via a scheme that implements an information entropy comparison among sub-blocks of saliency maps. Finally, we apply the partitioning result of saliency map on the original LCUs, obtaining the optimal partitioning result. Our algorithm can determine the PU size in advance to the angular prediction in intra coding, reducing computational complexity of HEVC. The experimental results show that our algorithm achieves a 37.9% reduction in encoding time, while producing a negligible loss in Bjontegaard delta bit rate(BDBR) of 0.62%.     

Fast CU size and prediction mode decision method for HEVC encoder based on spatial features

In the high-efficiency video coding (HEVC) standard, intra prediction has higher computational complexity compared with H.264/AVC (advanced video coding) because of increasing the number of intra prediction modes and also higher number of coding unit (CU) sizes. The HEVC encoder evaluates 35 prediction modes on five possible prediction unit (PU) sizes to find the one with the minimum rate–distortion cost. Although this approach improves coding efficiency, it is very time-consuming. In this paper, we propose a fast intra prediction method to reduce the complexity of I-frame coding. The proposed method consists of three stages which is based on smoothness spatial feature. In the first stage, a measure is introduced to estimate CU smoothness by using sum of absolute differences (SAD) among CU pixels in four directions. By considering that a smooth region can be predicted with larger CUs, when the measured smoothness parameter is lower than a predefined threshold, only the prediction modes in the current CU are evaluated. In the second stage, the number of intra prediction modes is reduced based on the calculated SADs in the previous stage. In the last stage, if the first three candidate modes resulted from rough mode decision stage in the previous PU and the current PU are similar, then the best mode prediction of the previous PU is selected as the best candidate mode. Experimental results indicate that the proposed method can reduce the coding time on average to 43 % and maintain coding video quality, whereas bitrate increases negligibly (0.5 %).     

基于运动特征的HEVC快速帧间预测编码研究

为了降低高效视频编码(HEVC,high efficiency v ideo coding)的帧间预测复杂度,提出了一种基于运动特征的HEVC快速帧间预测新方 法。首先利用视频相邻帧的时域相关性,通过计算 每个待编码单元(CU)及其子块的帧差离散度(FDD)确定该CU的最佳编码深度d ;再依据该深度下CU的区 域运动特征(RMF_d)将待编码CU划分为3类运动区域,进而确 定该CU的候选帧间预测模式,减少 不必要的帧间预测模式遍历过程。试验结果表明,本算法可以在保证编码性能损失不大的前 提下显著提高编码效率;与标准算法相比,在低延时和随机访问两种编码结构下,同等客观 质量下码率(BDBR)分别增加0.89% 和0.83%,同时节省了51.6%和48.5%的编码时间。