Face recognition remains critical and up-to-date due to its undeniable contribution to security. Many descriptors, the most vital figures used for face discrimination, have been proposed and continue to be done. This article presents a novel and highly discriminative identifier that can maintain high recognition performance, even under high noise, varying illumination, and expression exposure. By evolving the image into a graph, the feature set is extracted from the resulting graph rather than making inferences directly on the image pixels as done conventionally. The adjacency matrix is created at the outset by considering the pixels’ adjacencies and their intensity values. Subsequently, the weighteddirected graph having vertices and edges denoting the pixels and adjacencies between them is formed. Moreover, the weights of the edges state the intensity differences between the adjacent pixels. Ultimately, information extraction is performed, which indicates the importance of each vertex in the graphic, expresses the importance of the pixels in the entire image, and forms the feature set of the face image. As evidenced by the extensive simulations performed, the proposed graphic-based identifier shows remarkable and competitive performance regarding recognition accuracy, even under extreme conditions such as high noise, variable expression, and illumination compared with the state-of-the-art face recognition methods.
Eser Adı (dc.title) | A local-holistic graph-based descriptor for facial recognition |
Yazar (dc.contributor.author) | Metin Zontul |
Yayın Yılı (dc.date.issued) | 2022 |
Tür (dc.type) | Makale |
Özet (dc.description.abstract) | Face recognition remains critical and up-to-date due to its undeniable contribution to security. Many descriptors, the most vital figures used for face discrimination, have been proposed and continue to be done. This article presents a novel and highly discriminative identifier that can maintain high recognition performance, even under high noise, varying illumination, and expression exposure. By evolving the image into a graph, the feature set is extracted from the resulting graph rather than making inferences directly on the image pixels as done conventionally. The adjacency matrix is created at the outset by considering the pixels’ adjacencies and their intensity values. Subsequently, the weighteddirected graph having vertices and edges denoting the pixels and adjacencies between them is formed. Moreover, the weights of the edges state the intensity differences between the adjacent pixels. Ultimately, information extraction is performed, which indicates the importance of each vertex in the graphic, expresses the importance of the pixels in the entire image, and forms the feature set of the face image. As evidenced by the extensive simulations performed, the proposed graphic-based identifier shows remarkable and competitive performance regarding recognition accuracy, even under extreme conditions such as high noise, variable expression, and illumination compared with the state-of-the-art face recognition methods. |
Açık Erişim Tarihi (dc.date.available) | 2022-11-25 |
Yayıncı (dc.publisher) | MULTIMEDIA TOOLS AND APPLICATIONS |
Dil (dc.language.iso) | En |
Konu Başlıkları (dc.subject) | Facial recognition |
Konu Başlıkları (dc.subject) | Graphs |
Konu Başlıkları (dc.subject) | Illumination |
Konu Başlıkları (dc.subject) | Noise |
Konu Başlıkları (dc.subject) | Facial expression |
Tek Biçim Adres (dc.identifier.uri) | https://hdl.handle.net/20.500.14081/1642 |
ISSN (dc.identifier.issn) | 1380-7501 |
Dergi (dc.relation.journal) | MULTIMEDIA TOOLS AND APPLICATIONS |
Dergi Sayısı (dc.identifier.issue) | 13 |
Esere Katkı Sağlayan (dc.contributor.other) | Taner Cevik |
Esere Katkı Sağlayan (dc.contributor.other) | Nazife Cevik |
DOI (dc.identifier.doi) | 10.1007/s11042-022-14152-9 |
Orcid (dc.identifier.orcid) | 0000-0002-7557-2981 |
Bitiş Sayfası (dc.identifier.endpage) | 19298 |
Başlangıç Sayfası (dc.identifier.startpage) | 19275 |
Dergi Cilt (dc.identifier.volume) | 82 |
wosquality (dc.identifier.wosquality) | Q2 |
wosauthorid (dc.contributor.wosauthorid) | EIV-4571-2022 |
Department (dc.contributor.department) | Bilgisayar Mühendisliği |
Wos No (dc.identifier.wos) | WOS:000883287200005 |
Veritabanları (dc.source.platform) | Wos |
Veritabanları (dc.source.platform) | Scopus |