Nobel successive elimination algorithms for the estimation of motion vectors

摘要

We present fast algorithms to reduce the computation of block matching algorithms for motion estimation in video coding. Nobel successive elimination algorithms for the estimation of motion vectors are based on the successive elimination algorithm for motion estimation and fast algorithms for the estimation of motion vectors. Nobel successive elimination algorithms effectively eliminate the search points within the search window and thus decrease the number of matching evaluation that requires very intensive computations. The efficiency of each proposed algorithm was verified by experimental results.