This paper proposes a novel fingerprint classifier fusion algorithm that accurately matches fingerprint evidence and efficiently adapts to dynamically evolving database size without compromising accuracy or speed.
This paper presents a novel fingerprint classifier fusion algorithm using Dempster-Shafer theory concomitant with update rule. The proposed algorithm accurately matches fingerprint evidence and also efficiently adapts to dynamically evolving database size without compromising accuracy or speed. The authors experimentally validate their approach using three fingerprint recognition algorithms based on minutiae, ridges, and image pattern features. The performance of our proposed algorithm is compared with these individual fingerprint algorithms and commonly used fusion algorithms. In all cases, the proposed Dempster Shafer theory with update rule outperforms existing algorithms even with partial fingerprint image. We also show that as the database size increases, the proposed algorithm is designed to operate on only the augmented data instead of the entire database, thereby reducing the training time without compromising the verification accuracy. (Published Abstract Provided)
Similar Publications
- The Impact of Identity and Population History on Population Affinity Analysis in New Mexico Using Cranial Macromorphoscopic Data
- Evaluation of the Occurrence and Associative Value of NonIdentifiable Fingermarks on Unfired Ammunition in Handguns for Evidence Supporting Proof of Criminal Possession, Use and Intent
- PartialEdit: Identifying Partial Deepfakes in the Era of Neural Speech Editing