H.264/AVC中基于全零块检测的运动估计快速算法

全零块检测是面向低比特率的视频编码器常用优化方法之一.特别是与运动估计相结合,可以有效的减少编码器的计算复杂性.本文根据H.264/AVC中整数变换的特点,给出了相应的全零块检测门限,提出了一种基于全零块检测的运动搜索提前中止准则.针对H.264/AVC多编码模式的特点,进一步将全零块检测用于H.264/AVC中多种编码模式的选择,有效的提高了运动估计的效率.利用这种方法,在有效减少编码器的计算复杂性,提高H.264/AVC软件编码器编码效率的同时,可以保持比特率和图像质量基本不变.     

基于H.264的运动估计快速算法研究

本文针对H.264运动估计过于复杂的特性,提出了一种适应于H.264的运动估计算法和模块选择算法,以便降低运动估计的复杂度,提高编码的速度。     

H．264运动估计算法优化研究

H．264是一种适应于低码率传输的新一代视频压缩标准,但其在获得高性能的同时,也导致了其复杂性很高。运动估计是运算量最大的一部分,对运动估计算法进行优化是提高编码效率的关键。基于此,从运动估计的基本原理入手,对几种典型的快速搜索算法进行了分析比较,在此基础上讨论了H．264标准中运动估计的特点和改进方法,并结合H．264标准的特点和快速搜索原理给出了H．264中运动估计快速算法的优化思路。     

基于H.264的快速运动估计技术

H.264/AVC视频压缩编码标准采用了基于运动补偿的帧间预测编码,用于去除帧间时域冗余。其中运动估计是帧间预测的核心部分,也是最耗时的部分,因此一个高效的运动估计算法能大大提高编码效率。本文重点介绍了H.264/AVC中的快速运动估计UM HexagonS以及与此相结合的CBFPS亚像素运动估计和提前终止技术。     

一种高效的基于H.264/AVC压缩域信息的全局运动估计方法

本文提出了一种基于H.264/AVC压缩域的高效全局运动估计算法.由于H.264采用了多种新的视频压缩编码技术,使得其压缩码流的运动矢量(MV)场中包含大量噪声运动矢量,可参与全局运动估计的运动矢量相对较少.噪声运动矢量这里指的是与全局运动不相符的运动矢量.为了降低噪声运动矢量的影响、提高全局运动估计的精度和效率,在全...     

H.264中一种新型算法的研究

提出一种快速实现H.264运动估计的算法。该算法在新三步搜索算法的基础上对搜索模板进行了改进,并采用了提前终止搜索策略。实验表明,该算法在保持图象质量和峰值信噪比基本不变的情况下大大减少了搜索点的数目,提高了运动估计的速度。因此,本算法可以有效的提高H.264的编码效率。     

基于UMHexagonS的快速运动估计编码算法研究

成就最新视频编码标准H.264/AVC优异编码性能的代价是其计算复杂度的大幅增加,编码速度的急剧下降.为了克服H.264/AVC标准中重要且耗时的运动估计编码技术实时性差的缺陷,针对其最新采用的UMHexagonS算法的计算冗余,利用宏块的运动特征,制定了自适应的运动估计策略和搜索点分配准则.仿真实验结果表明,本文提出的运动估计编码方案与UMHexagonS算法相比,平均节省约23%的运动估计编码时间,在有效提高编码速度的前提下,保持了H.264/AVC低码率、高质量的编码优势.     

基于H.264视频编码的运动估计算法研究

运动估计是视频编码中最重要且最耗时的一部分,它占用整个视频编码60％～80％的时间.研究高效的、快速的运动估计算法是目前视频压缩技术中的重要研究课题.基于H.264视频编码标准,选择x264作为测试编码器,分析了x264的4种运动估计算法,通过加入非对称小菱形搜索,降低搜索点数,部分算法优化,对非对称十字型多层次六边形格点搜索算法(UMHexagonS)进行了改进,提高了运动估计算法效率.提出了非对称十字型多层次八边形格点搜索(x264_ME_UMO)算法.通过对各种视频序列的测试表明,在基本保持原有编码性能和图像质量的情况下,优化后的算法编码速度平均提高了约17％,能更好地满足实际应用的需求.     

基于模式和时空相关性的运动估计快速算法

H.264标准中的多尺寸块运动估计,在显著提高编码性能的同时,大大增加了其计算量,使得H.264实时编码器的实现面临巨大挑战.本文充分利用视频图像的时空相关性和多尺寸块间的运动相似性,根据运动向量的中心偏置特性,提出了一种运动估计快速算法.该算法通过有效地预测搜索起点,自适应选择搜索模式以及采用二级终止搜索策略等方式,在编码性能相当的情况下,运动估计的速度比全搜索算法提高了95~247倍,比H.264推荐的快速算法提高了4.1~6.3倍.     

基于分裂聚合块模式选择的运动估计算法

为了简化H.264视频压缩编码标准中庞大的计算量,提出了一种基于分裂聚合块模式选择的运动估计算法.该算法结合H.264标准7种可变块尺寸模式,利用分裂聚合原理,为帧间运动估计提前确定块模式.保证在图像质量允许的前提下,提高编码效率,为各种多媒体需求的广泛应用奠定基础.     

Selective VS-MRF-ME and intra coding in H.264 based on spatiotemporal continuity of motion field

The new video coding standard, H.264 uses variable size motion estimation (VS-ME), multiple reference frame motion estimation (MRF-ME) and spatial-based intra prediction with selectable block size in inter frame coding. These tools have achieved significant coding efficiency compared to coding a macroblock (MB) only based on motion-compensation in regular size with single reference frame. However, these new features also give rise to an exhaustive computation in the coding procedure since there are so many combinations of coding modes and reference frames to be tried. In this paper, a fast motion estimation algorithm based on the selective VS-MRF-ME and intra prediction is proposed to reduce H.264 coding computational complexity. The basic idea of the method is to utilize the spatiotemporal property of motion field in predicting where VS-MRF-ME and intra prediction are needed, and only in these regions VS-MRF-ME and intra coding are enabled. The motion field is generated by motion vectors from 16×16 motion estimation on the nearest reference frame. Simulation results show that the proposed algorithm can save 50% computational complexity on average, with negligible loss of coding efficiency.     

Rate distortion optimization for H.264 interframe coding: a general framework and algorithms.

Rate distortion (RD) optimization for H.264 interframe coding with complete baseline decoding compatibility is investigated on a frame basis. Using soft decision quantization (SDQ) rather than the standard hard decision quantization, we first establish a general framework in which motion estimation, quantization, and entropy coding (in H.264) for the current frame can be jointly designed to minimize a true RD cost given previously coded reference frames. We then propose three RD optimization algorithms--a graph-based algorithm for near optimal SDQ in H.264 baseline encoding given motion estimation and quantization step sizes, an algorithm for near optimal residual coding in H.264 baseline encoding given motion estimation, and an iterative overall algorithm to optimize H.264 baseline encoding for each individual frame given previously coded reference frames-with them embedded in the indicated order. The graph-based algorithm for near optimal SDQ is the core; given motion estimation and quantization step sizes, it is guaranteed to perform optimal SDQ if the weak adjacent block dependency utilized in the context adaptive variable length coding of H.264 is ignored for optimization. The proposed algorithms have been implemented based on the reference encoder JM82 of H.264 with complete compatibility to the baseline profile. Experiments show that for a set of typical video testing sequences, the graph-based algorithm for near optimal SDQ, the algorithm for near optimal residual coding, and the overall algorithm achieve on average, 6%, 8%, and 12%, respectively, rate reduction at the same PSNR (ranging from 30 to 38 dB) when compared with the RD optimization method implemented in the H.264 reference software.     

基于TIDM642的一种H．264插值快速实现方法

H.264视频编码标准正在得到越来越广泛的运用。在H.264中,插值和运动估计的计算复杂度之和大概占到整个视频编码的50%以上。因此,如何降低插值和运动估计的计算复杂度是快速实现H.264的关键所在。针对DM642的硬件架构,尝试了一种新的插值数据结构。经过优化,对于插值过程本身,以及到后来计算运动矢量时的数据缺失引起的CPU数据挂起,都降低到了比较理想的水平。     

Computation-aware fast motion estimation for H.264/AVC using image indexing

The key to designing a real-time video coding system is efficient motion estimation, which reduces temporal redundancies. The motion estimation of the H.264/AVC coding standard can use multiple references and multiple block sizes to improve rate-distortion performance. The computational complexity of H.264 is linearly dependent on the number of allowed reference frames and block sizes using a full exhaustive search. Many fast block-matching algorithms reduce the computational complexity of motion estimation by carefully designing search patterns with different shapes or sizes, which have a significant impact on the search speed and distortion performance. However, the search speed and the distortion performance often conflict with each other in these methods, and their high computational complexity incurs a large amount of memory access. This paper presents a novel block-matching scheme with image indexing, which sets a proper priority list of search points, to encode a H.264 video sequence. This study also proposes a computation-aware motion estimation method for the H.264/AVC. Experimental results show that the proposed method achieves good performance and offers a new way to design a cost-effective real-time video coding system.     

一种H.264运动估计器的VLSI设计

MPEG4AVC／ITU—T H．264视频编码标准中所采用的多模式运动估计算法与传统的MPEG4、H．263 高级预测模式相比较而言，编码效率和性能都大大提高。但其诸如模式决策等问题却给运动估计器，特别是硬件运动估计器带来非常大的运算复杂度。本文提出一种H．264运动估计器硬件结构，它采用了新的模式决策算法和快速运动估计算法。仿真结果证明，这两种算法不但能使运动估计器降低其硬件实现成本，而且能减少模式决策和运动估计的时间。     

Fast multi-frame motion estimation for H264/AVC system

Advanced video compression standard, H264/AVC, with multi-frame motion estimation, can offer better motion-compensation than the previous coding standards. However, the implementation of real-time multi-frame estimation for an H264/AVC system is difficult due to heavy computations. In this paper, a fast algorithm is proposed in an effort to reduce the searching computation for motion estimation with five reference frames. The fast multi-frame motion estimation consists of the adaptive full-search, three-step search, and diamond search methods using the content adaptive control process. Efficient control flow is proposed to select the searching algorithm dependent on video features. The adaptive algorithm can achieve better rate-distortion and lower computation for H264/AVC coding. The experiments indicate that the speed-up is 6–15 times compared with the full search method, while the image quality slightly degrades.