Normalized partial distortion search algorithm for block motion estimation

TLDR: A novel fast block-matching algorithm named normalized partial distortion search is proposed, which reduces computations by using a halfway-stop technique in the calculation of the block distortion measure and normalized the accumulated partial distortion and the current minimum distortion before comparison.

Abstract: Many fast block-matching algorithms reduce computations by limiting the number of checking points. They can achieve high computation reduction, but often result in relatively higher matching error compared with the full-search algorithm. A novel fast block-matching algorithm named normalized partial distortion search is proposed. The proposed algorithm reduces computations by using a halfway-stop technique in the calculation of the block distortion measure. In order to increase the probability of early rejection of non-possible candidate motion vectors, the proposed algorithm normalized the accumulated partial distortion and the current minimum distortion before comparison. Experimental results show that the proposed algorithm can maintain its mean square error performance very close to the full-search algorithm while achieving an average computation reduction of 12-13 times, with respect to the full-search algorithm.