IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v11y2020i2p118-133.html
   My bibliography  Save this article

Face Recognition Using RLDA Method Based on Mutated Cuckoo Search Algorithm to Extract Optimal Features

Author

Listed:
  • Souheila Benkhaira

    (The Computer Science and its Applications Department, Constantine2 University, Ali Mendjeli, Algeria)

  • Abdesslem Layeb

    (The Computer Science and its Applications Department, Constantine2 University, Ali Mendjeli, Algeria)

Abstract

Regularized-LDA (R-LDA) is one of the most successful holistic approaches that is introduced to overcome the “small sample size” (SSS) problem of the LDA method, which is often encountered in Face Recognition (FR) tasks. R-LDA is based on reducing the high variance of principal components of the within-class scatter matrix to optimize the regularized Fisher's criterion. In this article, the authors assume that some of these components do not have significant information and they can be discarded. To this end, the authors propose CS-RLDA that uses a Cuckoo search (CS) algorithm to select the optimal eigenvectors from a within-class matrix. However, the CS algorithm has a slow convergence speed. To deal with this problem, and to create more diversity and better trade-off between exploitation and exploration around the best solutions, the authors have modified the basic cuckoo algorithm by using a mutation operator. The experimental results performed on the ORL and UMIST databases indicate that the proposed method enhances the performance of FR.

Suggested Citation

  • Souheila Benkhaira & Abdesslem Layeb, 2020. "Face Recognition Using RLDA Method Based on Mutated Cuckoo Search Algorithm to Extract Optimal Features," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 11(2), pages 118-133, April.
  • Handle: RePEc:igg:jamc00:v:11:y:2020:i:2:p:118-133
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2020040106
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:11:y:2020:i:2:p:118-133. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.