作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (13): 227-229. doi: 10.3969/j.issn.1000-3428.2007.13.078

• 多媒体技术及应用 • 上一篇    下一篇

一种用于运动估计的十字六边形搜索算法

吕 瑞,卿粼波,何小海,龙建忠   

  1. (四川大学电子信息学院图像信息研究所,成都 610064)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-07-05 发布日期:2007-07-05

Cross Hexagon Search Algorithm for Motion Estimation

LV Rui, QING Linbo, HE Xiaohai, LONG Jianzhong   

  1. (Institute of Image Imformation, College of Electronics and Information Engineering, Sichuan University, Chengdu 610064)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-05 Published:2007-07-05

摘要: 提出了一种十字六边形搜索算法用于快速运动估计。该算法利用了运动矢量的中心偏置性和相关性,运动估计时通过预测确定搜索起始点,在搜索前期利用十字模板结合提前退出技术优先搜索起始点附近的局部区域,后期则改用六边形模板扩大搜索范围并完成运动估计。实验证明该算法与原始的六边形搜索算法相比平均减少了45%的搜索点数,与一些新的快速搜索算法相比,在搜索精度基本相似的情况下也有效地降低了运动估计的运算复杂度。

关键词: 运动估计, 提前退出, 十字模板, 六边形搜索

Abstract: A cross hexagon search(CHS) algorithm is proposed for fast motion estimation(ME). CHS algorithm utilizes both the center-based distribution characteristic of motion vectors(MVs) and the correlation among MVs. In ME, the initial search points are decided by prediction at first, then at early searching stage CHS employs cross search pattern and halfway-stop technique in searching the local areas around the initial search points priority, and at later stage CHS enlarges searching range and completes ME by using hexagon search patterns. Experiment results show that CHS gains 45% average reduction in average searching point(ASP) over original hexagon-based search(HEXBS) algorithm, and that CHS can effectively reduce the computational complexity of ME over some new fast searching algorithms with similar searching precision.

Key words: motion estimation, halfway-stop, cross searching pattern, hexagon-based search (HEXBS)

中图分类号: