Cancellable face template algorithm based on speeded-up robust features and winner-takes-all

• Main Authors: Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana
• Format: Article
• Language: English
• Published: Springer Nature 2020
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/27850/1/MTA%20%2079%202020%2028675%2028693.pdf; http://repo.uum.edu.my/27850/; http://doi.org/10.1007/s11042-020-09319-1

Features such as face, fingerprint, and iris imprints have been used for authentication in biometric system. The toughest feature amongst these is the face. Extracting a region with the most potential face features from an image for biometric identification followed by illumination enhancement is a commonly used method. However, the region of interest extraction followed by illumination enhancement is sensitive to image face feature displacement, skewed image, and bad illumination. This research presents a cancell able face image algorithm built upon the speeded-up robust features method to extract and select features. A speeded-up robust feature approach is utilised for the image’s features extraction, while Winner-Takes-All hashing is utilised for match-seeking. Finally, the features vectors are projected by utilising a random form of binary orthogonal matrice. Experiments were conducted on Yale and ORL datasets which provide gray scale images of sizes 168 × 192 and 112 × 92 pixels, respectively. The execution of the proposed algorithm was measured against several algorithms using equal error rate metric. It is found that the proposed algorithm produced an acceptable performance which indicates that this algorithm can be used in biometric security applications.