Enhanced Local Binary Pattern Algorithm for Facial Recognition Using Chinese Remainder Theorem

Abstract

Current biometrics research focuses on achieving a high authentication success rate for identity management and discussing the threat of various security attacks. Local Binary Pattern (LBP), one of the methods for feature extraction, and Chicken Swarm Optimization (CSO), one of the strategies for feature selection, were used for user identification and authentication. LBP requires high computational time to extract features from the facial images. The Chinese Remainder Theorem (CRT) was used to reduce its computational time by formulating an Enhanced Local Binary Pattern (ELBP). Michael Olugbenga Banji Abolarinwa (MOBA) database was created specifically for this study. 600 frontal facial images of 200 people were collected, each with three images. 360 images were used for training while 240 images were used for testing. MATLAB (R2016a) was used to run the simulation. The time it took to classify the facial images when LBP and CSO were combined and when ELBP and CSO were combined were enumerated. The LBP-CSO achieved a false-positive rate (FPR) of 11.67%, a sensitivity (SEN) of 92.78%, a specificity (SPEC) of 88.33%, a precision (PREC) of 95.98%, and an accuracy of 91.67% in 119.10 seconds at 0.80 thresholds for face recognition. ELBP-CSO obtained an FPR of 5.00%, SEN of 95.00%, SPEC of 95.00%, PREC of 98.28%, and accuracy of 95.00% in 79.16 seconds. The results showed that LBP-CSO took an average of 119.10 seconds and ELBP-CSO took an average of 79.16 seconds. In conclusion, the performance of CSO-ELBP justifies the usage of LBP enhancement with CRT.