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

Block Matching Algorithm Based on Particle Swarm Optimization for 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 $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)
Xuedong Yuan ; Coll. of Comput. Sci., Sichuan Univ., Chengdu ; Xiaojing Shen

In this paper, based on particle swarm optimization (PSO), we propose a fast block matching algorithm for motion estimation (ME) and compare the algorithm with other popular fast block-matching algorithms for ME. A real-world example shows that the block matching algorithm based on PSO for ME is more feasible than others. Moreover, the initial values of parameters in PSO are empirically discussed, since they directly affect the computational complexity. Thus, an improved PSO algorithm for ME is empirically given to reduce computational complexity.

Published in:

Embedded Software and Systems, 2008. ICESS '08. International Conference on

Date of Conference:

29-31 July 2008

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.