Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Computer Algebra for Fingerprint Matching
| |
|
Computer Algebra for Fingerprint Matching
Stefano Bistarelli6, 7  , Giandomenico Boffi6 and Fabio Rossi8
| (6) |
Dipartimento di Scienze, Università “G. d’Annunzio”, Viale Pindaro 42, 65127 Pescara, Italy |
| (7) |
Istituto di Informatica e Telematica, CNR, Via G. Moruzzi 1, 56124 Pisa, Italy |
| (8) |
Dipartimento di Scienze Matematiche, Università di Trieste, Via A. Valerio 12/1, 34127 Trieste, Italy |
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.
Keywords Fingerprint matching - point pattern matching - zero-dimensional ideals - Gröbner basis - non-linear polynomial systems - Sturm sequences - affine transformations
The hospitality of the Dipartimento di Scienze dell’Università “G. d’Annunzio”, is gratefully acknowledged by the third author.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|