Name
Abstract | ||
|---|---|---|
The fingerprint verification has come to attract increased attention as a possible solution to e-security applications. This work describes a fast fingerprint matching algorithm based on a multiple reference minutiae. The fingerprint codes for the matching algorithm are extracted from neighbourhoods' minutiae which replace the classical core point. The main advantage of our approach is that it avoids the implicit alignment fingerprint images during the matching process and improves the fingerprint verification accuracy through the minutiae binary codes and orientation features combination. Testing our approach on the public fingerprint databases DB1-a andDB2-a FVC2002. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/AICCSA.2008.4493583 | AICCSA |
Keywords | Field | DocType |
binary codes,fingerprint authentication,fingerprint verification,feature extraction,message authentication,fingerprint identification | Computer vision,Message authentication code,Pattern recognition,Fingerprint recognition,Minutiae,Computer science,Fingerprint Verification Competition,Binary code,Feature extraction,Fingerprint,Artificial intelligence,Blossom algorithm | Conference |
ISSN | ISBN | Citations |
2161-5322 | 978-1-4244-1968-5 | 1 |
PageRank | References | Authors |
0.48 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farid Benhammadi | 1 | 101 | 10.36 |
| Kadda Beghdad Bey | 2 | 53 | 3.37 |
| H. Hentous | 3 | 40 | 3.46 |