By Topic

Fast Motion Estimation Robust to Random Motions Based on a Distance Prediction

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
$33 $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

2 Author(s)
Y. -G. Lee ; Dept. of Electr. Eng & Comput. Sci., Korea Adv. Energy Res. Inst., Daejeon ; J. B. Ra

For fast motion estimation, a gradient descent search is widely used due to its high efficiency. However, since it does not examine all possible candidates within a search area, it suffers from PSNR degradation for sequences having fast and/or random motions. To alleviate this problem, we propose a hybrid search scheme wherein a hierarchical search scheme is selectively combined with an existing gradient descent search. For the selective combination, we introduce a measure estimating the distance between the current search point and the optimal point. Since this measure greatly reduces the need to perform hierarchical searches, their computational burden is not noticeable in the overall motion estimation while their contribution to the PSNR improvement is considerable. Using the estimated distance, we can also noticeably improve the early termination performance in a local search. Experimental results show that the proposed algorithm outperforms the other popular fast motion estimation algorithms in terms of both PSNR and search speed, especially for sequences having fast or random motions

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:16 ,  Issue: 7 )