论文标题
快速运动估算的自适应搜索区域
Adaptive search area for fast motion estimation
论文作者
论文摘要
本文提出了一种基于块匹配的运动估计算法的搜索区域的新方法。搜索区域在每个帧块的建议方法中都可以自适应地找到。该搜索区域类似于完整搜索（FS）算法的搜索区域，但对于大多数框架块而言，搜索区域都较小。因此，所提出的算法在规律性方面类似于FS，但计算复杂性却少得多。块的运动向量之间的时间和空间相关用于查找搜索区域。匹配的块是从预测向量列出的矩形区域中选择的。仿真结果表明，所提出的算法的速度至少是FS算法的七倍。
This paper suggests a new method for determining the search area for a motion estimation algorithm based on block matching. The search area is adaptively found in the proposed method for each frame block. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of regularity but has much less computational complexity. The temporal and spatial correlations among the motion vectors of blocks are used to find the search area. The matched block is chosen from a rectangular area that the prediction vectors set out. Simulation results indicate that the speed of the proposed algorithm is at least seven times better than the FS algorithm.
