By Topic

Motion estimation using dynamic programming with selective path search

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
$33 $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

1 Author(s)
Minglun Gong ; Dept. of Math & Comput. Sci., Laurentian Univ., Sudbury, Ont., Canada

A novel dynamic programming-based motion estimation algorithm is presented in this paper. During matching cost calculation, the algorithm selectively keeps the cost values for the best N candidates only. The required memory space is therefore considerably reduced. In addition, a new path searching approach is applied. When searching for the optimal path from pixel p, the algorithm considers both the nearby candidates and the best N candidates at pixel p-l. As a result, better estimations can be produced around motion boundaries. The experimental results show that the motions estimated through considering all the candidates are only slightly better than those estimated through selectively considering a small number of candidates, even though the former approach requires significantly more computational time and memory space.

Published in:

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on  (Volume:4 )

Date of Conference:

23-26 Aug. 2004