scholarly journals Robust Single-Sample Face Recognition by Sparsity-Driven Sub-Dictionary Learning Using Deep Features

Sensors ◽  
2019 ◽  
Vol 19 (1) ◽  
pp. 146 ◽  
Author(s):  
Vittorio Cuculo ◽  
Alessandro D’Amelio ◽  
Giuliano Grossi ◽  
Raffaella Lanzarotti ◽  
Jianyi Lin

Face recognition using a single reference image per subject is challenging, above all when referring to a large gallery of subjects. Furthermore, the problem hardness seriously increases when the images are acquired in unconstrained conditions. In this paper we address the challenging Single Sample Per Person (SSPP) problem considering large datasets of images acquired in the wild, thus possibly featuring illumination, pose, face expression, partial occlusions, and low-resolution hurdles. The proposed technique alternates a sparse dictionary learning technique based on the method of optimal direction and the iterative ℓ 0 -norm minimization algorithm called k-LiMapS. It works on robust deep-learned features, provided that the image variability is extended by standard augmentation techniques. Experiments show the effectiveness of our method against the hardness introduced above: first, we report extensive experiments on the unconstrained LFW dataset when referring to large galleries up to 1680 subjects; second, we present experiments on very low-resolution test images up to 8 × 8 pixels; third, tests on the AR dataset are analyzed against specific disguises such as partial occlusions, facial expressions, and illumination problems. In all the three scenarios our method outperforms the state-of-the-art approaches adopting similar configurations.

2019 ◽  
Vol 28 (4) ◽  
pp. 2051-2062 ◽  
Author(s):  
Shiming Ge ◽  
Shengwei Zhao ◽  
Chenyu Li ◽  
Jia Li

Author(s):  
Yongjie Chu ◽  
Yong Zhao ◽  
Touqeer Ahmad ◽  
Lindu Zhao

Numerous low-resolution (LR) face images are captured by a growing number of surveillance cameras nowadays. In some particular applications, such as suspect identification, it is required to recognize an LR face image captured by the surveillance camera using only one high-resolution (HR) profile face image on the ID card. This leads to LR face recognition with single sample per person (SSPP), which is more challenging than conventional LR face recognition or SSPP face recognition. To address this tough problem, we propose a Boosted Coupled Marginal Fisher Analysis (CMFA) approach, which unites domain adaptation and coupled mappings. An auxiliary database containing multiple HR and LR samples is introduced to explore more discriminative information, and locality preserving domain adaption (LPDA) is designed to realize good domain adaptation between SSPP training set (target domain) and auxiliary database (source domain). We perform LPDA on HR and LR images in both domains, then in the domain adaptation space we apply CMFA to learn the discriminative coupled mappings for classification. The learned coupled mappings embed knowledge from the auxiliary dataset, thus their discriminative ability is superior. We extensively evaluate the proposed method on FERET, LFW and SCface database, the promising results demonstrate its effectiveness on LR face recognition with SSPP.


2017 ◽  
Vol 141 ◽  
pp. 144-157 ◽  
Author(s):  
Yongjie Chu ◽  
Touqeer Ahmad ◽  
George Bebis ◽  
Lindu Zhao

2019 ◽  
Vol 14 (8) ◽  
pp. 2000-2012 ◽  
Author(s):  
Pei Li ◽  
Loreto Prieto ◽  
Domingo Mery ◽  
Patrick J. Flynn

Author(s):  
Insaf Adjabi ◽  
Amir Benzaoui ◽  
Abdeldjalil Ouahabi ◽  
Sebastien Jacques

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, particularly when dealing with changes in facial expression, posture, lighting, and occlusion. This paper suggests a different method based on a variant of the Binarized Statistical Image Features (BSIF) descriptor called Multi-Block Color-Binarized Statistical Image Features (MB-C-BSIF) to resolve the SSFR Problem. 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 & Robert (AR) and Labeled Faces in the Wild (LFW) databases show that the MB-C-BSIF achieves superior results in unconstrained situations when compared to current state-of-the-art methods, especially when dealing with changes in facial expression, lighting, and occlusion. Furthermore, the suggested method employs algorithms with lower computational cost, making it ideal for real-time applications.


Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 728
Author(s):  
Insaf Adjabi ◽  
Abdeldjalil Ouahabi ◽  
Amir Benzaoui ◽  
Sébastien Jacques

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.


2019 ◽  
Vol 25 (2) ◽  
pp. 256-279 ◽  
Author(s):  
Amy Dawel ◽  
Tsz Ying Wong ◽  
Jodie McMorrow ◽  
Callin Ivanovici ◽  
Xuming He ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document