A thresholding multiresolution block matching algorithm

In this paper, we present a thresholding multiresolution block matching algorithm. Preventing blocks that satisfy a predefined accuracy criterion from further processing saves computation. In three experiments which have quite different motion complexities, the proposed algorithm outperforms the fastest existing multiresolution block matching algorithm. Specifically, it reduces the processing time ranging from 14% to 20%, while maintaining almost the same quality of the reconstructed image.