Abstract
This paper focuses on fingerprint minutia matching algorithm. A special minutia neighbor structure is proposed during the matching process in this algorithm. It can locate fingerprints using the singular from classification information. In addition, minutia structure can be used to save the time of matching minutia in a simple but effective way. Then, the matching of minutia is based on the changeable sized boundary box. At the same time, possible reference position is computed to make sure the algorithm more robust to nonlinear deformation from fingerprint images. Experimental results on Fingerprint verification competition FVC2004 databases show that this algorithm can speed up the matching of fingerprint database with a preferable performance.
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
