Chan Y L, Siu W C
Centre for Multimedia Signal Process., Hong Kong Polytech., Kowloon.
IEEE Trans Image Process. 2001;10(8):1223-38. doi: 10.1109/83.935038.
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.
使用穷举全搜索的块运动估计计算量很大。过去提出的快速搜索算法往往通过限制搜索位置的数量来减少计算量。几乎所有这些算法都依赖于这样一个假设:随着搜索位置远离全局最小值,平均绝对差(MAD)失真函数单调增加。从本质上讲,这个假设要求MAD误差表面在搜索窗口上是单峰的。不幸的是,在实际视频信号中这通常不成立。然而,我们可以合理地假设它在全局最小值周围的一个小邻域内是单调的。因此,一种简单的策略,但可能是最有效和可靠的,是将检查点尽可能靠近全局最小值放置。在本文中,提出了一些图像特征来定位初始搜索点。这样一种引导方案是基于某些特征点的位置。在对每一帧应用特征检测过程以提取一组特征点作为匹配基元之后,我们广泛研究了这些匹配基元的统计行为,并发现它们与真实世界运动矢量的MAD误差表面高度相关。这些相关特性对于快速搜索算法非常有用。结果是稳健的,并且实现可能非常高效。我们方法的一个优点是所提出的搜索算法可以与其他块运动估计算法一起工作。我们将本方法应用于基于块的梯度下降搜索算法(BBGDS)、菱形搜索算法(DS)以及我们先前提出的面向边缘的块运动估计的实验结果表明,所提出的搜索策略能够增强这些搜索算法。与传统方法相比,新算法通过提取图像特征,更稳健,产生的运动补偿误差更小,并且具有简单的计算复杂度。