A new prediction model search algorithm for fast block motion estimation

Most of the fast block matching algorithms (BMAs) use the origin as the initial center of the search. To improve the accuracy of the fast BMAs, a new prediction model (PM) search algorithm is proposed. Based on the spatial correlation of motion and the fast center-biased BMA, the four causal neighbour blocks are chosen to predict the starting search point and then the center-biased BMA is used to find the final motion vector as the global minimum is closer to the predicted center. Experimental results show that the proposed prediction model improves the performance of most fast BMAs such as the new three-step search and the four-step search, in terms of the motion compensation errors. In addition, the average computational requirement is also reduced.

[1]  Lai-Man Po,et al.  A novel four-step search algorithm for fast block motion estimation , 1996, IEEE Trans. Circuits Syst. Video Technol..

[2]  Anil K. Jain,et al.  Displacement Measurement and Its Application in Interframe Image Coding , 1981, IEEE Trans. Commun..

[3]  T Koga,et al.  MOTION COMPENSATED INTER-FRAME CODING FOR VIDEO CONFERENCING , 1981 .

[4]  Bing Zeng,et al.  A new three-step search algorithm for block motion estimation , 1994, IEEE Trans. Circuits Syst. Video Technol..

[5]  Hsueh-Ming Hang,et al.  An efficient block-matching algorithm for motion-compensated coding , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  C. Hsieh,et al.  Motion estimation algorithm using interblock correlation , 1990 .