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

Nobel successive elimination algorithms for the estimation of motion vectors

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)
Soo-Mok Jung ; Dept. of Comput. Sci. & Eng., Korea Univ., Seoul, South Korea ; Sung-Chul Shin ; Hyunki Baik ; Myong-Soon Park

We present fast algorithms to reduce the computation of block matching algorithms for motion estimation in video coding. Nobel successive elimination algorithms for the estimation of motion vectors are based on the successive elimination algorithm for motion estimation and fast algorithms for the estimation of motion vectors. Nobel successive elimination algorithms effectively eliminate the search points within the search window and thus decrease the number of matching evaluation that requires very intensive computations. The efficiency of each proposed algorithm was verified by experimental results

Published in:

Multimedia Software Engineering, 2000. Proceedings. International Symposium on

Date of Conference:


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.