Close category search window
 

A vector based fast block motion estimation algorithm for implementation on SIMD architectures

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

4 Author(s)
Duanmu, C.J. ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada ; Ahmad, M.O. ; Swamy, M.N.S. ; Shatnawi, A.

In this paper, a fast block motion estimation algorithm that not only accelerates the process of the motion estimation but also maintains the same accuracy as that of the full search algorithm is proposed. In modern CPUs, the single instruction multiple data (SIMD) technique is commonly used to provide an execution speedup of up to eight fold. The proposed algorithm satisfies the requirements of (i) the easy computation of the lower bounds of the block matching error, and (ii) their storage in a contiguous memory space for its SIMD implementation. Simulation results show that the proposed algorithm is more than 40 times faster than the full search algorithm while keeping the accuracy of the latter.

Published in:
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on  (Volume:4 )

Date of Conference: 2002

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.