Embedded Software and Systems, Second International Conference on (2008)
July 29, 2008 to July 31, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICESS.2008.35
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.
X. Shen and X. Yuan, "Block Matching Algorithm Based on Particle Swarm Optimization for Motion Estimation," 2008 International Conference on Embedded Software and Systems(ICESS), Sichuan, 2008, pp. 191-195.