Back to Search Start Over

PSO versus GAs for fast object localization problem.

Authors :
Fan, Xinjian
Wang, Xuelin
Xiao, Yongfei
Source :
2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI); 1/ 1/2012, p605-609, 5p
Publication Year :
2012

Abstract

Particle swarm optimization (PSO) and genetic algorithms (GAs) are two kinds of widely used evolutionary compution techniques. In this paper, a particle swarm optimizer is implemented and compared to a genetic algorithm for the object localization problem. The problem of object localization can be formulated into an integer nonlinear optimization problem (INOP). We respectively expand the basic PSO and GA to solve the formulated INOP. Experiments were made on a set of 42 test images with complex backgrounds. The results show that although GA and PSO share many common features, PSO is more suitable for the problem than GA. [ABSTRACT FROM PUBLISHER]

Details

Language :
English
ISBNs :
9781467317436
Database :
Complementary Index
Journal :
2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)
Publication Type :
Conference
Accession number :
86549999
Full Text :
https://doi.org/10.1109/ICACI.2012.6463237