Name
Abstract | ||
|---|---|---|
Unconstrained face recognition is still an open problem as the state-of-the-art algorithms have not yet reached high recognition performance in real-world environments. This paper addresses this problem by proposing a new approach called sparse fingerprint classification algorithm (SFCA). In the training phase, for each enrolled subject, a grid of patches is extracted from each subject’s face images in order to construct representative dictionaries. In the testing phase, a grid is extracted from the query image and every patch is transformed into a binary sparse representation using the dictionary, creating a fingerprint of the face. The binary coefficients vote for their corresponding classes and the maximum-vote class decides the identity of the query image. Experiments were carried out on seven widely-used face databases. The results demonstrate that when the size of the data set is small or medium (e.g., the number of subjects is not greater than one hundred), SFCA is able to deal with a larger degree of variability in ambient lighting, pose, expression, occlusion, face size, and distance from the camera than other current state-of-the-art algorithms. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TIFS.2017.2680403 | IEEE Trans. Information Forensics and Security |
Keywords | Field | DocType |
Dictionaries,Face,Face recognition,Feature extraction,Fingerprint recognition,Training,Lighting | Computer science,Fingerprint recognition,Artificial intelligence,Binary number,Facial recognition system,Computer vision,Three-dimensional face recognition,Pattern recognition,Sparse approximation,Algorithm,Fingerprint,Feature extraction,Grid | Journal |
Volume | Issue | ISSN |
12 | 7 | 1556-6013 |
Citations | PageRank | References |
8 | 0.46 | 44 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomás Larrain | 1 | 8 | 0.46 |
| John S. Bernhard | 2 | 8 | 0.46 |
| Domingo Mery | 3 | 466 | 42.09 |
| Kevin W. Bowyer | 4 | 11121 | 734.33 |