bibtype J - Journal Article
ARLID 0559878
utime 20240903190027.9
mtime 20220810235959.9
SCOPUS 85136800613
WOS 000839688200001
DOI 10.3390/math10152721
title (primary) (eng) Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments
specification
page_count 28 s.
media_type E
serial
ARLID cav_un_epca*0453601
ISSN 2227-7390
title Mathematics
volume_id 10
publisher
name MDPI
keyword face recognition
keyword orthogonal polynomials
keyword orthogonal moments
keyword feature extraction
keyword block processing
author (primary)
ARLID cav_un_auth*0428248
name1 Abdulhussain
name2 S. H.
country IQ
author
ARLID cav_un_auth*0428249
name1 Mahmmod
name2 B. M.
country IQ
author
ARLID cav_un_auth*0434324
name1 AlGhadhban
name2 A.
country SA
author
ARLID cav_un_auth*0101087
name1 Flusser
name2 Jan
institution UTIA-B
full_dept (cz) Zpracování obrazové informace
full_dept Department of Image Processing
department (cz) ZOI
department ZOI
full_dept Department of Image Processing
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
url http://library.utia.cas.cz/separaty/2022/ZOI/flusser-0559878.pdf
source
url https://www.mdpi.com/2227-7390/10/15/2721
cas_special
project
project_id GA21-03921S
agency GA ČR
ARLID cav_un_auth*0412209
abstract (eng) 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.
result_subspec WOS
RIV JC
FORD0 10000
FORD1 10200
FORD2 10201
reportyear 2023
num_of_auth 4
inst_support RVO:67985556
permalink https://hdl.handle.net/11104/0333425
confidential S
article_num 2721
mrcbC86 n.a. Article Mathematics
mrcbC91 A
mrcbT16-e MATHEMATICS
mrcbT16-j 0.369
mrcbT16-s 0.446
mrcbT16-D Q3
mrcbT16-E Q3
arlyear 2022
mrcbU14 85136800613 SCOPUS
mrcbU24 PUBMED
mrcbU34 000839688200001 WOS
mrcbU63 cav_un_epca*0453601 Mathematics 2227-7390 2227-7390 Roč. 10 č. 15 2022 MDPI ONLINE