Block Matching Algorithm Based on Particle Swarm Optimization for Motion Estimation
In this paper,based on Particle Swarm OptimiTation (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.
Xuedong Yuan Xiaojing Shen
College of Computer Science Sichuan University Chengdu,Sichuan,610064,P.R.China College of Mathematics Sichuan University Chengdu,Sichuan,610064,P.R.China
国际会议
成都
英文
191-195
2008-01-01(万方平台首次上网日期,不代表论文的发表时间)