2012
DOI: 10.1007/978-3-642-31837-5_61
|View full text |Cite
|
Sign up to set email alerts
|

Minutiae Based Geometric Hashing for Fingerprint Database

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…However we will use the triplets contained in a minutiae vicinity, which is defined in [15], instead of applying Delaunay triangulation, since fingerprint sample noise and other distortions can seriously affected the whole structure by using Delaunay triangulation [16]. We extract nine features from a triplet which is contained in a minutiae vicinity and use these features to design an indexing scheme, which we call Minutiae-VicinityIndex (MV-Index) method.…”
Section: Introductionmentioning
confidence: 99%
“…However we will use the triplets contained in a minutiae vicinity, which is defined in [15], instead of applying Delaunay triangulation, since fingerprint sample noise and other distortions can seriously affected the whole structure by using Delaunay triangulation [16]. We extract nine features from a triplet which is contained in a minutiae vicinity and use these features to design an indexing scheme, which we call Minutiae-VicinityIndex (MV-Index) method.…”
Section: Introductionmentioning
confidence: 99%