Computer algebra for fingerprint matching

Authors:
Stefano Bistarelli;Giandomenico Boffi;Fabio Rossi
Affiliations:
Università "G. d'Annunzio", Dipartimento di Scienze, Pescara, Italy and CNR, Istituto di Informatica e Telematica, Pisa, Italy;Università "G. d'Annunzio", Dipartimento di Scienze, Pescara, Italy;Università di Trieste, Dipartimento di Scienze Matematiche, Trieste, Italy
Venue:
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Year:
2003

Citing 3
Cited 1

A Real-Time Matching System for Large Fingerprint Databases

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing ideals of points

Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
Filterbank-based fingerprint matching

IEEE Transactions on Image Processing

An asymmetric fingerprint matching algorithm for java cardTM

AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show in this paper how some algebraic methods can be used for fingerprint matching. The described technique is able to compute the score of a match also when the template and test fingerprints have been not correctly acquired. In particular, the match is independent of translations, rotations and scaling transformations of the template. The technique is also able to compute a match score when part of the fingerprint image is incorrect or missed. The algorithm is being implemented in CoCoA, a computer algebra system for doing computations in Commutative Algebra.