|Title:||Continuous distribution approximation and thresholds optimization in serial multi-modal biometric systems||Journal:||International Journal of Computers, Communications and Control||Volume:||11||Issue:||5||First page:||721||Last page:||734||Issue Date:||1-Jan-2016||Rank:||M23||ISSN:||1841-9836||DOI:||10.15837/ijccc.2016.5.2683||Abstract:||
Multi-modal biometric verification systems use information from several biometric modalities to verify an identity of a person. The false acceptance rate (FAR) and false rejection rate (FRR) are metrics generally used to measure the performance of such systems. In this paper, we first approximate the score distributions of both genuine users and impostors by continuous distributions. Then we incorporate the exact expressions of the distributions in the formulas for the expected values of both FAR and FRR for each matcher. In order to determine the upper and lower acceptance thresholds in the sequential multi-modal biometric matching, we further minimize the expected values of FAR and FRR for the entire processing chain. We propose a non-linear bi-objective programming problem whose objective functions are the two error probabilities. We analyze the efficient set of the bi-objective problem, and derive an efficient solution as a best compromise between the error probabilities. Replacing the least squares approximation of the score distributions by a continuous distribution approximation, this approach modifies the method presented in Stanojevic et al.  (doi: 10.1109/ICCCC.2016.7496752)a. The results of our experiments showed a good performance of the sequential multiple biometric matching system based on continuous distribution approximation and optimized thresholds.
|Keywords:||Continuous distribution approximation | Multi-criteria optimization | Multi-modal biometrics | Sequential fusion||Publisher:||Agora University||Project:||Multimodal Biometry in Identity Management
Optimization of Distributive and Reverse Flows in Logistic Systems
Show full item record
checked on Jan 30, 2023
checked on Jan 31, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.