Performance analysis of minutia-based fingerprint matching algorithms

Limam, Mohamed; Ismaili, Yassine; Attioui, Abdelbaki; Sekkaki, Abderrahim

doi:10.1109/sita.2016.7772324

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most popular technique for fingerprint matching is minutiae based matching (Lahby et al, 2016). Each minutia is represented by a 3-tuple M = (x, y, θ) where (x, y) is the location and θ is the orientation of the minutiae.…”

Section: Related Workmentioning

confidence: 99%

Enrolment and Matching of Fingerprints using Minutiae Tree

Praseetha¹,

Vadivel²

2019

Journal of Computer Science

View full text Add to dashboard Cite

Automated fingerprint matching is considered as the most challenging phase of fingerprint recognition since it can be affected by a variety of factors such as noise, skin condition, rotation, distortions and displacements. When there is a large database, the search time to get a matching fingerprint will be relatively high. To reduce the searching time in the database, we have proposed a minutiae tree based indexing method in this paper. The database is represented in the form of a minutiae tree and the fingerprint matching is done by visiting the nodes in the tree where the local configuration of the minutiae is stored. By using this tree structure it is found that the search time or matching time can be considerably reduced and the matching time is independent of the number of fingerprints enrolled in the database. Our framework is scalable and the experiments conducted explores its ability to find correct matches with minimal search time.

show abstract

Section: Related Workmentioning

confidence: 99%