An efficient parallel motion estimation algorithm for digital image processing
The authors present an efficient parallel block matching algorithm called the parallel hierarchical one-dimensional search for motion estimation. This algorithm is based on the assumptions made by the one-at-a-time search and 2-D logarithmic search. Instead of finding the two-dimensional motion vector directly, it finds two one-dimensional displacements in parallel on the two axes independently within the search area. The major feature of this algorithm is that its search speed for the motion vector is faster than that of the other search algorithms because of its simpler computations and parallelism.<<ETX>>