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

Simplex minimisation for fast long-term memory motion estimation

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 $31
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)
Al-Mualla, M.E. ; Etisalat Coll. of Eng., Sharjah, United Arab Emirates ; Canagarajah, C.N. ; Bull, D.R.

Three algorithms for fast long-term memory block matching motion estimation are proposed. The algorithms are extensions of the fast single-reference simplex minimisation search (SMS) algorithm. The proposed algorithms represent different degrees of compromise between prediction quality and computational complexity. With a long-term memory of 50 frames the proposed algorithms have a computational complexity comparable to that of single-reference full-search while still maintaining the prediction gain of long-term memory motion estimation

Published in:

Electronics Letters  (Volume:37 ,  Issue: 5 )

Date of Publication:

1 Mar 2001

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.