A new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates search
Kuiwon Choi, S.C. Chan, T.S. Ng · 2002
In this paper we present a fast algorithm to reduce the computational complexity of block motion estimation. The reduction is obtained from the use of a new hexagonal subsampling pattern and the domain decimation method introduced by Cheng and Chan (see Proc. IEEE ICASSP, vol.4, p.2313, 1996). The multiple candidates search method is also introduced to improve the robustness of the algorithm. Computer simulation shows that the performance is very close to that of the full search.