Multi-Block Color-Binarized Statistical Images for Single-Sample Face Recognition.
K-nearest neighbors
binarized statistical image features
biometrics
face recognition
single-sample face recognition
Journal
Sensors (Basel, Switzerland)
ISSN: 1424-8220
Titre abrégé: Sensors (Basel)
Pays: Switzerland
ID NLM: 101204366
Informations de publication
Date de publication:
21 Jan 2021
21 Jan 2021
Historique:
received:
08
12
2020
revised:
14
01
2021
accepted:
19
01
2021
entrez:
26
1
2021
pubmed:
27
1
2021
medline:
21
4
2021
Statut:
epublish
Résumé
Single-Sample Face Recognition (SSFR) is a computer vision challenge. In this scenario, there is only one example from each individual on which to train the system, making it difficult to identify persons in unconstrained environments, mainly when dealing with changes in facial expression, posture, lighting, and occlusion. This paper discusses the relevance of an original method for SSFR, called Multi-Block Color-Binarized Statistical Image Features (MB-C-BSIF), which exploits several kinds of features, namely, local, regional, global, and textured-color characteristics. First, the MB-C-BSIF method decomposes a facial image into three channels (e.g., red, green, and blue), then it divides each channel into equal non-overlapping blocks to select the local facial characteristics that are consequently employed in the classification phase. Finally, the identity is determined by calculating the similarities among the characteristic vectors adopting a distance measurement of the K-nearest neighbors (K-NN) classifier. Extensive experiments on several subsets of the unconstrained Alex and Robert (AR) and Labeled Faces in the Wild (LFW) databases show that the MB-C-BSIF achieves superior and competitive results in unconstrained situations when compared to current state-of-the-art methods, especially when dealing with changes in facial expression, lighting, and occlusion. The average classification accuracies are 96.17% and 99% for the AR database with two specific protocols (i.e., Protocols I and II, respectively), and 38.01% for the challenging LFW database. These performances are clearly superior to those obtained by state-of-the-art methods. Furthermore, the proposed method uses algorithms based only on simple and elementary image processing operations that do not imply higher computational costs as in holistic, sparse or deep learning methods, making it ideal for real-time identification.
Identifiants
pubmed: 33494516
pii: s21030728
doi: 10.3390/s21030728
pmc: PMC7865363
pii:
doi:
Types de publication
Journal Article
Langues
eng
Sous-ensembles de citation
IM
Déclaration de conflit d'intérêts
The authors declare no conflict of interest.
Références
IEEE Trans Pattern Anal Mach Intell. 2005 Mar;27(3):328-340
pubmed: 15747789
IEEE Trans Pattern Anal Mach Intell. 2013 Jan;35(1):39-51
pubmed: 22431525
J Healthc Eng. 2020 Nov 23;2020:8889412
pubmed: 33299538
Proc Natl Acad Sci U S A. 2018 Jun 12;115(24):6171-6176
pubmed: 29844174
IEEE Trans Pattern Anal Mach Intell. 2004 Jan;26(1):131-7
pubmed: 15382693
Sensors (Basel). 2020 Sep 27;20(19):
pubmed: 32992524
Sensors (Basel). 2020 Jan 07;20(2):
pubmed: 31936089
Comput Intell Neurosci. 2018 Aug 23;2018:3803627
pubmed: 30210533
Trends Cogn Sci. 2002 Feb 1;6(2):59-64
pubmed: 15866182
IEEE Trans Pattern Anal Mach Intell. 2009 Feb;31(2):210-27
pubmed: 19110489
J Cogn Neurosci. 1991 Winter;3(1):71-86
pubmed: 23964806
IEEE Trans Neural Netw. 2005 Jul;16(4):875-86
pubmed: 16121729
Sensors (Basel). 2019 Jan 03;19(1):
pubmed: 30609846
IEEE Trans Pattern Anal Mach Intell. 2012 Sep;34(9):1864-70
pubmed: 22813959