基于赛事选择的果蝇优化及其在模板匹配中的应用

Weijia Cui, Yuzhu He
{"title":"基于赛事选择的果蝇优化及其在模板匹配中的应用","authors":"Weijia Cui, Yuzhu He","doi":"10.1109/IMCEC.2016.7867234","DOIUrl":null,"url":null,"abstract":"In this paper, an improved fruit fly optimization algorithm based on tournament selection mechanism (TS-FFO) is put forward. In TS-FFO, considering the fact that the aggregation way in the vision optimization phase will easily cause the loss of biodiversity and make the population jump into the local extreme, tournament selection mechanism is embed into FFO to randomly generate a new conductive individual to replace the current best fruit fly. In addition, in view of the blind search surrounding the best individual in the osphresis optimization phase, the evolutionary formula is also redefined by incorporating the current individual's own information to effectively control the evolution direction and step size. Six high dimensional benchmark functions are used to test and evaluate the TS-FFO. The experimental results demonstrate that TS-FFO has quicker optimizing efficiency and better accuracy compared with the standard FFO and several advanced algorithms. TS-FFO is also used to solve the image template matching problems and the statistical results show that our proposed approach is more effective and efficient than the particle swarm optimization (PSO) and differential search algorithms (DSA).","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Tournament selection based fruit fly optimization and its application in template matching\",\"authors\":\"Weijia Cui, Yuzhu He\",\"doi\":\"10.1109/IMCEC.2016.7867234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improved fruit fly optimization algorithm based on tournament selection mechanism (TS-FFO) is put forward. In TS-FFO, considering the fact that the aggregation way in the vision optimization phase will easily cause the loss of biodiversity and make the population jump into the local extreme, tournament selection mechanism is embed into FFO to randomly generate a new conductive individual to replace the current best fruit fly. In addition, in view of the blind search surrounding the best individual in the osphresis optimization phase, the evolutionary formula is also redefined by incorporating the current individual's own information to effectively control the evolution direction and step size. Six high dimensional benchmark functions are used to test and evaluate the TS-FFO. The experimental results demonstrate that TS-FFO has quicker optimizing efficiency and better accuracy compared with the standard FFO and several advanced algorithms. TS-FFO is also used to solve the image template matching problems and the statistical results show that our proposed approach is more effective and efficient than the particle swarm optimization (PSO) and differential search algorithms (DSA).\",\"PeriodicalId\":218222,\"journal\":{\"name\":\"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCEC.2016.7867234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCEC.2016.7867234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

提出了一种基于比赛选择机制的果蝇优化算法(TS-FFO)。在TS-FFO中,考虑到视觉优化阶段的聚集方式容易造成生物多样性的丧失,使种群陷入局部极值,在FFO中嵌入竞赛选择机制,随机生成新的导电个体替代当前最优的果蝇。此外,针对动态优化阶段围绕最佳个体的盲目搜索,重新定义进化公式,结合当前个体自身信息,有效控制进化方向和步长。采用六个高维基准函数对TS-FFO进行测试和评价。实验结果表明,与标准FFO和几种先进算法相比,TS-FFO具有更快的优化效率和更高的精度。将TS-FFO算法应用于图像模板匹配问题,统计结果表明,该方法比粒子群优化算法(PSO)和差分搜索算法(DSA)更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Tournament selection based fruit fly optimization and its application in template matching
In this paper, an improved fruit fly optimization algorithm based on tournament selection mechanism (TS-FFO) is put forward. In TS-FFO, considering the fact that the aggregation way in the vision optimization phase will easily cause the loss of biodiversity and make the population jump into the local extreme, tournament selection mechanism is embed into FFO to randomly generate a new conductive individual to replace the current best fruit fly. In addition, in view of the blind search surrounding the best individual in the osphresis optimization phase, the evolutionary formula is also redefined by incorporating the current individual's own information to effectively control the evolution direction and step size. Six high dimensional benchmark functions are used to test and evaluate the TS-FFO. The experimental results demonstrate that TS-FFO has quicker optimizing efficiency and better accuracy compared with the standard FFO and several advanced algorithms. TS-FFO is also used to solve the image template matching problems and the statistical results show that our proposed approach is more effective and efficient than the particle swarm optimization (PSO) and differential search algorithms (DSA).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信