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

被引:8
作者
Alwan, Hiba Basim [1 ]
Ku-Mahamud, Ku Ruhana [2 ]
机构
[1] Minist Finance, Natl Board Pens, Ctr Informat & Comp Syst, Baghdad, Iraq
[2] Univ Utara Malaysia, Sch Comp, Sintok 06010, Kedah, Malaysia
关键词
Feature selection; Speeded-up robust feature; Winner-takes-all; Hash function; Cancellable biometric; SURF; FINGERPRINT; DESCRIPTOR; GENERATION; BIOMETRICS; SEGMENTATION; REGISTRATION; RECOGNITION; INVARIANT; DETECTOR;
D O I
10.1007/s11042-020-09319-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 cancellable 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 grayscale images of sizes 168 x 192 and 112 x 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.
引用
收藏
页码:28675 / 28693
页数:19
相关论文
共 46 条
[1]   An alignment-free cancelable fingerprint template for bio-cryptosystems [J].
Alam, Badiul ;
Jin, Zhe ;
Yap, Wun-She ;
Goi, Bok-Min .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 115 :20-32
[2]   A novel secure key-exchange protocol using biometrics of the sender and receiver [J].
Barman, Subhas ;
Chattopadhyay, Samiran ;
Samanta, Debasis ;
Panchal, Gaurang .
COMPUTERS & ELECTRICAL ENGINEERING, 2017, 64 :65-82
[3]   Cancellable speech template via random binary orthogonal matrices projection hashing [J].
Chee, Kong-Yik ;
Jin, Zhe ;
Cai, Danwei ;
Li, Ming ;
Yap, Wun-She ;
Lai, Yen-Lung ;
Goi, Bok-Min .
PATTERN RECOGNITION, 2018, 76 :273-287
[4]  
Cherifi F., 2010, IGI Global Disseminator of Knowledge, P1
[5]   Fast, Accurate Detection of 100,000 Object Classes on a Single Machine [J].
Dean, Thomas ;
Ruzon, Mark A. ;
Segal, Mark ;
Shlens, Jonathon ;
Vijayanarasimhan, Sudheendra ;
Yagnik, Jay .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, :1814-1821
[6]   Hierarchical co-evolutionary clustering tree-based rough feature game equilibrium selection and its application in neonatal cerebral cortex MRI [J].
Ding, Weiping ;
Lin, Chin-Teng ;
Prasad, Mukesh .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 101 :243-257
[7]   A privacy-preserving cancelable iris template generation scheme using decimal encoding and look-up table mapping. [J].
Dwivedi, Rudresh ;
Dey, Somnath ;
Singh, Ramveer ;
Prasad, Aditya .
COMPUTERS & SECURITY, 2017, 65 :373-386
[8]   Image categorization using color G-SURF invariant to light intensity [J].
Favorskaya, Margarita ;
Proskurin, Alexander .
KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 19TH ANNUAL CONFERENCE, KES-2015, 2015, 60 :681-690
[9]   Multi-biometric template protection based on bloom filters [J].
Gomez-Barrero, Marta ;
Rathgeb, Christian ;
Li, Guoqiang ;
Ramachandra, Raghavendra ;
Galbally, Javier ;
Busch, Christoph .
INFORMATION FUSION, 2018, 42 :37-50
[10]   Multi-biometric template protection based on Homomorphic Encryption [J].
Gomez-Barrero, Marta ;
Maiorana, Emanuele ;
Galbally, Javier ;
Campisi, Patrizio ;
Fierrez, Julian .
PATTERN RECOGNITION, 2017, 67 :149-163