Efficient chaotic-Baker-map-based cancelable face recognition.

Autor: Faragallah, Osama S., Naeem, Ensherah A., El-Shafai, Walid, Ramadan, Noha, Ahmed, Hossam El-din H., Elnaby, Mustafa M. Abd, Elashry, Ibrahim, El-khamy, Said E., El-Samie, Fathi E. Abd
Zdroj: Journal of Ambient Intelligence & Humanized Computing; Mar2023, Vol. 14 Issue 3, p1837-1875, 39p
Abstrakt: Biometric recognition schemes are commonly utilized for security purposes. These schemes face two major challenges: security challenge and reliance on a particular biometric for authentication. The protection challenge comes from the use of basic biometrics in records. Therefore, if these records are compromised, the biometrics will no longer be valid. Consequently, it is necessary to preserve basic biometrics by protecting them from being used in biometric records. Cancelable biometric recognition systems rely on changing the information or biometric features to different formats, so that persons can use their specific biometric models in single or multiple systems. The mixture of chaos theory and cryptography shapes a crucial area for information security. The newest development in encryption systems is chaos-based for various distinctive attributes such as sensitivity to preliminary conditions, non-convergence, non-periodicity, and control parameters. This paper introduces a method to produce numerous encrypted biometric templates that are re-created by various convolution kernels generated from employing chaotic Baker map in different domains. Our proposed method has superior performance in treating variations in illumination, occlusion and facial expressions. It also has the added novelty of being able to perform authentication in the encrypted domain. In addition, the same approach can be applied on different databases. The chaotic map effect in different domains is evaluated on the widely-used AT&T, YALE, UFI, LFW, and FERET databases. The cancelable biometric system using the proposed Discrete Wavelet Transform (DWT) domain encryption with various keys has the best performance among all other implementations. In average, we achieved a 2% error probability, a 0.3 s authentication time, a 0.02% False Rejection Rate (FRR), a 0% False Acceptance Rate (FAR), a 0.0% Equal Error Rate (EER) and a 98.43% accuracy. Our proposed method also provides template diversity. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: