一种改进的新三步搜索算法

在对三步法工作原理进行研究的基础上提出了新三步搜索算法（NITSS）。该方法充分利用视频序列运动矢量概率分布上的中心偏置特性．在三步搜索算法的基础上引入了十字型分布的4个点构成搜索点群。实验结果表明。新三步搜索算法解决了三步法的小运动估计效果较差问题．提高了搜索精度，保持了三步法的高效率。     

基于运动矢量预测的六边形块运动估计搜索算法

在保证图像质量的前提下,为了降低运动估计算法的计算量和搜索点数,提出了一种基于运动场预测的六边形块运动估计搜索算法(PMVHEXBS)。这种算法结合“足够好就停止搜索”的思想和六边形搜索模式(HEXBS)的高速特性,并且在块失真度量中使用部分失真准则(PDC),进一步加快了计算速度。仿真结果显示这种算法和菱形算法(DS)、PM- VFAST算法相比,计算量和搜索点数都有了明显的下降。同时,该算法的图像质量要好于DS算法,和PMVFAST算法相比只有较小的下降。     

多参考点三步搜索法快速稳像算法

针对数字稳像（DIS）算法的实时实现，提出了基于三步搜索（TSS）法和投影算法（PA）的快速DIS算法，并在TSS法的每一步保留多个参考点以提高稳像精度使其更接近于全搜索块匹配法（FS-BM）。仿真实验表明，该算法具有较高的运动估计精度及更快的运算速度，可用于较复杂运动估计模型的实时处理。     

An efficient gray search algorithm for the estimation of motionvectors

Motion vector estimation plays an important role in motion-compensated video coding. An efficient and fast search algorithm is proposed for the estimation of motion vectors. With the help of gray prediction, the algorithm can determine the motion vectors of image blocks quickly and correctly. Since the proposed algorithm performs better than other search algorithms [e.g. the three-step search (TSS), cross-search (CS), new three-step search (NTSS), four-step search (FSS), block-based gradient descent search (BBGDS), simple-and-efficient search (SES), prediction search (PS) and gray prediction search (GPS)], it is very beneficial in applications where the video coding speed is important     

A new predictive search area approach for fast block motion estimation

According to the observation on the distribution of motion differentials among the motion vector of any block and those of its four neighboring blocks from six real video sequences, this paper presents a new predictive search area approach for fast block motion estimation. Employing our proposed simple predictive search area approach into the full search (FS) algorithm, our improved FS algorithm leads to 93.83% average execution-time improvement ratio, but only has a small estimation accuracy degradation. We also investigate the advantages of computation and estimation accuracy of our improved FS algorithm when compared to the edge-based search algorithm of Chan and Siu (see IEEE Trans. Image Processing, vol.10, p.1223-1238, Aug. 2001); experimental results reveal that our improved FS algorithm has 74.33% average execution-time improvement ratio and has a higher estimation accuracy. Finally, we further compare the performance among our improved FS algorithm, the three-step search algorithm, and the block-based gradient descent search algorithm.     

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

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

一种搜索形状可变的快速运动估计算法

本文提出了一种以菱形和六边形联合搜索为基础的搜索形状可变(ＶＳＳ)的运动估计快速算法,何用于Ｈ．２６３、ＭＰＥＧ２、ＭＰＥＧ４中的视频编码。试验结果表明,在获得与现有ＴＳＳ、ＮＴＳＳ、４ＳＳ和ＤＳ等快速算法相当的图像质量和信噪比的情况下,该算法有效减少了搜索次数,提高了搜索效率,尤其对于中大运动量的视频图像运动估计效果更为明显。     

一种改进的运动估计算法--新三步搜索法

在对三步法工作原理进行研究的基础上提出了改进新三步法,即在第一步搜索时采用了并行的思想.改进后的新三步搜索法解决了三步法的小运动估计效果较差问题,且保持了原三步法的高效率.     

一种起点预测的十字形快速运动估计算法

基于时运动矢量概率分布的方向性中心偏移特性和起点预测搜索技术的研究,提出了一种起点预测的十字形快速运动估计算法(IPPAFA),在保持搜索精度的同时有效降低了计算复杂度。实验结果表明,在图像质量几乎不下降的情况下,与钻石搜索算法(DS)和运动矢量场自适应搜索算法(MVFAST)相比,该算法在速度和准确性方面都优于传统的快速运动估计算法。     

Enhanced dynamic pattern search algorithm with weighted search points for fast motion estimation

For video encoding, a number of block-based motion estimation techniques have been proposed in the literature. Some of them are based on fixed search patterns, whereas others are utilizing spatial and temporal correlations of blocks within video frames. It has been found that the block correlations give an initial lead in identification of motion vector of the candidate block and the possibility of oversearch or undersearch is minimized. In this paper, the dynamic pattern search (DPS) algorithm for block-based motion estimation has been enhanced which reduces the search point computation by first identifying the stationary blocks. Further, in the proposed algorithm, search points within the search area are evaluated for minimum distortion point in prioritized fashion to reduce the possibility of being trapped in local minima. The proposed work has been compared experimentally with fixed search pattern techniques like full search, diamond search (DS) and hexagon search and adaptive search pattern techniques like adaptive rood pattern search and DPS in terms of various performance parameters. It has been found that the proposed technique is faster by 6.32 and 3.30 times than DS and DPS techniques in terms of avg. search point computation per block and produces better peak signal to noise ratio than DS and DPS by the value of 1.03 and 0.63 dB, respectively. In terms of structural similarity measurement index value, enhanced DPS gives 8% better results than DPS and performs better compression than any other technique except FS.     

A fast block-matching algorithm based on adaptive search area and its VLSI architecture for H.264/AVC

In this paper, we propose a fast block-matching algorithm based on search center prediction and search early termination, called center-prediction and early-termination based motion search algorithm (CPETS). The CPETS satisfies high performance and efficient VLSI implementation. It makes use of the spatial and temporal correlation in motion vector (MV) fields and feature of all-zero blocks to accelerate the searching process. This paper describes the CPETS with three levels. At the coarsest level, which happens when center prediction fails, the search area is defined to enclose all original search range. At the middle level, the search area is defined as a 7×7-pels square area around the predicted center. At the finest level, a 5×5-pels search area around the predicted center is adopted. At each level, 9-points uniformly allocated search pattern is adopted. The experiment results show that the CPETS is able to achieve a reduction of 95.67% encoding time in average compared with full-search scheme, with a negligible peak signal-noise ratio (PSNR) loss and bitrate increase. Also, the efficiency of CPETS outperforms some popular fast algorithms such as: three-step search, new three-step search, four-step search evidently. This paper also describes an efficient four-way pipelined VLSI architecture based on the CPETS for H.264/AVC coding. The proposed architecture divides current block and search area into four sub-regions, respectively, with 4:1 sub-sampling and processes them in parallel. Also, each sub-region is processed by a pipelined structure to ensure the search for nine candidate points is performed simultaneously. By adopting search early-termination strategy, the architecture can compute one MV for 16×16 block in 81 clock cycles in the best case and 901 clock cycles in the poorest case. The architecture has been designed and simulated with VHDL language. Simulation results show that the proposed architecture achieves a high performance for real-time motion estimation. Only 47.3 K gates and 1624×8 bits on-chip RAM are needed for a search range of (−15, +15) with three reference frames and four candidate block modes by using 36 processing elements.     

一种用于视频编码的运动估计新算法

提出一种新的改进三步搜索法(NITSS),该方法充分利用视频序列运动矢量在空间分布上的中心偏置特性,在三步搜索算法的基础上引入了以"×"字型分布的5个点构成的搜索点群,并通过同一帧相邻宏块的运动矢量之间存在的空间相关性来预测初始运动矢量,用来加强中心偏置特性.仿真结果表明,同TSS算法相比,NITSS算法降低了搜索运算量,提高了搜索精度.     

一种结合遗传算法和钻石搜索的多模式快速运动估计方法

为了解决视频编码中运动矢量搜索精度与速度的矛盾,本文提出了一种基于遗传算法(GA)和钻石搜索(DS)的多模式快速运动估计方法——MMS算法.它以图像序列的时空预测矢量作为图像活动剧烈程度的判据,自适应选择搜索模式.针对平缓运动类型使用快速的DS搜索模式,针对剧烈运动类型使用GA/DS联合搜索模式.与现有的次优解快速算法相比,MMS有效地解决了在大运动矢量情况下编码器性能下降的问题,可以从整体上提升编码器的性能,接近理想的全搜索法的结果;与其它直接利用GA进行全局优化的方法相比,MMS利用DS配合GA实现加速收敛.此外,通过引入多模式处理的概念,在保证搜索精度的同时,充分发挥了次优解算法的效率,整体编码速度与DS等快速算法的结果十分接近.这一方法为有效地解决运动估计中的矛盾问题提供了一个新的处理框架.实验结果验证了算法的性能.     

一种基于H.264/AVC的高效块匹配搜索算法

本文针对H.264/AVC的编码特点,提出了一种利用时空域运动相关性的快速块匹配搜索算法.该算法充分利用了视频序列的运动程度与宏块编码模式间的关联特性以及运动矢量的统计特征,明显减少了运动估计的搜索复杂度.实验表明,本文方法的搜索速度分别比FS和DS算法平均提高了77.96%和32.19%;重建图像的PSNR比DS算法平均提高了0.06dB,更接近FS算法的编码质量.     

JOINT RANDOM OPTIMIZED THREE—STEP SEARCH ALGORITHM BASED—ON GRAY AND CHROMATIC INFORMATION

In this letter,an improved three-step search algorithm is presented,which uses both gray and chromatic information to boost the performance with random optimization and converge the motion vectors to global optima.Experimental results show that this algorithm can efficiently improve the PSNR after motion compensation.     

基于重叠缓冲预解跳的DS/FH扩频信号快速捕获

DS/FH(Direct Sequence/Frequency Hopping)扩频信号捕获相对直接序列扩频(Direct Sequence Spread Spectrum,DSSS)需要更多维度的搜索,捕获电路复杂。针对现有DS/FH扩频信号捕获算法复杂度高、电路结构与波形参数强相关,以及通用性差、灵活度低的问题,提出了一种基于重叠缓冲预解跳的DS/FH扩频信号快速捕获方法,利用双缓冲补零(Double Block Zero Padding,DBZP)缓冲单元与预解跳单元的灵巧结合,将时域-频域-多普勒域高度耦合的扩跳频图案搜索进行降维分离,在保证积分增益的同时降低了捕获实现的复杂度。数值分析与仿真结果表明,所提方法兼顾了捕获性能与运算资源,相比现有基于预解跳方法的DS/FH扩频信号捕获算法的运算量减小了50%。     

用于快速块运动估计的多方向钻石搜索算法

在钻石搜索算法的基础上,提出了多方向钻石搜索算法,用于实现视频编码中的块运动估计.该算法考虑所有的块误差梯度下降的方向,而不是只考虑梯度下降最大的那个方向.与全搜索、新三步搜索、四步搜索、基于块的梯度下降搜索、钻石搜索算法相比较,实验结果表明该算法在搜索速度和质量上表现良好.     

An efficient search strategy for block motion estimation usingimage features

Block motion estimation using the exhaustive full search is computationally intensive. Fast search algorithms offered in the past tend to reduce the amount of computation by limiting the number of locations to be searched. Nearly all of these algorithms rely on this assumption: the mean absolute difference (MAD) distortion function increases monotonically as the search location moves away from the global minimum. Essentially, this assumption requires that the MAD error surface be unimodal over the search window. Unfortunately, this is usually not true in real-world video signals. However, we can reasonably assume that it is monotonic in a small neighborhood around the global minimum. Consequently, one simple strategy, but perhaps the most efficient and reliable, is to place the checking point as close as possible to the global minimum. In this paper, some image features are suggested to locate the initial search points. Such a guided scheme is based on the location of certain feature points. After applying a feature detecting process to each frame to extract a set of feature points as matching primitives, we have extensively studied the statistical behavior of these matching primitives, and found that they are highly correlated with the MAD error surface of real-world motion vectors. These correlation characteristics are extremely useful for fast search algorithms. The results are robust and the implementation could be very efficient. A beautiful point of our approach is that the proposed search algorithm can work together with other block motion estimation algorithms. Results of our experiment on applying the present approach to the block-based gradient descent search algorithm (BBGDS), the diamond search algorithm (DS) and our previously proposed edge-oriented block motion estimation show that the proposed search strategy is able to strengthen these searching algorithms. As compared to the conventional approach, the new algorithm, through the extraction of image features, is more robust, produces smaller motion compensation errors, and has a simple computational complexity.     

Local motion-adaptive interpolation technique based on block matching algorithms

Interpolation techniques based on block-by-block motion compensation algorithms are studied for the video conference/video telephone signals. In this paper, we propose the local motion-adaptive interpolation technique, which can be used in the codec using a motion compensated coding-block matching algorithm (MCC-BMA). Computer simulation results at 2:1 subsampling rate of the proposed local motion-adaptive interpolation techniques combined with the conventional three-step search algorithm and the fast BMA using integral projections are given.