A center-biased adaptive search algorithm for block motion estimation

A number of sub-optimal, but faster, search algorithms have been proposed i n the literature, in order to alleviate the complexity associated with moti on estimation by the full-search method. A new sub-optimal center-biased ad aptive search algorithm for motion estimation is proposed; we refer to this algorithm as center-biased dynamic MInima Bounded Area Search (MIBAS) algo rithm, The novelty of MIBAS is the checking point pattern at each subsequen t step, composed of points lying in the area bounded by two local minima fo und at the present step, rather than points lying in a small neighborhood a round a local minimum. The simulation results show that, compared to other fast algorithms, the center biased MIBAS is more robust and produces smalle r prediction errors and more reliable motion vectors, while it has-a compar able computational complexity.