Number of the records: 1  

Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments

  1. 1.
    SYSNO ASEP0559878
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleFace Recognition Algorithm Based on Fast Computation of Orthogonal Moments
    Author(s) Abdulhussain, S. H. (IQ)
    Mahmmod, B. M. (IQ)
    AlGhadhban, A. (SA)
    Flusser, Jan (UTIA-B) RID, ORCID
    Number of authors4
    Article number2721
    Source TitleMathematics. - : MDPI
    Roč. 10, č. 15 (2022)
    Number of pages28 s.
    Publication formOnline - E
    Languageeng - English
    CountryCH - Switzerland
    Keywordsface recognition ; orthogonal polynomials ; orthogonal moments ; feature extraction ; block processing
    Subject RIVJC - Computer Hardware ; Software
    OECD categoryComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    R&D ProjectsGA21-03921S GA ČR - Czech Science Foundation (CSF)
    Method of publishingOpen access
    Institutional supportUTIA-B - RVO:67985556
    UT WOS000839688200001
    EID SCOPUS85136800613
    DOI10.3390/math10152721
    AnnotationFace recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far. however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face image datasets, ORL and FEI. Different state-of-the-art face recognition methods were compared with the proposed method in order to evaluate its accuracy. We demonstrate that the proposed method achieves the highest recognition rate in different considered scenarios. Based on the obtained results, it can be seen that the proposed method is robust against noise and significantly outperforms previous approaches in terms of speed.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2023
    Electronic addresshttps://www.mdpi.com/2227-7390/10/15/2721
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.