Successive Elimination Algorithm for Truncated Gray-coded Bitplane Matching Based Motion Estimation

Abstract

In this paper, a successive elimination algorithm for truncated gray-coded bitplane matching (TGCBPM) based motion estimation (ME) is proposed. After calculating the lower bound for TGCBPM, we can substantially reduce the computational complexity by skipping the impossible candidate. Experimental results show that this proposed algorithm has an outstanding performance in terms of the computational complexity although the motion accuracy of the proposed algorithm is the same as that of the full search TGCBPM.