Fast priority search algorithm for block motion estimation

This paper proposes a median-bias fast priority search algorithm for motion estimation. The main characteristic of the proposed algorithm is that it adapts a priority median-bias search pattern enabling the identification of locations with higher probability of finding the motion vector. Moreover, based on the history of motion vectors, the algorithm includes a robust region detection technique to avoid unnecessary searches in the static background region. A minimum-distortion based analytical threshold is proposed to stop the search quickly when a "good enough" motion vector is achieved. Experimental results show that by using the proposed algorithm, the speed and accuracy of motion estimation are improved compared with the conventional approaches.