Reducing computational complexity in fingerprint matching

Authors

MUBEEN SABIR
TARIQ MAHMOOD KHAN
MUNAZZA ARSHAD
SANA MUNAWAR

DOI

10.3906/elk-1907-113

Abstract

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.

Keywords

Biometrics, cross-correlation, minutiae points, filtering, matching

First Page

2538

Last Page

2551

Recommended Citation

SABIR, MUBEEN; KHAN, TARIQ MAHMOOD; ARSHAD, MUNAZZA; and MUNAWAR, SANA (2020) "Reducing computational complexity in fingerprint matching," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 28: No. 5, Article 12. https://doi.org/10.3906/elk-1907-113
Available at: https://journals.tubitak.gov.tr/elektrik/vol28/iss5/12