All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00559878" target="_blank" >RIV/67985556:_____/22:00559878 - isvavai.cz</a>

  • Alternative codes found

    RIV/61384399:31160/22:00058809

  • Result on the web

    <a href="https://www.mdpi.com/2227-7390/10/15/2721" target="_blank" >https://www.mdpi.com/2227-7390/10/15/2721</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/math10152721" target="_blank" >10.3390/math10152721</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments

  • Original language description

    Face 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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA21-03921S" target="_blank" >GA21-03921S: Inverse problems in image processing</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Mathematics

  • ISSN

    2227-7390

  • e-ISSN

    2227-7390

  • Volume of the periodical

    10

  • Issue of the periodical within the volume

    15

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    28

  • Pages from-to

    2721

  • UT code for WoS article

    000839688200001

  • EID of the result in the Scopus database

    2-s2.0-85136800613