H.264/AVC中基于决策树的P帧快速模式选择

目的 H.264/AVC帧间预测编码需要对所有可能编码模式计算并比较率失真代价,众多的模式类型导致了P帧编码的计算复杂度非常高。为此提出一种针对P帧的基于决策树的快速候选模式选择算法。方法在对宏块进行16×16的帧间运动估计后,首先根据残差宏块中4×4全零系数块个数对部分宏块直接选择出候选模式;然后使用16个4×4块的变换域系数绝对值之和(SATD)值,采用决策树分类方法对其余宏块选择候选模式。结果由于只需对候选模式进行编码,因此有效降低了编码器的计算复杂度。实验结果表明,与原始全搜索编码算法相比,该算法对不同运动程度的视频序列获得了较一致的编码时间的节省,同时平均峰值信噪比的损失和平均比特率的增加均较少。结论新的P帧帧间预测候选模式选择算法,根据帧间运动估计后的残差宏块信息,采用决策树方法对候选模式集进行分类。实验结果表明,该算法能在保证视频编码质量的前提下,有效地降低编码过程中的计算量,缩短编码时间。     

Fast multiframe motion estimation algorithms by motion vector composition for the MPEG-4/AVC/H.264 standard

The MPEG-4/AVC/H.264 video coding standard adopts various coding schemes such as multiple reference frames and variable block sizes for motion estimation. Hence, MPEG-4/AVC/H.264 provides gains in compression efficiency of up to 50% over a wide range of bit rates and video resolutions compared to previous standards. However, these features result in a considerable increase in encoder complexity, mainly regarding to mode decision and motion estimation. The proposed algorithms use the stored motion vectors to compose the motion vector without performing the full search in each reference frame. Therefore, the proposed algorithms can obtain an average speed up ratio of four for encoding, thus benefiting from the prediction of the motion vector for the reference frames in advance and maintaining good performance. Any fast search algorithm can be utilized to further largely reduce the computational load.     

H.264/AVC中基于决策树的P帧快速模式选择（HHME2013第61号论文）

目的：H.264/AVC帧间预测编码需要对所有可能编码模式计算并比较率失真代价,众多的模式类型导致了P帧编码的计算复杂度非常高。本文提出了一种针对P帧的基于决策树的快速选择候选模式算法。方法：在对宏块进行16×16的帧间运动估计后,首先根据残差宏块中4×4全零系数块个数对部分宏块直接选择出候选模式;然后使用16个4×4块的SATD值,采用决策树分类方法对其余宏块选择候选模式。结果：由于只需对候选模式进行编码,因此有效降低了编码器的计算复杂度。实验结果表明,与原始全搜索编码算法相比,该算法对不同运动程度的视频序列获得了较一致的编码时间节省,同时平均峰值信噪比的损失和平均比特率的增加均较少。结论：本文提出了一种新的P帧帧间预测候选模式选择算法,根据帧间运动估计后的残差宏块信息,采用决策树方法对候选模式集进行分类。实验结果表明,该算法能在保证视频编码质量的前提下,有效地降低编码过程中的计算量,缩短编码时间。     

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.     

H.264中4×4块的快速帧内预测算法

视频压缩标准H.264/AVC的压缩率很高,但其算法复杂,编码时间较长。针对帧内4×4块提出基于方向预测模式度量的快速预测算法,通过对当前4×4块帧内预测方向的度量,利用相邻块和相邻方向预测模式的相关性进行帧内模式预测。实验结果表明,与全搜索算法相比,在采用全I帧编码的情况下,该算法的编码时间减少43%,输出的视频比特率仅增加0.8%,且PSNR基本保持不变。     

All-layer search algorithm using mean inequality and improved checkerboard partial distortion search for fast motion estimation

Block-matching motion estimation algorithm is used in many video compression coding systems because it could greatly reduce the temporal redundancy between the consequent video sequences. In this paper, an all-layer search algorithm using mean inequality and improved checkerboard partial distortion search scheme for fast block-matching motion estimation is proposed. A layer in the proposed method refers to a processed image which is derived from the reference frame or the adjacent lower layer. Firstly, the proposed algorithm constructs all layers from the reference frame or the adjacent lower layer by summing up all pixels over a sub-block. Then, a new mean inequality elimination method is introduced to reject a lot of unnecessary candidate search points on the top layers before calculating the real block matching distortion. Finally, the proposed algorithm utilizes an improved checkerboard partial distortion search scheme in the process of the real block distortion calculation on the following layers to further reduce the amount of computation. Experimental results show that the proposed algorithm can effectively reduce the computational complexity of motion estimation meanwhile guarantee the matching quality compared to other motion estimation algorithms. Compared to the full search algorithm, the proposed algorithm can reduce 97.30 % computational complexity with a negligible degradation of the peak signal to noise ratio (PSNR). Compared to the diamond search algorithm, directional gradient descent search algorithm, partial distortion search algorithm, transform-domain successive elimination algorithm and two-layer motion estimation algorithm, the proposed algorithm can also save 63.56 %, 52.73 %, 92.87 %, 85.77 % and 33.96 % computational complexity, respectively.     

基于H.264运动矢量域的脆弱水印算法研究

针对H.264/AVC的编码特征,提出一种基于H.264/AVC低比特率视频流的脆弱水印算法。该算法在视频编码端的P帧经过运动矢量搜索和运动矢量预测之后,提取运动矢量残差,将水印嵌入在运动矢量残差中。在视频的解码端进行水印提取和检测,检测不需要原始视频的参与。该算法具有较小的码率变化、视频失真,以及较强的脆弱性。     

一种快速的H.264/AVC帧内预测模式选择算法

H.264/AVC采用RDO技术选择帧内和帧间预测模式以进一步提高编码的效率,取得显著效果,但同时大幅度增加了预测的复杂度。该文提出一种RDO模式下的快速Intra_4x4模式选择算法,该算法根据SATD特征以及相邻块的预测模式之间的相关性,可以预先排除约50%可能性小的Intra_4x4模式,避免了不必要的代价(RD_Cost)计算,从而大幅度降低帧内预测的复杂度,同时基本保持了H.264/AVC的编码性能。     

预测帧编码中基于场景信息的宏块模式跳过算法*

在对场景信息进行分析的基础上,提出了H.264/AVC中预测帧的一种快速算法.对于未发生场景切换的预测帧,采用INTRA模式跳过算法(IMSA),跳过该帧中所有的INTRA模式的决策过程.对于发生场景切换的预测帧,跳过INTER模式的决策过程(PMSA).仿真结果显示,与采用完整的率失真优化(RDO)决策过程相比,未发生场景切换时,所提方法能减少30%～60%的编码时间;发生场景切换时,能减少60%～70%的编码时间,并且未导致明显的图像质量下降和码率的增加.     

Fast coding unit (CU) determination algorithm for high-efficiency video coding (HEVC) in smart surveillance application

High-efficiency video coding (HEVC) is a successor to the H.264/AVC standard as the newest video-coding standard using a quad-tree structure with the three block types of a coding unit (CU), a prediction unit (PU), and a transform unit (TU). This has become popular to apply to smart surveillance systems, because very high-quality image is needed to analyze and extract more precise features. On standard, the HEVC encoder uses all possible depth levels for determination of the lowest rate-distortion (RD) cost block. The HEVC encoder is more complex than the H.264/AVC standard. An efficient CU determination algorithm is proposed using spatial and temporal information in which 13 neighboring coding tree units (CTUs) are defined. Four CTUs are temporally located in the current CTU and the other nine neighboring CTUs are spatially situated in the current CTU. Based on the analysis of conditional probability values for SKIP and Merge modes, an optimal threshold value was determined for judging SKIP or Merge mode according to the CTU condition and an adaptive weighting factor. When SKIP or Merge modes were detected early, other mode searches were omitted. The proposed algorithm achieved approximately 35 % time saving with random-access configuration and 29 % time reduction with low-delay configuration while maintaining comparable rate-distortion performance, compared with HM 12.0 reference software.     

一种适用于H.264/AVC的自适应空域帧内预测算法

提出了帧内预测算法中邻块间预测选项的相关性、预测选项和SAD相关性的概念,在此基础上提出了一种适用于H．264／AVC的自适应空域帧内预测算法,该算法利用上述的两种相关性预测当前块的帧内预测选项;利用“半步停”技术自适应地中止预测．实验结果表明,该算法在保证重构图像质量和压缩比的同时,计算复杂度仅相当于原有算法的7％左右．     

Lossless video coding based on pixel-wise prediction

The state-of-the-art H.264/AVC was designed for lossy video coding in the beginning. Recently, the H.264/AVC FRExt was developed by removing transformation and quantization for lossless coding. In this paper, we propose an efficient intra lossless coding method based on a pixel-wise prediction. The proposed algorithm introduces an additional intra prediction mode that employs the LOCO-I predictor of JPEG LS. We found that the proposed lossless coding algorithm achieved approximately 22.0, 2.6, and 10.7% bit saving in terms of compression ratio, compared to the H.264/AVC FRExt, lossless intra 4:4:4, and Takamura’s lossless coding methods, respectively.     

帧间编码模式选择及其择优早期终止的H.264/AVC快速算法

通过研究H.264/AVC帧间编码中最佳模式分布,提出了3种模式选择早期终止策略,分别对SKIP,P16×16,P16×8和P8×16这3类模式成为最佳编码模式进行判断,适当地结束编码模式选择过程,避免了对后面不可能模式率失真代价的计算,从而减少了帧间编码的计算复杂度。实验结果表明,该算法可以减少H.264/AVC编码器50％～70％的编码时间,同时保持与全搜索算法基本一致的编码性能,峰值信噪比PSNR平均下降0.17 dB左右,编码比特率平均增加2.42％。     

一种基于H.264/AVC的帧内预测模式选择快速算法

视频编码标准H.264/AVC用帧内和帧间模式预测来提高率失真性能。但是这种多模式选择和穷举式搜索大大增加了编码复杂度。本文提出了一种帧内预测模式选择快速算法,其i核心思想是根据已确定的Intra_16x16最优预测模式来削减Intra_4x4块的预测模式数。通过本算法,可在比特率和PSNR值基本上不变的情况下使得H.264/AVC编码时间大为降低。     

H.264/AVC快速帧内预测模式选择算法

基于像素块的纹理特性,相邻块预测模式的相关性提出了一种H.264/AVC快速帧内预测算法,该算法将4×4亮度块的候选模式从9种降低到1～4种。实验结果表明,与H.264编解码器JM8.6相比,I帧编码时间降低50%～60%,而PSNR和输出码率基本保持不变。     

基于H.264的帧间预测快速算法

为了快速地进行运动估计,针对H.264帧间编码全搜索的计算复杂度太高,不能应用于实时处理的缺点,本文实现了一种适合于H.264的快速搜索算法。该算法针对H.264多预测模式的特点,利用其相互间的相关性来确定预测点;同时利用运动图像的一般规律来确定预测点,从而使得预测点的确定时间得以减少。在预测点确定后再用钻石算法搜索,这使得整个帧间预测时间大为缩短。实验结果表明,该算法能够在码率增加不超过1%,信噪比(signal noise ratio,SNR)下降不超过0.1dB的情况下,使得运动估计速度提高将近65%。     

A Novel MBAFF Scheme of AVS

Adaptive frame/field coding techniques have been adopted in many international video standards for interlaced sequence coding. When the frame/field adaptation is applied on the picture level, the coding efficiency is improved greatly, compared with the pure frame coding or the pure field coding. The picture-level adaptive frame/field coding （PAFF） selects frame coding or field coding once for one picture. If this frame/field adaptation is extended to Macro Block （MB） level, the coding efficiency will be further increased. In this paper, a novel MB-level adaptive frame/field （MBAFF） coding scheme is proposed. In the proposed MBAFF scheme, the top field of the current picture is used as a reference. The experiments are implemented on the platforms of Audio Video coding Standard （AVS） base profile and H.264/AVC, respectively. On the AVS platform, 0.35dB gain can be achieved averagely, compared with AVS1.0 anchor. On the H.264/AVC platform, 0.16dB gain can be achieved averagely, compared with MBAFF scheme of H.264/AVC. Additionally, an extensive subjective quality enhancement can be achieved by the proposed scheme.     

On the impact of the GOP size in a temporal H.264/AVC-to-SVC transcoder in baseline and main profile

Scalable video coding is a recent extension of the advanced video coding H.264/AVC standard developed jointly by ISO/IEC and ITU-T, which allows adapting the bitstream easily by dropping parts of it named layers. This adaptation makes it possible for a single bitstream to meet the requirements for reliable delivery of video to diverse clients over heterogeneous networks using temporal, spatial or quality scalability, combined or separately. Since the scalable video coding design requires scalability to be provided at the encoder side, existing content cannot benefit from it. Efficient techniques for converting contents without scalability to a scalable format are desirable. In this paper, an approach for temporal scalability transcoding from H.264/AVC to scalable video coding in baseline and main profile is presented and the impact of the GOP size is analyzed. Independently of the GOP size chosen, time savings of around 63 % for baseline profile and 60 % for main profile are achieved while maintaining the coding efficiency.     

H.264/AVC帧间预测模式的快速分类方法

H.264/AVC采用RDO技术进行帧间模式选择,提高了编码效率,但增加了计算复杂度。该文提出了快速分类算法,利用相邻宏块率失真特征以及预测模式之间的时空相关性,缩小了模式选择的范围,降低了帧间预测的复杂度。结果表明,该方法可减少25%~46%的序列编码时间,保持了H.264/AVC的编码性能与视觉效果。