Comparing dynamic PSO algorithms for adapting classifier ensembles in video-based face recognition

J. Connolly, Eric Granger, R. Sabourin
{"title":"Comparing dynamic PSO algorithms for adapting classifier ensembles in video-based face recognition","authors":"J. Connolly, Eric Granger, R. Sabourin","doi":"10.1109/CIBIM.2011.5949226","DOIUrl":null,"url":null,"abstract":"Biometric models are typically designed a priori using limited number of samples acquired from complex environments that change in time during operations. Therefore, these models are often poor representatives of the biometric trait to be recognized. To circumvent this problem, ensemble of classifiers can be used to integrate solutions obtained from multiple diverse classifiers. In this paper, two dynamic particle swarm optimization (DPSO) algorithms are compared for the evolution of classifier ensembles during supervised incremental learning of newly-acquired data samples in video-based face recognition. Using the properties of these population-based optimization algorithms, an incremental DPSO learning strategy for adaptive classification systems (ACSs) is employed to evolve a pool of fuzzy ARTMAP classifiers while an heterogeneous ensemble is selected through a greedy search process that seeks to maximize both performance and diversity. The performance of dynamic niching PSO (DNPSO) and speciation PSO (SPSO) algorithms is assessed in terms of classification rate, resource requirements and diversity for different incremental learning scenarios of new data blocks extracted from real-world video streams. Simulation results indicate that both DPSO algorithms can efficiently create accurate ensembles while reducing computational complexity. In addition, directly selecting representative subswarm particles to form diversified classifier ensembles significantly reduces the computational complexity.","PeriodicalId":396721,"journal":{"name":"2011 IEEE Workshop on Computational Intelligence in Biometrics and Identity Management (CIBIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Workshop on Computational Intelligence in Biometrics and Identity Management (CIBIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBIM.2011.5949226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Biometric models are typically designed a priori using limited number of samples acquired from complex environments that change in time during operations. Therefore, these models are often poor representatives of the biometric trait to be recognized. To circumvent this problem, ensemble of classifiers can be used to integrate solutions obtained from multiple diverse classifiers. In this paper, two dynamic particle swarm optimization (DPSO) algorithms are compared for the evolution of classifier ensembles during supervised incremental learning of newly-acquired data samples in video-based face recognition. Using the properties of these population-based optimization algorithms, an incremental DPSO learning strategy for adaptive classification systems (ACSs) is employed to evolve a pool of fuzzy ARTMAP classifiers while an heterogeneous ensemble is selected through a greedy search process that seeks to maximize both performance and diversity. The performance of dynamic niching PSO (DNPSO) and speciation PSO (SPSO) algorithms is assessed in terms of classification rate, resource requirements and diversity for different incremental learning scenarios of new data blocks extracted from real-world video streams. Simulation results indicate that both DPSO algorithms can efficiently create accurate ensembles while reducing computational complexity. In addition, directly selecting representative subswarm particles to form diversified classifier ensembles significantly reduces the computational complexity.
基于视频的人脸识别中自适应分类器集成的动态粒子群算法比较
生物识别模型通常是使用从操作过程中随时间变化的复杂环境中获得的有限数量的样本进行先验设计的。因此,这些模型往往不能很好地代表待识别的生物特征。为了避免这个问题,可以使用分类器集成来集成来自多个不同分类器的解。本文比较了两种动态粒子群优化(DPSO)算法在基于视频的人脸识别中对新采集的数据样本进行监督增量学习时分类器集成的演化。利用这些基于种群的优化算法的特性,采用自适应分类系统(ACSs)的增量DPSO学习策略来进化模糊ARTMAP分类器池,同时通过贪婪搜索过程选择异构集成,以寻求性能和多样性的最大化。从分类率、资源需求和多样性等方面对动态小生境粒子群算法(DNPSO)和物种形成粒子群算法(SPSO)在不同增量学习场景下的性能进行了评估。仿真结果表明,两种DPSO算法都能有效地生成精确的集成,同时降低了计算复杂度。此外,直接选择具有代表性的子群粒子组成多样化的分类器集合,大大降低了计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信