Adaptive search center non-linear three step search
H. Y. Chung, Pty Cheung, N.H.C. Yung · 2002
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of full-search, yet its average search time is faster than the three-step-search.