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

计算机工程 ›› 2008, Vol. 34 ›› Issue (7): 26-28. doi: 10.3969/j.issn.1000-3428.2008.07.009

• 博士论文 • 上一篇    下一篇

自适应可变模式搜索算法

张 明,毕笃彦   

  1. (空军工程大学工程学院四系信号与信息处理实验室,西安 710038)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-04-05 发布日期:2008-04-05

Adaptive Variety-pattern Search Algorithm

ZHANG Ming, BI Du-yan   

  1. (Signal and Information Processing Lab, Fourth Department, College of Engineering, Air Force University of Engineering, Xi’an 710038)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-05 Published:2008-04-05

摘要: 充分利用运动矢量的时空相关性,提出一种新的块匹配运动估计算法,称为自适应可变模式搜索算法。该算法充分利用搜索起点预测、中止准则、自适应搜索模板、辅助点搜索等一系列技术。H.264编码平台上的实验表明,该算法可以保持高信噪比和低比特率,其计算复杂度只有UMHexagonS的16%~33%和EPZS的30%~50%。

关键词: 运动估计, 搜索起点预测, 中止准则, 自适应搜索模板

Abstract: This paper proposes a novel and simple fast Block-Matching Algorithm (BMA), called Adaptive Variety-Pattern Search (AVPS), which efficiently utilizes the high relation of adjacently block’s motion vectors. The algorithm adopts a series of skills, which are composed of prediction of initial search point, effective half-stop criteria, adaptive search pattern and auxiliary search points. Extensive experiments conducted based on the H.264 encoding platform show that the proposed AVPS can reduce the computational complexity by 16%~33% and 30%~50% compared with the UMHexagonS and EPZS, while maintaining similar PSNR and bit rate.

Key words: motion estimation, prediction of initial search point, half-stop criteria, adaptive search pattern

中图分类号: