Adaptive Search Center Non-Linear Three Step Search

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 fullsearch, yet an average search time faster than the threestep-search.

• Type: Conference
• Year: 1998
• Where: ICIP
• Authors: Hing Y. Chung, Paul Y. S. Cheung, N. H. C. Yung
• Keywords: Average Search Time, Block-based Search Algorithms, ICIP 1998, Image Processing, Motion Estimation Algorithm