Successive elimination algorithm for motion estimation

Abstract

The correspondence presents a fast exhaustive search algorithm for motion estimation. The basic idea is to obtain the best estimate of the motion vectors by successively eliminating the search positions in the search window and thus decreasing the number of matching evaluations that require very intensive computations. Simulation results demonstrate that although the performance of the proposed algorithm is the same as that using the exhaustive search, the computation time has been reduced significantly.