By Topic

A technique for reducing complexity of recursive motion estimation algorithms

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

4 Author(s)
Beric, A. ; Dept. of Electr. Eng., Eindhoven Univ. of Technol., Netherlands ; de Haan, G. ; Sethuraman, R. ; Van Meerbergen, J.

The recursive search motion estimation algorithm offers smooth and accurate motion vector fields. Computationally, the most expensive part of the motion estimator is the evaluation of the various motion vector candidates. Evaluation is performed by comparing blocks in two consecutive frames indicated by motion vector candidates. The paper addresses the issue of reducing the already extremely low number of motion vector evaluations. We apply preprocessing techniques to reduce the number of motion vector candidates from 7 to 5, i.e. 30%, without sacrificing quality. We exemplify the above findings through experimental results obtained using the 3D recursive search motion estimation algorithm. The required preprocessing overhead is negligible.

Published in:

Signal Processing Systems, 2003. SIPS 2003. IEEE Workshop on

Date of Conference:

27-29 Aug. 2003