.png){kind=icon}
.png){kind=icon}
Return
A novel adaptive crossover bacterial foraging optimization algorithm for linear discriminant analysis based face recognition
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.02.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a modified bacterial foraging optimization algorithm called adaptive crossover bacterial foraging optimization algorithm (ACBFOA), which incorporates adaptive chemotaxis and also inherits the crossover mechanism of genetic algorithm. First part of the research work aims at improvising evaluation of the optimal objective function values. The idea of using adaptive chemotaxis is to make it computationally efficient and crossover technique is to search nearby locations by offspring bacteria. Four different benchmark functions are considered for performance evaluation. The purpose of this research work is also to investigate a face recognition algorithm with improved recognition rate. In this connection, we propose a new algorithm called ACBFO-Fisher. The proposed ACBFOA is used for finding optimal principal components for dimension reduction in linear discriminant analysis (LDA) based face recognition. Three well-known face databases, FERET, YALE and UMIST, are considered for validation. A comparison with the results of earlier methods is presented to reveal the effectiveness of the proposed ACBFO-Fisher algorithm. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Soft computing
Genetic algorithm
Bacterial foraging optimization
Principal component analysis
Linear discriminant analysis
Face recognition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W