首页> 外文会议>IEEE International Conference on Advanced Computational Intelligence >PSO versus GAs for fast object localization problem
【24h】

PSO versus GAs for fast object localization problem

机译:PSO与气体快速对象本地化问题

获取原文

摘要

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.
机译:粒子群优化(PSO)和遗传算法(气体)是两种广泛使用的进化缩进技术。 本文实现了粒子群优化器,并与对象定位问题的遗传算法进行了比较。 可以将对象本地化的问题分为整数非线性优化问题(INOP)。 我们分别扩展基本PSO和GA以解决制定的INOP。 在具有复杂背景的一组42个测试图像上进行了实验。 结果表明,虽然GA和PSO分享了许多常见功能,但PSO比GA更适合这个问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号