Nobel Successive Elimination Algorithms for the Estimation of Motion Vectors

In this paper, we present fast algorithms to reduce the computations 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 [1] and the Fast Algorithms for the Estimation of Motion Vectors [2]. Nobel Successive Elimination Algorithms effectively eliminate the search points within the search window and thus decreasing the number of matching evaluation that requires very intensive computations. The efficiency of the each proposed algorithm was verified by experimental results

• Type: Conference
• Year: 2000
• Where: MSE
• Authors: Soo-Mok Jung, Sung-Chul Shin, Hyunki Baik, Myong-Soon Park
• Keywords: Hardware, Motion Estimation, MSE 2000, Nobel Successive Elimination, Successive Elimination Algorithms