z-logo
open-access-imgOpen Access
Secure multimodal biometric system based on diffused graphs and optimal score fusion
Author(s) -
Walia Gurjit Singh,
Rishi Shivam,
Asthana Rajesh,
Kumar Aarohi,
Gupta Anjana
Publication year - 2019
Publication title -
iet biometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 28
eISSN - 2047-4946
pISSN - 2047-4938
DOI - 10.1049/iet-bmt.2018.5018
Subject(s) - computer science , biometrics , artificial intelligence , biometric data , information retrieval , natural language processing
Biometric authentication systems offer potential advantages over traditional knowledge‐based methods. However, most of the biometric systems which are extensively used lack template security and robustness. In order to address these issues, in this study, the authors have proposed a multimodal biometric system based on the combination of multiple modalities and optimal score level fusion. In addition, key features are introduced for each modality for generating cancellable biometric features. Features from individual traits are combined with corresponding key features to provide feature transformation. A robust template is generated by diffusion of individual transformed matrices using graph‐based random walk cross‐diffusion. In addition, individual classifier score is optimally fused using proposed multistage score level fusion model. Optimal belief masses for individual classifier are determined using cuckoo search optimisation. Wherein, optimal classifier beliefs are fused using DSmT based proportional conflict redistribution (PCR‐6) rules. Experimental results demonstrate that optimal score fusion applied on cross‐diffused features produce better results than existing state‐of‐the‐art multimodal fusion schemes. On average of the outcome, equal error rate and accuracy achieved using the proposed method on four chimeric benchmarked datasets, are 2.32 and 98.316%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here