By Topic

A new prediction model search algorithm for fast block motion estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jie-Bin Xu ; CityU Image Process. Lab., City Univ. of Hong Kong, Hong Kong ; Lai-Man Po ; Chok-Kwon Cheung

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

Published in:

Image Processing, 1997. Proceedings., International Conference on  (Volume:3 )

Date of Conference:

26-29 Oct 1997