IIT Home Page CNR Home Page

An Asymmetric Fingerprint Matching Algorithm for Java Card

A novel fingerprint matching algorithm is proposed in this paper. The algorithm is based on the minutiae local structures, that are invariant with respect to global transformations like translation and rotation. Match algorithm has been implemented inside a smartcard over the Java Card— platform, meeting the individual’s need for information privacy and the overall authentication procedure security, since the card owner biometric template never leaves the private support device and the match is computed inside a secure environment. The main characteristic of the algorithm is to have an asymmetric behaviour between correct positive matches (between two same fingerprint samples) and correct negative matches (between two different fingerprint images): in the first case, the match procedure stops as it finds that images belong to the same fingerprint, gaining high speed efficiency, while in the second case the verification process lasts longer, exploring all the minutiae pairings. The performances in terms of authentication reliability and speed have been tested on the databases from the Fingerprint Verification Competition 2002 edition (FVC2002) by taking in account the different hardware to run the algorithms. Moreover, our procedure has showed better reliability results when compared on a common database with a related algorithm developed specifically for Java Card


2004

Autori: Bistarelli, Stefano; Santini, Francesco; Vaccarelli, Anna
Autori IIT:

Stefano Bistarelli

Foto di Stefano Bistarelli

Tipo: Rapporti tecnici, manuali, carte geologiche e tematiche e prodotti multimediali
Area di disciplina: Information Technology and Communication Systems
Technical report TR-13/2004