基于起点预测的不连续十字形快速搜索算法  

Discrete cross fast search algorithm based on initial search point prediction

作　　者：李会宗[1] 陈雷霆[1] 卢光辉[1] 李晓瑜[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054

出　　处：《计算机应用研究》2008年第10期2929-2931,共3页Application Research of Computers

基　　金：国家"863"计划资助项目(2006AA01Z335)

摘　　要：提出了一种基于起点预测的不连续十字形块搜索算法。该算法首先利用图像帧的时间相关性和空间相关性预测出一个点作为不连续十字形搜索模板的初始中心点,再根据运动矢量概率分布的中心十字偏置特性,采用不连续十字形搜索模型,对运动矢量进行估计,得出最佳运动估计结果。在保证图像质量的前提下,该搜索算法与完全搜索算法(FS)、三步搜索算法(TSS)和钻石搜索算法(DS)相比,搜索速度显著提高。This paper analyzed the spatial and temporal correlation of motion trend of the current block, studied the motion vector distribution, and proposed a novel adaptive discrete cross-search algorithm based on initial search point prediction. It utilized a novel initial pixel point selection strategy to improve the accuracy while keeping the computation cost less than other conventional algorithm. Experiments show that the algorithm is able to fit for all types of video sequences adaptively in spite of the degree of the motions,and it is better than the traditional fast motion estimation algorithms such as FS, TSS, and DS, in terms of speed and quality.

关 键 词：块匹配 运动估计 不连续十字形搜索 视频编/解码 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]