In this paper we present a novel biometric approach to match fingerprints that run in linear time. We match the minutiae in the fingerprint by constructing a ...
A novel biometric approach to match fingerprints that run in linear time is presented by constructing a nearest neighbor vector (NNV) considering its ...
In this paper we present a novel biometric approach to match fingerprints that run in linear time. We match the minutiae in the fingerprint by constructing a ...
Fingerprint matching algorithm is a key step in fingerprint recognition system. Though there are many existing matching algorithms, there has been inability ...
In this paper we present a novel biometric approach to match fingerprints that run in linear time. We match the minutiae in the fingerprint by constructing a ...
Mayur D. Jain, S. Nalin Pradeep, C. Prakash, Raman Balasubramanian: Binary Tree Based Linear Time Fingerprint Matching. ICIP 2006: 309-312.
Fingerprint matching algorithm is a key step in fingerprint recognition system. Though there are many existing matching algorithms, there has been inability ...
Abstract— Minutiae are singular representation of fingerprint. An efficient way of storing minutiae induces a better fingerprint recognition system.
The algorithm is essentially an application of Knuth-Morris-Pratt's string matching algorithm. An extension to more general tree structures is also described.
People also ask
Which algorithm is used for fingerprint matching?
How to match fingerprint images?
The Fingerprint Identification Algorithm is developed by splitting the fingerprint array at the midpoint and parallelizing the search in each split to form four ...