Motion estimation and compensation are widely used in video coding. This paper presents two fast block matching algorithms for motion estimation. These algorithms use the subspace features of a block to determine the block distance. With a search block size of N×N, the proposed algorithms can achieve a computation reduction factor of N/2 while retaining close-to-optimal performance in the mean absolute difference (MAD) sense.
Yiu-Hung Fok, Oscar C. Au, Ross D. Murch