Motion estimation based on an improved block matching technique  

作　　者：陶唐飞 韩崇昭 吴艳琪 康欣 

机构地区：[1]Institute of Synthetic Automation School of Electronic and Information Engineering,Xi'an Jiaotong University,Xi'an 710049 Key Laboratory of Education Ministry for Modern Design and Rotor-Bearing System,Xi'an Jiaotong University,Xi'an 710049 [2]Institute of Synthetic Automation School of Electronic and Information Engineering,Xi'an Jiaotong University,Xi'an 710049

出　　处：《Chinese Optics Letters》2006年第4期208-210,共3页中国光学快报（英文版）

基　　金：This work was supported by the National "973" Program of China (No. 2001CB309403)the National Natural Science Foundation of China (No. 60574033).

摘　　要：An improved block-matching algorithm for fast motion estimation is proposed. The matching criterion is the sum of absolute difference. The basic idea is to obtain the best estimation of motion vectors by an optimization of the search process which can terminate the time-consuming computation of matching evaluation between the current block and the ineligible candidate block as early as possible and eliminate the search positions as many as possible in the search area. The performance of this algorithm is evaluated by theoretic analysis and compared with the full search algorithm （FSA）. The simulation results demonstrate that the computation load of this algorithm is much less than that of FSA, and the motion vectors obtained by this algorithm are identical to those of FSA.An improved block-matching algorithm for fast motion estimation is proposed. The matching criterion is the sum of absolute difference. The basic idea is to obtain the best estimation of motion vectors by an optimization of the search process which can terminate the time-consuming computation of matching evaluation between the current block and the ineligible candidate block as early as possible and eliminate the search positions as many as possible in the search area. The performance of this algorithm is evaluated by theoretic analysis and compared with the full search algorithm （FSA）. The simulation results demonstrate that the computation load of this algorithm is much less than that of FSA, and the motion vectors obtained by this algorithm are identical to those of FSA.

关 键 词：ALGORITHMS Computational complexity FLOWCHARTING OPTIMIZATION Pattern matching 

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