Fast macroblock encoding algorithm based on rate-distortion activity for multiview video coding

Multiview video coding (MVC) is the appendix H of H.264/AVC, and it requires a great amount of time to compress multiple viewpoints׳ video with complex prediction structures. To reduce the whole computational complexity of MVC, this paper proposes a fast macroblock (MB) encoding algorithm based on rate-distortion (RD) activity, and it includes the fast mode decision and the fast motion/disparity estimation. First, the RD activity type of the current MB is calculated by utilizing the Skip/Direct RD cost and the average RD costs of classified MB modes. Then, through utilizing the RD activity type and RD costs of the estimated modes, the selection of candidate modes, the early decision of Skip/Direct mode, and the reduction of Inter8×8 mode estimation are all presented in the fast mode decision. By using the RD activity type and the correlations of vectors, the selection of search center and the prediction of search range are introduced in the fast motion/disparity estimation. In addition, the proposed algorithm can be applied to temporal and inter-view views as well as anchor and non-anchor frames. An experiment with a wide range of video scenes, camera setups and quantization parameters was implemented, and the results confirmed that the proposed algorithm can reduce the encoding time significantly while maintaining a similar RD performance as the original MVC encoder. Compared to the state-of-the-art algorithms, the proposed algorithm also demonstrated better performances in the various test cases.     

Multi-class support vector machine-based fast algorithm for 3D-HEVC depth video intra coding

The recursive splitting process of largest coding unit (LCU) and the mode search process of coding unit imposed enormous computational complexity on encoder. A multi-class support vector machine-based (MSVM) fast coding unit (CU) size decision algorithm for 3D-HEVC depth video intra-coding was proposed. The algorithm included two steps: off-line training and fast CU size and mode decision. In the process of off-line training, a MSVM model was constructed, where the texture complexity of current LCU, the optimal partition depth of its spatial neighboring LCU and co-located LCU in texture video were treated as feature vectors, and the optimal partition depth of LCU was utilized as corresponding class label. In the process of fast CU size and mode decision, features of LCU were extracted before cod-ing a LCU, then, a MSVM model was used to predict the class label. Finally, the class label that represents the largest parti-tion depth of the current LCU was employed to terminate the CU recursive splitting process and CU mode search process. Experimental results show that the proposed algorithm saves the encoding time of 3D-HEVC by 35.91% on average, and the encoding time of depth video by 40.04% on average, with negligible rendered virtual view image degradation.     

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.     

基于转移概率的多视点视频快速模式选择算法

针对多视点视频编码(MVC)中部分大宏块模式(SKI P/DIRECT模式,帧间16×16模式)相对于其它模式的计算复杂 度低,并且在编码所确定的最优模式中占有相当高比重的特点,本文提出一种基于转移概率 的多视点视频 快速模式选择算法。首先根据多视点视频当前编码宏块对应时间和视点间宏块及周围宏块的 位置几何关系, 建立宏块模式参考模型;其次比较参考模型中模式的时间相似度和视点间相似度;最后计算 模式之间的转 移概率,确定提前结束大宏块模式选择过程的阈值。实验结果表明,本文所提出的快速算法 平均节约MVC时间80.93%,编码质量平均下降0.04dB,码率平均增加0.27%。     

Content-adaptive motion estimation algorithm for coarse-grain SVC

A joint model of scalable video coding (SVC) uses exhaustive mode and motion searches to select the best prediction mode and motion vector for each macroblock (MB) with high coding efficiency at the cost of computational complexity. If major characteristics of a coding MB such as the complexity of the prediction mode and the motion property can be identified and used in adjusting motion estimation (ME), one can design an algorithm that can adapt coding parameters to the video content. This way, unnecessary mode and motion searches can be avoided. In this paper, we propose a content-adaptive ME for SVC, including analyses of mode complexity and motion property to assist mode and motion searches. An experimental analysis is performed to study interlayer and spatial correlations in the coding information. Based on the correlations, the motion and mode characteristics of the current MB are identified and utilized to adjust each step of ME at the enhancement layer including mode decision, search-range selection, and prediction direction selection. Experimental results show that the proposed algorithm can significantly reduce the computational complexity of SVC while maintaining nearly the same rate distortion performance as the original encoder.     

Early SKIP mode decision for MVC using inter-view correlation

In the joint multiview video model (JMVM) proposed by JVT, the variable block-size motion estimation (ME) and disparity estimation (DE) have been employed to determine the best coding mode for each macroblock (MB). These give a high coding efficiency for multiview video coding (MVC), however, they cause a very high computational complexity in encoding system. This paper proposes to reduce the complexities of the ME and DE processes with an early SKIP mode decision algorithm based on the analysis of prediction mode distribution regarding the corresponding MBs in the neighbor view. In this method, the mode decision procedures of most of MBs can be early terminated, and thus much of computation for ME and DE can be greatly reduced. Simulation results demonstrate that our algorithm can achieve computational saving of 46–57% (depending on the tested sequences) with no significant loss of rate-distortion performance.     

Efficient Mode Decision Algorithm Based on Spatial,Temporal, and Inter‐layer Rate‐Distortion Correlation Coefficients for Scalable Video Coding

The layered coding structure of scalable video coding (SVC) with adaptive inter‐layer prediction causes noticeable computational complexity increments when compared to existing video coding standards. To lighten the computational complexity of SVC, we present a fast algorithm to speed up the inter‐mode decision process. The proposed algorithm terminates inter‐mode decision early in the enhancement layers by estimating the rate‐distortion (RD) cost from the macroblocks of the base layer and the enhancement layer in temporal, spatial, and inter‐layer directions. Moreover, a search range decision algorithm is also proposed in this paper to further increase the motion estimation speed by using the motion vector information from temporal, spatial, or inter‐layer domains. Simulation results show that the proposed algorithm can determine the best mode and provide more efficient total coding time saving with very slight RD performance degradation for spatial and quality scalabilities.     

低复杂度的多视点视频编码宏块模式决策算法

为了降低多视点视频编码(MVC)的计算复杂度,提出了一种基于全局-局部率失真代价的低复杂度宏块模式决策算法。首先根据宏块候选模式的块尺寸和率失真代价特点,将所有候选模式分为大尺寸模式(Skip/Direct、Inter16×16和Intra16×16)和小尺寸模式(Inter16×8、Inter8×16、Inter8×8、Intra8×8和Intra4×4);接着统计已编码帧中这两类宏块模式的平均率失真代价,并利用这些平均率失真代价计算当前帧宏块模式决策的全局率失真代价;最后利用得到的全局率失真代价,并结合当前宏块已估计模式的局部率失真代价和空间邻近宏块的模式信息提前终止模式决策,具体包括对大尺寸宏块模式进行提前判定以及对小尺寸候选模式进行逐级选择。实验结果表明:与MVC参考代码中的全搜索模式决策算法相比,本文算法在时域预测视点和视点域预测视点上分别节省了74%和82%的平均编码时间,同时保持了良好的编码率失真性能;与现有模式决策快速算法相比,本文算法降低了更多的编码时间,并具有更好的编码率失真性能。     

采用率失真与模式特征的多视点视频编码快速模式选择

现有的多视点视频编码使用了分层B帧（Hierarchical B Picture, HBP）的预测结构,其帧内预测、帧间预测以及视点间预测的模式选择给多视点视频编码带来了庞大的计算复杂度。针对这一问题,我们在分析了JMVC模式分布比例的基础上,提出了一个快速帧间模式选择的算法。这种算法利用率失真代价和预测模式特征之间的关系来及时判定最优模式:如果上一尺寸预测模式的率失真代价小于当前尺寸预测模式的率失真代价则认为上一预测模式为最优模式,跳过检查其他更小尺寸的预测模式;反之,如果上一尺寸的预测模式的率失真代价大于当前尺寸的预测模式的率失真代价,则继续检查其他更小的尺寸。这样,通过提前终止一些不必要的模式选择过程,多视点视频编码的计算量得到大幅的降低。实验结果表明:所提算法能在保持JMVC中全搜索算法的编码效率同时,使计算复杂度减少了81.66%。      

A novel fast intra mode decision for versatile video coding

The latest video coding standard Versatile Video Coding (VVC) obtains superior coding efficiency compared to the High Efficiency Video Coding (HEVC), which is achieved by incorporating more effective and complex new coding tools. In this paper, we propose a novel fast intra mode decision algorithm for VVC, including following two strategies: (1) the correlation between the optimal modes of the adjacent blocks and the modes selected in the rough modes decision (RMD) process is analyzed and applied to reduce the modes in the candidate list; (2) modes in the candidate list are sorted in ascending order according to the modes’ cost calculated in the RMD process. An early termination method is proposed for terminating the optimal prediction mode decision process based on this new order early. These two strategies are incorporated into intra coding to reduce the coding complexity. Since these two strategies do not add any additional computational complexity, the proposed fast algorithm can achieve more complexity reduction. The experimental results show that the complexity reduction of the proposed algorithm is up to 44.74% compared to VVC reference software VTM2.0, and averagely 30.59% encoding time saving with 0.86% BDBR increase.     

Improved mode decision algorithm based on residues and early zero block detection in H.264/AVC

Video compression standard H.264/AVC outperforms previous standards in terms of coding efficiency but at the cost of higher computational complexity. In H.264/AVC, the variable block size full motion estimation is the most time-consuming operation. This paper presents a method to reduce the complexity of motion estimation in two stages. The first stage exploits the similarities between frames for early SKIP mode decision for a macroblock (MB) based upon a criteria formulated on the basis of the statistics of the frame difference residues. MBs that fail to qualify for the SKIP mode in the first stage spills over to the second stage where mode decision depends upon the number of zero blocks (ZB) in the MB. The study of the full search motion estimation on different sequences show that there is a strong dependence between the number of ZBs in a MB and the likelihood of a particular mode being selected. The proposed algorithm utilizes this relationship for early mode decision for a MB. The algorithm is evaluated using a wide range of test sequences from different classes. Experimental results show that the proposed algorithm gives considerable saving in encoding time and search points in the range of 36–87%. Furthermore, despite the reduction in computational complexity, the coding efficiency (picture quality and bitrate) in the proposed method is comparable to the H.264/AVC standard software Joint Model (JM12.4).     

一种快速的SVC多模式决策方法

H.264/AVC SVC为了提供一种可伸缩的视频编码解决方案,增加了许多宏块模式的组合,从而导致模式决策的计算量大幅度增加。本文提出了一种面向SVC的快速多模式决策算法,该方法首先利用模式在层间、帧间和空间的相关性,决定当前宏块的起始搜索模式,然后利用相邻运动向量的差异性决定是否合并或拆分当前分块进行细化搜索。从测试结果来看,本算法在率失真性能不降低的情况下,令模式决策的运算速度提高了数倍。     

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

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

Fast mode-decision for H.264/AVC based on inter-frame correlations

The H.264/AVC standard yields higher coding efficiency rates than other video coding standards. This is because it uses the rate-distortion optimization (RDO) technique, which selects the optimal coding mode and a reference frame for each macroblock (MB). In order to achieve this, the encoder has to encode a given block by exhaustively using all kinds of combinations (including different intra and inter-prediction modes). As a result, the computational complexity of video coding in H.264/AVC is extremely high. In this paper, two fast intra-/inter-mode-decision algorithms are proposed to reduce the complexity of the encoder. Both of these algorithms are based on the inter-frame correlation among adjacent pictures. For the fast intra-mode-decision, we used the intra-mode of the most-correlated MB at the reference frame to encode the current MB and the stationary property of the current MB was used for the fast inter-mode-decision. The simulation results show that the proposed algorithms significantly reduced the computational complexity with a negligible loss of PSNR and a slight increase in bitrate.     

一种适宜于H.264/AVC的帧间快速编码算法

针对新一代视频编码技术H.264/AVC编码计算复杂 度较高,为提高其编码速度,提出了一种新的适宜于H.264/AVC 的帧间快速编码算法。首先利用运 动和纹理预测可能的编码模式,排除可能性较小的模式;然后利用时间和空间相关性预测各 种编码模式的 可能性大小和编码顺序,并结合相关性和量化参数利用率失真和残差系数提前终止。实验结 果表明,本文算法编码速度能提高72%左右,同时对编码效率影响很小。     

基于纹理相似性的高效视频编码帧间预测优化算法

为了提高高效率视频编码(HEVC)的编码效率,该文对帧间预测算法进行优化,提出一种基于纹理相似性的快速深度判决算法。随着视频分辨率的提高,视频序列中的空域冗余也随之增加,HEVC通过增加编码块尺寸来提高预测效率,代价就是编码复杂度的急剧增加。通过对视频序列分析可知,图像中的平滑区域与细节区域在相邻帧中存在很大的相关性。该文利用相邻已编码帧的相邻编码块的深度信息,来快速判决当前待编码块的深度信息。对于平滑区域,快速判决待编码最大编码单元的最大深度,以减少小块编码单元的模式判决;对于细节区域,快速判决待编码最大编码单元的最小深度,以减少大块编码单元的模式判决。实验结果表明,与原始的HEVC算法相比,该文所提算法编码比特率平均增加约0.13%以内,PSNR的平均降幅为0.09 dB,算法运行时间平均减少了约50%。     

Low-Cost H.264/AVC Inter Frame Mode Decision Algorithm for Mobile Communication Systems

One of the important issues of green mobile networking is the low energy consumption for either mobile devices or transmissions. To adapt this, a low-cost Inter frame mode decision (MD) algorithm is proposed for H.264/AVC encoder to reduce the computational complexity of the original encoding procedure in this paper. The information extracted from macroblock (MB), such as energy, temporal domain mode similarity and so on, which can be used to pre-estimate the optimal mode of the MB is investigated and utilized to eliminate the redundant mode candidates. The performance evaluations including quantitative analysis and PC simulations show that the proposed algorithm is an energy-efficient source coding because it can reduce around 85% Inter frame encoding time with little quality loss. It can be widely implemented in green mobile networking systems with H.264/AVC standard to realize the real-time video signal coding.     

基于结构张量的H.266帧内预测快速算法

新一代视频编码标准H.266将帧内预测模式从35种扩展到67种,提高预测准确率的同时大大增加了编码的计算复杂度。本文根据视频内容纹理方向和帧内预测模式选择相关性强的特点提出了一种基于结构张量的H.266帧内预测模式快速选择算法,以编码单元CU为单位,计算其结构张量矩阵,再依据结构张量奇异值分解后得到的特征向量来确定当前CU的纹理方向,缩小候选模式的选择范围,减少进行代价计算的模式数量。实验结果表明,在全I帧条件下,该算法相较于H.266 VTM-7.3标准平台在节省17.28%编码时间的同时只增加1.12%的码率,有效地降低了编码复杂度。      

Coding statistics based fast mode decision for multi-view video coding

Reduction of high computational complexity of multi-view video coding (MVC) is necessary for realization in consumer electronics. Since mode decision is one of the key computational bottlenecks of multi-view video encoders, this paper proposes a coding statistics based fast mode decision algorithm. First of all, a rate–distortion cost based fast DIRECT mode decision algorithm early terminates the mode decision process if possible. Next, the candidates for Inter modes are reduced by taking the advantage of the correlation between an optimal mode and motion cost. The proper thresholds to reduce the candidates for the above two fast algorithms can be easily derived from exponential functions at run time. Finally, motion vector difference based motion characteristics is referred to further speed up the mode decision process of Inter modes. The experimental results show that the proposed scheme reduces up to 70.82% of encoding time with negligible degradation of RD performance.     

Alternating asymmetric search range assignment for bidirectional motion estimation in H.265/HEVC and H.264/AVC

Bidirectional motion estimation (ME) significantly enhances video coding efficiency, whereas its huge complexity is also a critical problem for implementation. This paper presents alternating asymmetric search range assignment (AASRA) schemes to reduce the complexity by switching the use of a large and a small search ranges (SR.L and SR.S). A temporal AASRA (T-AASRA) scheme performs search range switching between past and future reference directions. A temporal-spatial AASRA (TS-AASRA) scheme performs more aggressive switching on the two dimensions of reference direction and MB/CTB index. T-AASRA and TS-AASRA achieve 43.5% and 65.2% complexity reduction, respectively, with small coding efficiency drop. Even after removing the factor of coding efficiency drop, the two schemes still show 38.4% and 54.7% equivalent complexity reduction. AASRA can also be combined with existing fast algorithms for further complexity saving, which has been demonstrated on hierarchical ME and dynamic search range selection algorithms.