PH-BRINT: Pooled homomorphic binary rotation invariant and noise tolerant representation for face recognition under illumination variations

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Face recognition under varying illumination conditions is a challenging problem. We propose a simple and effective multiresolution approach Pooled Homomorphic Binary Rotation Invariant and Noise Tolerant (PHBRINT) for face recognition under varying illumination conditions. First, to reduce the effect of illumination, wavelet transform based homomorphic filter is used. Then Binary Rotation Invariant and Noise Tolerant (BRINT) operators with three different scales are employed to extract multiscale local rotation invariant and illumination insensitive texture features. Finally, the discriminative information from the three scales is pooled using MAX pooling operator and localized gradient information is computed by dividing the pooled image into blocks and calculating the gradient magnitude and direction of each block. The PH-BRINT technique has been tested on a challenging face database Extended Yale B, which was captured under varying illumination conditions. The system using minimum distance classifier with L1-norm achieved an average accuracy of 86.91%, which is comparable with the state-of-the-art best illumination-invariant face recognition techniques.

Cite

CITATION STYLE

APA

Alrabiah, R., Hussain, M., Aboalsamh, H. A., Zuair, M., & Bebis, G. (2016). PH-BRINT: Pooled homomorphic binary rotation invariant and noise tolerant representation for face recognition under illumination variations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10072 LNCS, pp. 779–789). Springer Verlag. https://doi.org/10.1007/978-3-319-50835-1_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free