一种基于H.264的任意比例空间分辨率转码中的快速宏块类型选择方案*

在基于H.264的空间分辨率转码中,原有的宏块类型不再适用,从而需要重新选择。提出了一种快速的宏块类型选择方案,适用于基于H.264的任意比例因子的空间分辨率转码。由于任意比例因子的空间分辨率转码中,待编码帧中的宏块无法与已编码帧的宏块边界对齐,提出了影射块和覆盖块的概念,根据缩放因子的大小,在基于块统计和基于像素统计之间作出调整,从而在保证压缩性能的同时,尽可能地降低了运算复杂度。在帧间模式选择部分,对SKIP类型的选择进行了分析,提出SKIP类型的选择与已编码帧中SKIP类型的比例有关,并给出了解决方法。最后针对各种测试序列,并组合了多个图像缩放因子,进行了大量的实验。在帧内模式选择部分,与全搜索法相比,在保证PSNR损失不超过0.1 dB的前提下,方法的速度能提高约3.5倍;在帧间模式选择部分,与全搜索法相比,在保证PSNR损失不超过1.0 dB的前提下,本方法的速度能提高约30倍。     

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头信息量估计及其在帧级码率控制中的应用

由于H．264算法中宏块划分的灵活性导致了头信息的数据量变化剧烈而难以预测，同时由于变换系数的数据量大大的减小，又使头信息量在码流中所占的比重远高于在先前各个标准的码流中的比重，因此准确估计头信息量能有效提高H．264码率控制算法的性能。为了准确估计头信息，提出了一种应用卡尔曼滤波器估计帧级总头信息比特数的方法，并将该方法应用于帧级的码率控制。实验结果表明，该算法能准确估计头信息，并能在一定程度上提高相同码率下的总体图像质量。     

低复杂度的H.264帧间宏块编码模式选择算法

为了减少H．264／AVC帧间编码模式选择的计算复杂度，利用不同编码模式在实际视频序列中的利用率信息及空时域相邻块之间的相关性，提出了一个低复杂度的快速帧间编码模式选择算法。模拟结果表明，该算法在保持率失真性能的前提下可以大幅度减少模式选择的计算复杂度，有利于H．264的实时应用。     

Motion mapping and mode decision for MPEG-2 to H.264/AVC transcoding

This paper describes novel transcoding techniques aimed for low-complexity MPEG-2 to H.264/AVC transcoding. An important application for this type of conversion is efficient storage of broadcast video in consumer devices. The architecture for such a system is presented, which includes novel motion mapping and mode decision algorithms. For the motion mapping, two algorithms are presented. Both efficiently map incoming MPEG-2 motion vectors to outgoing H.264/AVC motion vectors regardless of the block sizes that the motion vectors correspond to. In addition, the algorithm maps motion vectors to different reference pictures, which is useful for picture type conversion and prediction from multiple reference pictures. We also propose an efficient rate-distortion optimised macroblock coding mode decision algorithm, which first evaluates candidate modes based on a simple cost function so that a reduced set of candidate modes is formed, then based on this reduced set, we evaluate the more complex Lagrangian cost calculation to determine the coding mode. Extensive simulation results show that our proposed transcoder incorporating the proposed algorithms achieves very good rate-distortion performance with low complexity. Compared with the cascaded decoder-encoder solution, the coding efficiency is maintained while the complexity is significantly reduced.

低复杂度的MPEG-2到H.264快速转码算法

提出一种新的MPEG-2到H.264快速转码算法,利用H.264宏块（MB）模式选择与MPEG-2运动补偿残差间的相关性,将H.264宏块模式的选择转化为数据分类;在MPEG-2解码时,保存相关的宏块信息,包括MB编码模式、编码块类型（CBPC）、MB残差的均值和方差,解码后采用标准的H.264编码器对YUV图像编码,并保存H.264宏块的编码模式,采用机器学习算法得到决策树,用于H.264编码模式的分类,从而大大提高转码效率。     

一种基于H.264的混合视频转码方法*

为了提高比特率缩减的H.264视频转码速度,提出了一种混合型视频转码（mixtue video transcode,MVT）方法。该方法选择串联结构对intra帧进行转换编码,选择开环结构对inter帧进行转换编码,同时对inter帧进行部分误差消除操作。对intra帧,转换编码操作后可以得到无误差的intra帧;对于inter帧,转码后图像质量的损失大于串联结构,但因为进行了消除误差漂移的操作,这一损失可以控制在可接受的最小范围内。实验结果表明,提出的混合型视频转码结构在转码速度上远远高于串联结构,转     

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

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

基于宏块预判的快速帧内预测模式选择算法

针对H.264/AVC帧内预测模式选择部分计算复杂度问题,提出一种基于宏块预判的快速帧内预测模式选择组合算法.该算法采用低复杂度的三点梯度算子改进了边缘方向直方图帧内预测模式选择算法（Pan算法）中利用Sobel算子得到边缘方向矢量.首先运用平均绝对误差（Mean Absolute Difference,MAD）值对编码宏块类型结合QP下的阈值进行预判;预判后的宏块采用改进的Pan算法进行模式筛选,最后确定最佳的预测模式.实验结果表明,在6个不同视频序列全I帧编码情况下,该算法与全搜索算法相比编码时间平均减少大约72.4%,与Pan算法相比编码时间减少28.6%,而码率仅分别增加4.21%、1.8%,峰值信噪比基本不变.     

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

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

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

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

Dyadic spatial resolution reduction transcoding for H.264/AVC

In this paper, we examine spatial resolution downscaling transcoding for H.264/AVC video coding. A number of advanced coding tools limit the applicability of techniques, which were developed for previous video coding standards. We present a spatial resolution reduction transcoding architecture for H.264/AVC, which extends open-loop transcoding with a low-complexity compensation technique in the reduced-resolution domain. The proposed architecture tackles the problems in H.264/AVC and avoids visual artifacts in the transcoded sequence, while keeping complexity significantly lower than more traditional cascaded decoder–encoder architectures. The refinement step of the proposed architecture can be used to further improve rate-distortion performance, at the cost of additional complexity. In this way, a dynamic-complexity transcoder is rendered possible. We present a thorough investigation of the problems related to motion and residual data mapping, leading to a transcoding solution resulting in fully compliant reduced-size H.264/AVC bitstreams.     

H．264压缩域中利用Biased-SVM检测镜头边界

为了直接从H．264码流中检测镜头边界,提出了利用H．264压缩域多特征和Biased—SVM（不平衡支持向量机）分类算法的检测方法。分析帧类型、宏块类型、运动矢量、帧内预测模式等信息,以获得发生镜头突变和渐变的特征。针对镜头边界帧的数量远少于视频帧总数的特点,用Biased—SVM分类方法将视频帧分为突变帧、渐变帧和非镜头边界帧。在TRECVID视频集上的实验结果表明,与其他H．264压缩域的算法相比,该算法有更好的性能。     

改进的H.264帧间模式选择算法

针对H.264帧间模式选择算法存在的问题,提出一种帧间模式选择快速算法.算法采用8×8块运动矢量同质性分析对宏块模式进行选择,缩小候选模式范围,降低H.264帧间模式选择算法的计算复杂度;使用模式相关和运动矢量合并对UMHexagonS算法进行优化,减少大量的运动估计搜索点数,取得了较高的编码效率.实验结果表明,与使用UMHexagonS的帧间模式选择算法相比,该算法在峰值信噪比及输出码流码率基本不变的前提下,可以平均减少大约50％的运动估计时间.     

基于运动复杂度的快速模式选择算法

H.264/AVC是ITU-T和ISO/IEC联合制定的最新视频压缩标准。它采用了可变块运动估计和率失真优化模式判决。H.264需要对10 种模式进行率失真优化计算才能得到一个宏块的最优编码模式,极大地增加了编码器的复杂度。为了提高模式选择效率,提出了一种基于运动复杂度的快速模式选择算法。实验结果表明,在PSNR仅有微小下降情况下,该算法可大幅提升编码速度。     

基于可变尺寸块运动矢量恢复的H.264时域差错掩盖算法

针对H.264帧间预测编码的新特点,提出了一种基于可变尺寸块运动矢量恢复的时域差错掩盖算法。该算法首先利用相邻宏块编码模式的相关性,根据周围宏块的编码模式判断受损宏块的编码模式及运动矢量恢复的宏块划分方式,分别对各个划分的子块进行运动矢量的恢复;然后利用相邻块运动矢量参考帧的相关性,根据相邻块运动矢量的参考帧确定匹配使用的参考帧;最后采用边缘失真匹配方法恢复运动矢量。实验结果表明,该算法同传统的差错掩盖算法相比,由于支持不同尺寸块运动矢量的恢复,因此,算法对差错信号能够获得更好的恢复效果。     

MPEG-2到H.264/AVC转码中的快速模式选择算法

为了降低MPEG-2到H.264/AVC的转码复杂度,针对转码过程中H.264/AVC编码的多模式预测,提出一个有效的快速模式选择算法.算法用MPEG-2中已有的运动矢量的差异来衡量宏块的运动情况,对运动矢量进行聚类,进而用聚类结果来选择预测模式.实验结果表明,算法可以在视频质量损失很小的情况下大幅度降低转码中再编码的复杂度.     

A first approach to speeding-up the inter mode selection in MPEG-2/H.264 transcoders using machine learning

The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter and intra prediction modes which come with a cost of higher computation complexity. Transcoding MPEG-2 video to H.264 is important to enable gradual migration to H.264. However, given the significant differences between the MPEG-2 and the H.264 coding algorithms, transcoding is much more complex and new approaches to transcoding are necessary. In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm, to be used as part of a high-efficient inter-frame prediction in MPEG-2 to H.264 transcoder. The proposed tools are used to compute an optimal MB coding mode decision with significantly reduced computational complexity. Specifically, we achieve the computational savings by using the following MB information coming from MPEG-2: the MB coding modes, the coded block pattern (CBPC) in MPEG-2, and the mean and variance of the 16 4 × 4 sub blocks of the MPEG-2 residual MBs. We use data mining algorithms to develop a decision tree for H.264 coding mode decisions. The decision trees are built using RD optimized mode decisions and result in highly efficient mode decisions, with significantly reduced computational complexity. The proposed transcoder is 35% faster than the RD optimized H.264 reference transcoder without a significant PSNR degradation (0.05 dB on average). The proposed transcoder performs over 0.4 dB better on average than the SAE cost based H.264 transcoding.

Low-complexity heterogeneous architecture for H.264/HEVC video transcoding

High efficiency video coding (HEVC) was developed by the Joint Collaborative Team on video coding to replace the current H.264/AVC standard, which has been widely adopted over the last few years. Therefore, there is a lot of legacy content encoded with H.264/AVC, and an efficient conversion to HEVC is needed. This paper presents a hybrid transcoding algorithm which makes use of soft computing techniques as well as parallel processing. On the one hand, a fast quadtree level decision algorithm tries to exploit the information gathered at the H.264/AVC decoder to make faster decisions on coding unit splitting in HEVC using a Naïve–Bayes probabilistic classifier that is determined by a supervised data mining process. On the other hand, a parallel HEVC-encoding algorithm makes use of a heterogeneous platform composed of a multi-core central processing unit plus a graphics processing unit (GPU). In this way, from a coarse point of view, groups of frames or rows of a frame (both options are possible) are divided into threads to be executed on each core (each of which executes one of the aforementioned classifiers) and, from a finer point of view, all these threads work in a collaborative way on a single GPU to perform the motion estimation process on the co-processor. Experimental results show that the proposed transcoder can achieve a good tradeoff between coding efficiency and complexity compared with the anchor transcoder.     

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

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