A highly accurate three-step search algorithm with extensibility for block motion estimation
Yang Qing · Jounal of Xidian University · 2002
Among the fast search algorithms for block motion estimation, the three step search (TSS) is widely applied owing to its simplicity. But the effectiveness of small motion estimation of TSS is comparatively degraded, which reduces its motion estimation accuracy. This problem also results in TSS locking good extensibility. In this paper, we propose an improved TSS, which always reduces the search step length by 1/2 and continues searching in the first two steps. Simulation results show that the new algorithm has solved both the problems of motion estimation accuracy and extensibility. The computational complexity of the new algorithm is the same as that of TSS in the worst case, so the high efficiency of TSS is not lowered.