Sciweavers

Share
ICIP
1998
IEEE

Adaptive Search Center Non-Linear Three Step Search

9 years 5 months ago
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.
Hing Y. Chung, Paul Y. S. Cheung, N. H. C. Yung
Added 26 Oct 2009
Updated 26 Oct 2009
Type Conference
Year 1998
Where ICIP
Authors Hing Y. Chung, Paul Y. S. Cheung, N. H. C. Yung
Comments (0)
books