Reducing computational complexity in fingerprint matching
Sabir, Mubeen, Khan, Tariq M, Arshad, Munazza and Munawar, Sana 2020, Reducing computational complexity in fingerprint matching, Turkish journal of electrical engineering and computer sciences, vol. 28, no. 5, pp. 2538-2551, doi: 10.3906/elk-1907-113.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Reducing computational complexity in fingerprint matching
The performance of cross-correlation functions can decrease computational complexity under optimal fingerprint feature selection. In this paper, a technique is proposed to perform alignment of fingerprints followed by their matching in fewer computations. Minutiae points are extracted and alignment is performed on the basis of their spatial locations and orientation fields. Unlike traditional cross-correlation based matching algorithms, ridges are not included in the matching process to avoid redundant computations. However, optimal cross-correlation is chosen by correlating feature vectors accompanying x-y locations of minutiae points and their aligned orientation fields. As a result, matching time is significantly reduced with much improved accuracy.
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.