Adaptive search center non-linear three step search

Author

Chung, H.Y. ; Cheung, P.Y.S. ; Yung, N.H.C.

Author_Institution

Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong

Volume

2

fYear

1998

fDate

4-7 Oct 1998

Firstpage

191

Abstract

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

Keywords

adaptive signal processing; image matching; image sequences; motion estimation; search problems; video coding; PSNR; adaptive search center; average search time; block matching algorithms; block-based search algorithms; full-search; image sequences; majority motion vector; motion estimation algorithm; nonlinear center biased search point pattern; nonlinear three step search; three-step-search; video coding; Computational efficiency; Frequency selective surfaces; Motion estimation; PSNR; Prediction algorithms; Predictive models; Redundancy; Spirals; Vectors; Video coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on

Conference_Location

Chicago, IL

Print_ISBN

0-8186-8821-1

Type

conf

DOI

10.1109/ICIP.1998.723345

Filename

723345