基于LightGBM的HEVC编码单元快速划分算法

针对高效视频编码帧间预测过程中,编码单元率失真代价计算导致编码复杂度较高的问题,提出一种基于LightGBM的高效视频编码标准（High Efficiency Video Coding,HEVC）快速划分算法。算法将编码单元（Coding Unit,CU）的划分情况视为分类问题,采用LightGBM对CU块进行划分分类预测。实验结果表明,在低时延模式下,该算法与标准编码器相比,平均码率变换率增加1.95%,平均节省的编码时间效率为27.72%,具有较高的编码效率。     

利用深度学习的HEVC帧内编码单元快速划分算法

新一代视频编码标准高效视频编码(High Efficiency Video Coding,HEVC)中编码单元(Coding Unit,CU)大小不同的特性使得编码效率得到显著提升,但同时带来了极高的计算复杂度.为了去除CU划分中多余的计算从而降低编码复杂度,本文提出了一种利用深度学习的编码单元快速划分算法.首先使用原始视频亮度块及编码信息建立了一个HEVC中CU划分的数据库,用于接下来本文深度学习神经网络的训练.然后,为了更好地贴合编码单元划分的层级结构,本文提出了一种基于Inception模块的神经网络结构,使之内嵌于HEVC编码框架中对编码单元的划分进行提前预测,有效地去除了All Intra配置下中冗余的CU划分计算.实验结果表明,本文提出的算法与HEVC官方测试模型(HM16.12)相比,编码时间平均降低了61.31%,而BD-BR与BD-PSNR仅为1.86%和-0.13dB.     

基于背景帧的监控和会议视频帧间快速算法

为降低高性能视频编码（High Efficiency Video Coding,HEVC）中监控和会议视频的编码复杂度,减少编码时间,提出了一种基于虚拟背景帧的监控和会议视频帧间编码的快速编码单元（Coding Unit,CU）划分和预测单元（Prediction Unit,PU）模式选择算法。对原始视频序列进行像素统计分析生成虚拟背景帧,利用生成的虚拟背景帧对CU分类。通过分析不同类别的CU继续划分的比例和其纹理复杂度,快速决策当前CU的划分和PU的模式类型。这种利用虚拟背景帧做判决的算法通过减少CU深度和PU模式遍历而降低编码复杂度,达到快速帧间编码的效果。实验结果表明,与HM16.9相比,该算法在峰值信噪比（Peak Signal-to-Noise Ratio,PSNR）平均下降0.07 dB和码率平均增加1.93%的情况下,能平均减少33.31%的编码时间。     

联合深度视频增强的3D-HEVC帧内编码快速算法

目的 针对高效3维视频编码标准（3D-HEVC）深度视频编码复杂度高和获取不准确的两个问题,现有算法单独进行处理,并没有进行联合优化。为了同时提升深度视频编码速度和编码效率,提出一种联合深度视频增强处理和帧内快速编码的方法。方法 首先,引入深度视频空域增强处理,消除深度视频中的虚假纹理信息,增强其空域相关性,为编码单元（CU）划分和预测模式选择提供进一步优化的空间;然后,针对增强处理过的深度视频的空域特征,利用纹理复杂度将CU进行分类,提前终止平坦CU的分割过程,减少了CU分割次数;最后,利用边缘强度对预测单元（PU）进行分类,跳过低边缘强度PU的深度模型模式。结果 实验结果表明,与原始3D-HEVC的算法相比,本文算法平均节省62.91%深度视频编码时间,并且在相同虚拟视点质量情况下节省4.63%的码率。与当前代表性的帧内低复杂度编码算法相比,本文算法深度视频编码时间进一步减少26.10%,相同虚拟视点质量情况下,编码码率节省5.20%。结论 该方法通过深度视频增强处理,保证了虚拟视点质量,提升了编码效率。对深度视频帧内编码过程中复杂度较高的CU划分和预测模式选择分别进行优化,减少了率失真代价计算次数,有效地降低了帧内编码复杂度。     

基于深度预测的HEVC编码单元快速划分算法

高效视频编码HEVC(High Efficiency Video Coding)采用计算复杂度较高的率失真优化方法对编码单元CU(Coding Unit)划分进行判决,具有较高的时间复杂度,编码所需时间较长。为降低HEVC编码复杂度,加快编码速度,提出一种基于深度预测的CU快速划分算法。首先依据当前CU与周围相邻CU和参考帧中当前位置CU的深度相关性,预测当前CU的最优深度,然后使用相邻相关分割法或依据当前CU深度和预测深度的关系对当前CU进行递归划分。为减少预测带来的误判,在CU深度级别由2级到3级的划分中,使用率失真或百分比的方式进行二次判定。实验结果表明,该算法与原始的HEVC编码方法相比,在亮度峰值信噪比减小0.07 d B,编码比特率增加0.88%的情况下,整体编码单元划分时间缩短37.7%,具有较高的时间效率。     

基于运动特性的HEVC帧间模式快速决策算法

针对高性能视频编码采用四叉树结构大大增加了编码复杂度的问题,提出了一种基于运动特性的帧间模式快速决策算法。首先,对不同运动区域下的编码单元（Coding Unit,CU）块,利用当前CU与空时域相邻CU深度相关性减少当前CU深度的遍历范围;然后,依据当前CU与其时空域相邻CU及上一深度CU对应的预测单元（Prediction Unit,PU）在空间划分上的相似性,减少PU模式的遍历范围,加速帧间预测过程。实验结果表明,相比于HM16.9,在不同编码接入方式下该算法可平均降低54%左右的编码时间,且输出比特率增加较少。     

高效视频编码帧内快速深度决策算法

针对新一代高效视频编码（HEVC）帧内预测中编码单元（CU）的编码深度选择过程中计算复杂度较高的问题,提出了一种基于空域相关性的帧内快速深度决策算法。首先,利用相邻已编码树单元（CTU）的深度通过线性加权得到当前CTU深度估计值;然后,对当前CTU深度估计值设置较为合适的深度双阈值提前终止编码树单元的划分或跳过CTU的某些深度,来缩小当前CTU的深度范围,从而减少不必要的深度计算。实验结果表明：与HM12.0相比,所提算法对比较简单的视频序列编码时间的减少比较明显,在亮度峰值信噪比（Y-PSNR）几乎不变的情况下（平均降低0.02 dB）,编码时间平均减少了34.6%。此外,所提算法容易与其他算法进行融合,能进一步降低HEVC的帧内计算复杂度,最终达到实时传送高清视频的目的。     

基于局部边界特性的HEVC帧内快速预测算法

HEVC(High Efficiency Video Coding)的编码性能足可以达到H.264/AVC的两倍。在帧内编码方面HEVC的性能提高主要来自于更精准的预测模式和更灵活的分块大小,同时带来了巨大的计算复杂度。为了大幅降低编码复杂度,提出的算法利用视频的局部纹理特性,首先用索贝尔算子提取当前编码单元CU(Coding Unit)的局部边界信息。分析边界信息后,停止不包含明显边界的CU的子块划分,对包含明显边界的CU快速选择预测方向为边界纹理方向。实验结果证明,提出的算法可以在视频质量基本不变的情况下,使帧内编码复杂度降低近一半。     

针对HEVC编码单元的二分深度划分算法

为了降低高效率视频编码（HEVC）的编码单元（CU）进行四叉树递归遍历的时间,提出一种改进的编码单元快速划分算法.首先,利用帧间时间域的相关性,提取前一帧相同位置CU的最优划分结构,以预测当前CU的划分深度;然后通过改进编码CU结构划分遍历的算法,减少CTU （Coding Tree Unit）四叉树结构的遍历,即从二分深度开始遍历,在每一步遍历之前,判断是否提前终止遍历.实验表明,与HM15.0中的基准划分算法相比,本文算法能够在保证编码性能的同时,降低了55.4%的编码时间,提高了HEVC的编码效率.     

基于纹理主方向强度的HEVC帧内快速分层算法

为降低高效视频编码帧内预测过程的计算复杂度,提出一种基于纹理主方向强度的快速帧内预测算法。根据每一深度层编码单元(CU)分布特点,并结合每块CU纹理主方向强度判断CU是否需要进行分割处理。在深度层为0和1的CU块上统计4×4块的纹理方向,确定当前CU的纹理主方向强度,判断其纹理复杂度。在深度为2和3的CU上结合像素方差,以像素点为单位计算相应CU的纹理主方向强度。通过实验训练序列获得恰当的阈值,自适应提前终止编码单元的划分,减少帧内预测的编码复杂度。实验结果表明,在保证信噪比和比特率基本不变的条件下,与平台HM15.0相比,该算法编码时间平均节省51.1%。     

Fast encoding algorithm for high-efficiency video coding (HEVC) system based on spatio-temporal correlation

Video compression technology is an important research part to the intelligent user interface for interactive multimedia system using technologies and services such as image processing, pattern recognition, computer vision and cloud computing service. Recently, high-efficiency video coding (HEVC) has been established as the demand of very high-quality multimedia service like ultrahigh definition video service. High-efficiency video coding (HEVC) standard has three units such as coding unit (CU), prediction unit (PU) and transform unit. It has too many complexities to improve coding performance. We propose a fast algorithm which can be possible to apply for both CU and PU parts. To reduce the computational complexity, we propose CU splitting algorithm based on rate–distortion cost of CU about the parent and current levels to terminate the CU decision early. In terms of PU, we develop fast PU decision based on spatio-temporal and depth correlation for PU level. Finally, experimental results show that our algorithm provides a significant time reduction for encoding with a small loss in video quality, compared to the original HEVC Test Model (HM) version 10.0 software and the previous algorithm.     

Fast transcoding from H.264 to HEVC based on region feature analysis

The new video coding standard, High Efficiency Video Coding (HEVC), achieves much higher coding efficiency than the state-of-the-art H.264. Transcoding H.264 video to HEVC video is important to enable gradual migration to HEVC. Therefore, a fast H.264 to HEVC transcoding algorithm based on region feature analysis is proposed. First, each frame is segmented into three regions in units of coding tree unit (CTU) based on the correlation between image coding complexities and coding bits of the H.264 source stream. Then the searching depth range of each CTU is adaptively decided according to the region type. After that, motion vectors are de-noise filtered and clustered in order to analyze the region features of coding unit (CU). Based on the analysis results, the minimum searching depth of CU and partitions of prediction unit (PU) are optimally selected, and the motion vector predictor and search window size of motion estimation are also optimally decided for further reduction of the computational complexity. Experimental results show that the proposed algorithm achieves a significant improvement on transcoding speed, while maintaining high Rate-Distortion performance.     

An early split and skip algorithm for fast intra CU selection in HEVC

The rapid development and increase of multimedia applications, as well as the demand for higher video-quality services at restricted resources such as storage capacity, transmission bandwidth and power consumption, has brought the urgent need for more efficient video compression techniques. The new video coding standard high efficiency video coding (HEVC) has a significant superiority over its predecessor advanced video coding (AVC). HEVC is reported to halve the bit rate with the same visual quality, or a better quality with the same bit rate when compared with AVC. Beside other improvements, HEVC significantly gets its power from the use of dynamic hierarchical quad-tree structure by partitioning the frames into smaller regions called coding units (CU), by means of a rate–distortion optimization process. However, this improvement yields to a dramatic increase of high computational complexity and increased encoding time, which primarily restricts its adaptation in real-time applications. In this paper, we proposed an early CU determination algorithm for fast encoder realization to reduce the encoding time which is the most important part of the standard standing for development. The experimental results show that the proposed algorithm has approximately 45 % encoding time saving with a 4.6 % bit-rate increment, on average.     

An effective CU size decision method for quality scalability in SHVC

The Scalable extension of the High Efficiency Video Coding (known as SHVC) combines the high compression efficiency with the possibility of encoding different resolutions of the same encoded video in a single bitstream. However, this is accompanied with a high computational complexity. In this paper, we propose an effective coding unit (CU) size decision method by restricting the CU depth range to reduce the encoding time for quality scalability in SHVC. Since the optimal depth level in the enhancement layer (EL) is highly correlated to that in the base layer (BL), we can determine the CU depth range in the EL according to the depth of the co-located CU in the BL. Based on the high correlation between the current CU and its spatio-temporal neighboring CUs, the proposed method skips some specific depth levels which are rarely used in the previous frame and neighboring CUs to further reduce the computational complexity. Experimental results demonstrate that the proposed method can efficiently reduce computational complexity while maintaining similar rate distortion (RD) performance as the original SHVC encoder.     

基于纹理特性与空域相关的高效视频编码帧内分级快速算法

为了降低高效视频编码(HEVC)标准的编码复杂度,提出一种基于纹理特性与空域相关性的帧内分级快速算法。首先,采用最大编码单元(LCU)级的快速算法,通过利用相邻LCU的编码深度值加权预测得到当前LCU的预测深度,并利用块标准差和自适应阈值策略确定当前LCU的纹理复杂度,将当前LCU的预测深度和纹理复杂度相结合来预测当前LCU的最有可能深度范围(MPDR);其次,采用编码单元(CU)级的深度判决快速算法(CUDD-FA),将基于边缘图的CU深度预判策略和基于率失真(RD)代价相关性的CU提前中止策略相结合,实现了CU级深度的提前确定,进一步降低了帧内编码复杂度。与原始HEVC算法相比,所提算法在全I帧编码模式下编码时间平均减少41.81%,BD-rate(Bjøntegaard Delta bit rate)仅上升0.74%,BDPSNR(Bjøntegaard Delta Peak Signal-to-Noise Rate)仅降低0.038 dB;与代表性文献算法相比,所提算法在编码时间节省更多的情况下率失真性能更好。实验结果表明,在率失真性能损失可以忽略不计的前提下,所提算法能有效降低HEVC帧内编码复杂度,特别是高分辨率视频序列,有利于HEVC的实时视频应用。     

基于决策树的HEVC编码单元划分算法

为了有效降低高效视频编码标准HEVC编码过程中的计算复杂度,提出了一种基于决策树的编码单元划分算法。该算法将编码单元划分问题归为分类问题,提取编码单元的划分信息到决策树模型中进行学习,得到决策树分类器。利用分类器对满足分类条件的编码单元进行划分,跳过了率失真计算,从而降低了视频编码的计算复杂度。实验结果表明,本算法在保证视频质量的同时有效降低了编码计算复杂度。     

Boundary correlation-based intracoding for SHVC algorithm and its efficient VLSI architecture

Scalable high-efficiency video coding (SHVC) can provide variable video quality according to terminal devices. However, a computational complexity of SHVC is increased by introducing new techniques based on high-efficiency video coding (HEVC). In this paper, a hardware-oriented low complexity algorithm is proposed for the reference software of SHVC (SHM11.0). In our proposed algorithm, an optimal coding unit depth is determined by analyzing the boundary correlation in a coding tree unit before encoding starts. Simulation results show that the proposed algorithm can achieve over 62% computation complexity reduction comparing to the original SHM11.0. Compared with other related work, over 11% time saving has been achieved without PSNR loss. Moreover, to confirm the efficacy of the proposed algorithm, a hardware architecture is designed targeting on the CU depth decision algorithm. Synthesis results show that the hardware cost is about 1.8K gate and achieve a scalable working clock frequency in the case of FPGA (CycloneV) implementation.     

基于梯度的H.265/HEVC帧内预测硬件加速算法研究

HEVC即H.265,是目前最新的视频编码标准。相比于前一代视频编码标准,H.265/HEVC虽然能够明显改善视频压缩效率,但是却带来了更高的计算复杂度,尤其是在帧内预测过程中。为了解决这个问题,提出一种基于梯度的帧内预测硬件加速算法来跳过一些帧内预测模式和划分深度的预测过程,从而达到减少计算的目的。利用图像梯度信息来粗略估计编码单元的纹理方向和纹理复杂度,其中纹理方向用来估计编码单元的最优帧内预测方向,纹理复杂度用来判断是否跳过当前划分深度的预测编码过程。实验表明,相比于H.265/HEVC测试模型HM16.18,本文提出的算法能够减少6059%的编码时间,仅造成0.38 dB的BD PSNR减少和8.52%的BD-Rate增加。