Block Matching Algorithm Based on Particle Swarm Optimization for Motion Estimation

Authors:
Xuedong Yuan;Xiaojing Shen
Affiliations:
-;-
Venue:
ICESS '08 Proceedings of the 2008 International Conference on Embedded Software and Systems
Year:
2008

Citing 0
Cited 7

A novel block matching algorithm based on particle swarm optimization with mutation operator and simplex method

WSEAS Transactions on Systems and Control
On fast and accurate block-based motion estimation algorithms using particle swarm optimization

Information Sciences: an International Journal
Differential evolution algorithm for motion estimation

MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Block-matching algorithm based on differential evolution for motion estimation

Engineering Applications of Artificial Intelligence
Block matching algorithm for motion estimation based on Artificial Bee Colony (ABC)

Applied Soft Computing
Block-matching algorithm based on harmony search optimization for motion estimation

Applied Intelligence
A pattern based PSO approach for block matching in motion estimation

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.