By Topic

A new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Choi, K.T. ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong ; Chan, S.C. ; Ng, T.S.

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

Published in:

Image Processing, 1996. Proceedings., International Conference on  (Volume:1 )

Date of Conference:

16-19 Sep 1996