Fingerprint Recognition System(FRS) for the Perak Loan/Scholarship System

Creating a biometric verification system in an energy and area constrained embedded environment is a challenging problem. This paper gives results for using triangulation process to improve performance ofminutiae matching. Triangulation process is the process of aligning the two fingerprints and compares the fingerprint minutiae with minutiae in the database. Human has almost 50 minutiae in their fingerprints. The fingerprint recognition system (FRS) will test the fingerprint and allows the Perak Loan/Scholarship system tobe access when 13 minutiae match with the stored fingerprint data. However, as many data in the database, there are problems ofacquiring the data. The time taken to retrieve data may increase due to this large volume ofdata stored. In a real apphcation, the sensor, the acquisition system and the variation in performance ofthe system over time is very critical. Therefore the system improves the minutiae matching performance by achieving data retrieving in within 3 seconds. Aset of30 fingerprints from 10 individuals were used totest the system. As the result of the proposed approach, the author achieved 2.68 seconds of average fingerprint matching time and 80% ofcorrect fingerprint matching accuracy for FRS

Application of 3D delaunay triangulation in fingerprint authentication system

Biometric security has found many applications in Internet of Things (IoT) security. Many mobile devices including smart phones have supplied fingerprint authentication function. However, the authentication performance in such restricted environment has been downgraded significantly. A number of methods based on Delaunay triangulation have been proposed for minutiae-based fingerprint matching, due to some favorable properties of the Delaunay triangulation under image distortion. However, all existing methods are based on 2D pattern, of which each unit, a Delaunay triangle, can only provide limited discrimination ability and could cause low matching performance. In this paper, we propose a 3D Delaunay triangulation based fingerprint authentication system as an improvement to improve the authentication performance without adding extra sensor data. Each unit in a 3D Delaunay triangulation is a Delaunay tetrahedron, which can provide higher discrimination than a Delaunay triangle. From the experimental results it is observed that the 3D Delaunay triangulation based fingerprint authentication system outperforms the 2D based system in terms of matching performance by using same feature representation, e.g., edge. Furthermore, some issues in applying 3D Delaunay triangulation in fingerprint authentication, have been discussed and solved. To the best of our knowledge, this is the first work in literature that deploys 3D Delaunay triangulation in fingerprint authentication research

Feature Level Fusion of Face and Fingerprint Biometrics

The aim of this paper is to study the fusion at feature extraction level for face and fingerprint biometrics. The proposed approach is based on the fusion of the two traits by extracting independent feature pointsets from the two modalities, and making the two pointsets compatible for concatenation. Moreover, to handle the problem of curse of dimensionality, the feature pointsets are properly reduced in dimension. Different feature reduction techniques are implemented, prior and after the feature pointsets fusion, and the results are duly recorded. The fused feature pointset for the database and the query face and fingerprint images are matched using techniques based on either the point pattern matching, or the Delaunay triangulation. Comparative experiments are conducted on chimeric and real databases, to assess the actual advantage of the fusion performed at the feature extraction level, in comparison to the matching score level.Comment: 6 pages, 7 figures, conferenc

A comparison of 2D and 3D Delaunay triangulations for fingerprint authentication

The two-dimensional (2D) Delaunay triangulation-based structure, i.e., Delaunay triangle, has been widely used in fingerprint authentication. However, we also notice the existence of three-dimensional (3D) Delaunay triangulation, which has not been extensively explored. Inspired by this, in this paper, the features of both 2D and 3D Delaunay triangulation-based structures are investigated and the findings show that a 3D Delaunay structure, e.g., Delaunay tetrahedron, can provide more feature types and a larger number of elements than a 2D Delaunay structure, which was expected to provide a higher discriminative capability. However, higher discrimination does not necessarily lead to better performance, especially in biometric applications, when biometric uncertainty is unavoidable. Experimental results show that the biometric uncertainty such as missing or spurious minutiae causes more negative influence on the 3D Delaunay triangulation than that on the 2D Delaunay triangulation in three out of four experimental data sets

Biometrics based privacy-preserving authentication and mobile template protection

Smart mobile devices are playing a more and more important role in our daily life. Cancelable biometrics is a promising mechanism to provide authentication to mobile devices and protect biometric templates by applying a noninvertible transformation to raw biometric data. However, the negative effect of nonlinear distortion will usually degrade the matching performance significantly, which is a nontrivial factor when designing a cancelable template. Moreover, the attacks via record multiplicity (ARM) present a threat to the existing cancelable biometrics, which is still a challenging open issue. To address these problems, in this paper, we propose a new cancelable fingerprint template which can not only mitigate the negative effect of nonlinear distortion by combining multiple feature sets, but also defeat the ARM attack through a proposed feature decorrelation algorithm. Our work is a new contribution to the design of cancelable biometrics with a concrete method against the ARM attack. Experimental results on public databases and security analysis show the validity of the proposed cancelable template

Indexing techniques for fingerprint and iris databases

This thesis addresses the problem of biometric indexing in the context of fingerprint and iris databases. In large scale authentication system, the goal is to determine the identity of a subject from a large set of identities. Indexing is a technique to reduce the number of candidate identities to be considered by the identification algorithm. The fingerprint indexing technique (for closed set identification) proposed in this thesis is based on a combination of minutiae and ridge features. Experiments conducted on the FVC2002 and FVC2004 databases indicate that the inclusion of ridge features aids in enhancing indexing performance. The thesis also proposes three techniques for iris indexing (for closed set identification). The first technique is based on iriscodes. The second technique utilizes local binary patterns in the iris texture. The third technique analyzes the iris texture based on a pixel-level difference histogram. The ability to perform indexing at the texture level avoids the computational complexity involved in encoding and is, therefore, more attractive for iris indexing. Experiments on the CASIA 3.0 database suggest the potential of these schemes to index large-scale iris databases

Improving patient safety, health data accuracy, and remote self-management of health through the establishment of a biometric-based global UHID

Healthcare systems globally continue to face challenges surrounding patient identification. Consequences of misidentification include incomplete and inaccurate electronic patient health records potentially jeopardizing patients\u27 safety, a significant amount of cases of medical fraud because of inadequate identification mechanisms, and difficulties affiliated with the value of remote health self-management application data being aggregated accurately into the user\u27s Electronic Health Record (EHR). We introduce a new technique of user identification in healthcare capable of establishing a global identifier. Our research has developed algorithms capable of establishing a Unique Health Identifier (UHID) based on the user\u27s fingerprint biometric, with the utilization of facial-recognition as a secondary validation step before health records can be accessed. Biometric captures are completed using standard smartphones and Web cameras in a touchless method. We present a series of experiments to demonstrate the formation of an accurate, consistent, and scalable UHID. We hope our solution will aid in the reduction of complexities associated with user misidentification in healthcare resulting in lowering costs, enhancing population health monitoring, and improving patient-safety

A Review of Fingerprint Feature Representations and Their Applications for Latent Fingerprint Identification: Trends and Evaluation

Latent fingerprint identification is attracting increasing interest because of its important role in law enforcement. Although the use of various fingerprint features might be required for successful latent fingerprint identification, methods based on minutiae are often readily applicable and commonly outperform other methods. However, as many fingerprint feature representations exist, we sought to determine if the selection of feature representation has an impact on the performance of automated fingerprint identification systems. In this paper, we review the most prominent fingerprint feature representations reported in the literature, identify trends in fingerprint feature representation, and observe that representations designed for verification are commonly used in latent fingerprint identification. We aim to evaluate the performance of the most popular fingerprint feature representations over a common latent fingerprint database. Therefore, we introduce and apply a protocol that evaluates minutia descriptors for latent fingerprint identification in terms of the identification rate plotted in the cumulative match characteristic (CMC) curve. From our experiments, we found that all the evaluated minutia descriptors obtained identification rates lower than 10% for Rank-1 and 24% for Rank-100 comparing the minutiae in the database NIST SD27, illustrating the need of new minutia descriptors for latent fingerprint identification.This work was supported in part by the National Council of Science and Technology of Mexico (CONACYT) under Grant PN-720 and Grant 63894