Name
Abstract | ||
|---|---|---|
The main aim of this paper is to describe an inter-minutiae binary network-based global matching algorithm. It exploits absolute minutiae features represented by a binary constraint graph. A dynamic tolerance area in the neighborhood of the minutiae combined with the search-rearrangement method on the binary constraint graph is used to perform the global matching. Tests on the public fingerprint databases DB1 and DB2 FVC2002 showed that our approach outperforms those based on the forward tracking search only. The most relevant aspect of this algorithm is that it does not require implicit alignment of the two fingerprint images due to the strong dependencies between minutiae described by the constraint graph. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1155/2008/479106 | EURASIP J. Adv. Sig. Proc. |
Keywords | Field | DocType |
db2 fvc2002,interminutiae binary constraint graph,dynamic tolerance area,absolute minutia,fingerprint image,constraint graph,inter-minutiae binary,fingerprint recognizer,public fingerprint databases,global matching algorithm,global matching,binary constraint graph | Graph,Computer vision,Search algorithm,Computer science,Minutiae,Constraint graph,Algorithm,Fingerprint,Artificial intelligence,Biometrics,Binary constraint,Binary number | Journal |
Volume | ISSN | Citations |
2008, | 1687-6180 | 0 |
PageRank | References | Authors |
0.34 | 24 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farid Benhammadi | 1 | 101 | 10.36 |
| H. Hentous | 2 | 40 | 3.46 |
| Kadda Beghdad Bey | 3 | 53 | 3.37 |