A novel adaptive crossover bacterial foraging optimization algorithm for linear discriminant analysis based face recognition

被引:23
|
作者
Panda, Rutuparna [1 ]
Naik, Manoj Kumar [2 ]
机构
[1] Veer Surendra Sai Univ Technol, Dept Elect & Telecommun Engn, Burla 768018, India
[2] SOA Univ, Inst Tech Educ & Res, Dept Elect & Instrumentat Engn, Bhubaneswar 751030, Orissa, India
关键词
Soft computing; Genetic algorithm; Bacterial foraging optimization; Principal component analysis; Linear discriminant analysis; Face recognition; DISTRIBUTED OPTIMIZATION; BIOMIMICRY; FISHER;
D O I
10.1016/j.asoc.2015.02.021
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:722 / 736
页数:15
相关论文
共 50 条
  • [21] Incremental linear discriminant analysis for face recognition
    Zhao, Haitao
    Yuen, Pong Chi
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2008, 38 (01): : 210 - 221
  • [22] Linear discriminant analysis of MPF for face recognition
    Zhao, W
    Nandhakumar, N
    FOURTEENTH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1 AND 2, 1998, : 185 - 188
  • [23] Boosting linear discriminant analysis for face recognition
    Lu, JW
    Plataniotis, KN
    Venetsanopoulos, AN
    2003 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL 1, PROCEEDINGS, 2003, : 657 - 660
  • [24] Application of Adaptive PID Controller Based On Bacterial Foraging Optimization Algorithm
    Wu, Guozhong
    2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 2353 - 2356
  • [25] Component-based cascade linear discriminant analysis for face recognition
    Zhang, WC
    Shan, SG
    Gao, W
    Chang, YZ
    Cao, B
    ADVANCES IN BIOMETRIC PERSON AUTHENTICATION, PROCEEDINGS, 2004, 3338 : 288 - 295
  • [26] Face Recognition Using Clustering Based Optimal Linear Discriminant Analysis
    Yang, Wenxin
    Rao, Shuqin
    Wang, Jina
    Yin, Jian
    Chen, Jian
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2008, 5139 : 241 - +
  • [27] Side-Information based Linear Discriminant Analysis for Face Recognition
    Kan, Meina
    Shan, Shiguang
    Xu, Dong
    Chen, Xilin
    PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2011, 2011,
  • [28] COLOR LINEAR DISCRIMINANT ANALYSIS FOR FACE RECOGNITION BASED ON QUATERNION MODEL
    Ling, Si-Tao
    Hu, Zhe-Han
    Yang, Bing
    Li, Yi-Ding
    PACIFIC JOURNAL OF OPTIMIZATION, 2024, 20 (02): : 265 - 285
  • [29] Component-based cascade linear discriminant analysis for face recognition
    Zhang, Wenchao
    Shan, Shiguang
    Gao, Wen
    Chang, Yizheng
    Cao, Bo
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3338 : 288 - 295
  • [30] A linear discriminant analysis framework based on random subspace for face recognition
    Zhang, Xiaoxun
    Jia, Yunde
    PATTERN RECOGNITION, 2007, 40 (09) : 2585 - 2591