Fingerprint representation and matching for secure smartcard authentication Online publication date: Sat, 05-Aug-2017
by Ibrahim M. El-leithy; Gouda I. Salama; Tarek A. Mahmoud
International Journal of Biometrics (IJBM), Vol. 9, No. 2, 2017
Abstract: In this paper, a lightweight fingerprint-matching algorithm (4 kB) is proposed. This algorithm is based on matching features that are invariant to major transformations like translation and rotation. The algorithm can be executed on devices with low computing power and limited memory size. Thus, the matching algorithm is implemented on smartcard over the Java CardTM platform. The algorithm has an asymmetric terminating behaviour. Therefore, the execution time varies depending on correct positive matches (similar fingerprint) and correct negative matches (dissimilar fingerprint). In this paper, two fingerprint authentication methods are implemented. The first fingerprint authentication method is applied using one reference and one candidate fingerprints. However, the second method is performed by the aid of a fusion-based fingerprint authentication manner using two reference and one candidate fingerprints. The performance of the methods in terms of authentication accuracy is tested on some standard databases from the Fingerprint Verification Competition 2002 (FVC2002).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Biometrics (IJBM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook