Name
Abstract | ||
|---|---|---|
This paper proposes a hash-based indexing method to speed up fingerprint identification in large databases. For each minutia, its local neighborhood information is computed with features defined based on the geometric arrangements of its neighboring minutiae points. The features used are provably invariant to translation, rotation, scale and shear. These features are used to create an affine invariant local descriptor, called an arrangement vector, for each minutia. To account for missing and spurious minutiae, we consider subsets of the neighboring minutiae and hashes of these structures are used in the indexing process. The primary goal of the work is to explore the effectiveness of affine invariant features for representing local minutiae structures. Experiments on FVC 2002 databases show that representation is quite effective even though the technique performs slightly below the state-of-the-art methods. One could use the representation in combination with other techniques to improve the overall performance. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CVPRW.2012.6239218 | CVPR Workshops |
Keywords | Field | DocType |
indexing,fingerprint recognition,fingerprint identification,nonlinear distortion,biometrics,vectors | Computer vision,Pattern recognition,Fingerprint recognition,Computer science,Minutiae,Search engine indexing,Fingerprint,Artificial intelligence,Invariant (mathematics),Hash function,Spurious relationship,Speedup | Conference |
Volume | Issue | ISSN |
2012 | 1 | 2160-7508 |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akhil Vij | 1 | 1 | 0.36 |
| Anoop M. Namboodiri | 2 | 255 | 26.36 |