In this paper, we present a new fingerprint matching algorithm based on a local skeleton descriptor. This descriptor uses ridge count information to encode minutiae locations in a small neighborhood. Taking advantage of ridge count properties, our descriptor is robust to distortions. We developed an efficient algorithm to match our descriptor and a strategy to combine matchings of many local descriptors. Our algorithm obtains interesting results on both tenprint-to-tenprint and latent-to-tenprint matchings.
(Publisher abstract provided.)
Downloads
Similar Publications
- Enhanced DNA Profiling of the Semen Donor in Late Reported Sexual Assaults: Use of Y-Chromosome-Targeted Pre-amplification and Next Generation Y-STR Amplification Systems
- Deconvolution of Dust Mixtures by Latent Dirichlet Allocation in Forensic Science
- Statistical approach to establish equivalence of unabbreviated mass spectra