Home // AICT 2011, The Seventh Advanced International Conference on Telecommunications // View article

Evaluation of Fast Algorithms for Motion Estimation

Authors:
Ionut Pirnog
Cristian Anghel
Andrei Alexandru Enescu
Constantin Paleologu

Keywords: motion estimation, fast algorithms, fixed and variable iterations

Abstract:
In this paper we present an evaluation of the fast algorithms used for motion estimation and compensation. The presented algorithms are classified in two categories. The first category contains the algorithms with fixed number of iterations, i.e., Three Step Search (TSS), New Three Step Search (NTSS), and Four Step Search (FSS). The second category includes motion estimation algorithms with variable number of iterations, i.e., Orthogonal Search (OS), Two Dimensional Logarithmic Search (TDLS), and Adaptive Rood Pattern Search (ARPS). It is proved that for the second category of algorithms the number of iterations depends on the dimension of the search window. The evaluation is done by comparing the peak signal-to-noise ratio (PSNR) of the compensated motion frame and the number of blocks that are used.

Pages: 107 to 111

Copyright: Copyright (c) IARIA, 2011

Publication date: March 20, 2011

Published in: conference

ISSN: 2308-4030

ISBN: 978-1-61208-123-6

Location: St. Maarten, The Netherlands Antilles

Dates: from March 20, 2011 to March 25, 2011