DocumentCode
2664375
Title
A new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates search
Author
Choi, K.T. ; Chan, S.C. ; Ng, T.S.
Author_Institution
Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong
Volume
1
fYear
1996
fDate
16-19 Sep 1996
Firstpage
497
Abstract
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
Keywords
computational complexity; image sampling; image sequences; motion estimation; search problems; block motion estimation; computational complexity; computer simulation; domain decimation method; fast algorithm; hexagonal subsampling pattern; multiple candidates search; robustness; Area measurement; Arithmetic; Computational complexity; Computer simulation; Current measurement; Motion estimation; Robustness; Search methods; Video coding; Video sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 1996. Proceedings., International Conference on
Conference_Location
Lausanne
Print_ISBN
0-7803-3259-8
Type
conf
DOI
10.1109/ICIP.1996.560900
Filename
560900
Link To Document