Fast optimal algorithm for two-bit transform motion estimation based on the reverse triangle inequality

Abstract

In this paper, a fast full-search (FS) block matching algorithm (BMA) for two-bit transform (2BT) motion estimation is developed. The algorithm evaluates lower bounds for 2BT matching criterion based on the reverse triangle inequality to eliminate the impossible candidates faster and save computations substantially. Experimental results show that while the motion estimation accuracy of the proposed algorithm is the same as that of the FS-2BT algorithm, the proposed algorithm reduces computational complexity dramatically.