Abstract
The propose algorithm finds the optimal reduced size of latent fingerprint. The algorithm accelerates the correlation methods of fingerprint registration. The Algorithm is based on decomposition and reduction of fingerprint to one dimension form by using the adoptive method of empirical modes. We choose the most appropriate internal mode to determine the minimum distance between the extremes of empirical modes. We can estimate how many times the fingerprint in the first step of the comparison can be reduced so as not to lose the accuracy of registration. This algorithm shows best results as compared to conventional fingerprint matching techniques that strongly depends on local features for registration. The algorithm was tested on latent fingerprints using FVC2002, FVC2004 and FVC2006 databases.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
