Cart (Loading....) | Create Account
Close category search window
 

Optimization of fast block motion estimation algorithms

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)
Bing Zeng ; Dept. of Electr. & Electron. Eng, Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong ; Renxiang Li ; Liou, M.L.

There are basically three approaches for carrying out fast block motion estimation: (1) fast search by a reduction of motion vector candidates; (2) fast block-matching distortion (BMD) computation; and (3) motion field subsampling. The first approach has been studied more extensively since different ways of reducing motion vector candidates may result in significantly different performance; while the second and third approaches can in general be integrated into the first one so as to further accelerate the estimation process. In this paper, we first formulate the design of good fast estimation algorithms based on motion vector candidate reduction into an optimization problem that involves the checking point pattern (CPP) design via minimizing the distance from the true motion vector to the closest checking point (DCCP). Then, we demonstrate through extensive studies on the statistical behavior of real-world motion vectors that the DCCP minimization can result in fast search algorithms that are very efficient as well as highly robust. To further utilize the spatiotemporal correlation of motion vectors, we develop an adaptive search scheme and a hybrid search idea that involves a fixed CPP and a variable CPP. Simulations are performed to confirm their advantages over conventional fast search algorithms

Published in:

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

Date of Publication:

Dec 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.