• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.195-198
• /
• 2001

We proposes a new fingerprint minutia matching algorithm which matches the fingerprint minutiae by using local alignment. In general, fingerprint is deformed by Pressure and orientation when a user presses his fingerprint to the sensor. These nonlinear deformations change the position and the orientation of minutiae which decrease reliability of minutiae. Matching by using global alignment uses one alignment point. But, the problem with this method is that, due to the deformation, matching reliability of a minutia decreases as the distance from the alignment minutia increases. Matching by using local alignment overcomes this problem by considering minutiae which are located in a short distance boundary. Experimental results show that the performance of the proposed algorithm is superior to that of using global alignment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.248-255
• /
• 2003

This paper presents a fingerprint recognition algorithm using cross-correlation function. This algorithm consists of minutiae extraction, minutiae alignment and minutiae matching, where we propose a new minutiae alignment method. In our alignment method, the rotation angle between two fingerprints is obtained by using cross-correlation function of the minutia directions, thereafter the displacement is obtained from the rotated fingerprint. This alignment method is capable of finding rotation angle and displacement of two fingerprints without resorting to exhaustive search. Our fingerprint recognition algorithm has been tested on fingerprint images captured with inkless scanner. The experiment results show that 17.299% false rejection ratio(FRR) at 2.086% false acceptance ratio(FAR).

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.22-33
• /
• 2019

This paper introduces an efficient fingerprint matching method based on multiple reference minutiae points. First, we attempt to effectively align two fingerprints by employing multiple reference minutiae points. However, the corresponding minutiae points between two fingerprints are ambiguous since a minutia of one fingerprint can be a match to any minutia of the other fingerprint. Therefore, we introduce a novel method based on linear classification concept to establish minutiae correspondences between two fingerprints. Each minutiae correspondence represents a possible alignment. For each possible alignment, a matching score is computed using minutiae and ridge orientation features and the maximum score is then selected to represent the similarity of the two fingerprints. The proposed method is evaluated using fingerprint databases, FVC2002 and FVC2004. In addition, we compare our approach with two existing methods and find that our approach outperforms them in term of matching accuracy, especially in the case of non-linear distorted fingerprints. Furthermore, the experiments show that our method provides additional advantages in low quality fingerprint images such as inaccurate position, missing minutiae, and spurious extracted minutiae.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.71-81
• /
• 2004

Minutiae-based fingerprint identification systems use minutiae points, which cannot completely characterize local ridge structures. Further, this method requires many methods for matching two fingerprint images containing different number of minutiae points. Therefore, to represent the fired length information for one fingerprint image, the filterbank-based method was proposed as an alternative to minutiae-based fingerprint representation. However, it has two shortcomings. One shortcoming is that similar feature vectors are extracted from the different fingerprints which have the same fingerprint type. Another shortcoming is that this method has overload to reduce the rotation error in the fingerprint image acquisition. In this paper, we propose the minutia-weighted feature vector extraction method that gives more weight in extracting feature value, if the region has minutiae points. Also, we Propose new fingerprint alignment method that uses the average local orientations around the reference point. These methods improve the fingerprint system's Performance and speed, respectively. Experimental results indicate that the proposed methods can reduce the FRR of the filterbank-based fingerprint matcher by approximately 0.524% at a FAR of 0.967%, and improve the matching performance by 5% in ERR. The system speed is over 1.28 times faster.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.11-21
• /
• 2008

Biometrics-based user authentication has several advantages over traditional password-based systems for standalone authentication applications. This is also true for new authentication architectures known as crypto-biometric systems, where cryptography and biometrics are merged to achieve high security and user convenience at the same time. Recently, a cryptographic construct, called fuzzy vault, has been proposed for crypto-biometric systems. This construct aims to secure critical data(e.g., secret key) with the fingerprint data in a way that only the authorized user can access the secret by providing the valid fingerprint, and some implementations results for fingerprint have been reported. However, the previous results had some limitation of the provided security due to the limited numbers of chaff data fer hiding real fingerprint data. In this paper, we propose an approach to provide both the automatic alignment of fingerprint data and higher security by using a 3D geometric hash table. Based on the experimental results, we confirm that the proposed approach of using the 3D geometric hash table with the idea of the fuzzy vault can perform the fingerprint verification securely even with more chaff data included.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1783-1798
• /
• 2011

Recently, a cryptographic construct, called fuzzy vault, has been proposed for crypto-biometric systems, and some implementations for fingerprint have been reported to protect the stored fingerprint template by hiding the fingerprint features. In this paper, we implement the fuzzy fingerprint vault, combining fingerprint verification and fuzzy vault scheme to protect fingerprint templates. To implement the fuzzy fingerprint vault as a complete system, we have to consider several practical issues such as automatic fingerprint alignment, verification accuracy, execution time, error correcting code, etc. In addition, to protect the fuzzy fingerprint vault from the correlation attack, we propose an approach to insert chaffs in a structured way such that distinguishing the fingerprint minutiae and the chaff points obtained from two applications is computationally hard. Based on the experimental results, we confirm that the proposed approach provides higher security than inserting chaffs randomly without a significant degradation of the verification accuracy, and our implementation can be used for real applications.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.69-80
• /
• 1999

Recently, social requirements of personal identification techniques are rapidly expanding in a number of new application ares. Especially fingerprint recognition is the most important technology. Fingerprint recognition technologies are well established, proven, cost and legally accepted. Therefore, it has more spot lighted among the any other biometrics technologies. In this paper we propose a new on-line fingerprint recognition algorithm for non-inked type live scanner to fit their increasing of security level under the computing environment. Fingerprint recognition system consists of two distinct structural blocks: feature extraction and feature matching. The main topic in this paper focuses on the feature matching using the fingerprint minutiae (ridge ending and bifurcation). Minutiae matching is composed in the alignment stage and matching stage. Success of optimizing the alignment stage is the key of real-time (on-line) fingerprint recognition. Proposed alignment algorithm using clique shows the strength in the search space optimization and partially incomplete image. We make our own database to get the generality. Using the traditional statistical discriminant analysis, 0.05% false acceptance rate (FAR) at 8.83% false rejection rate (FRR) in 1.55 second average matching speed on a Pentium system have been achieved. This makes it possible to construct high performance fingerprint recognition system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.1
• /
• pp.63-70
• /
• 2009

Recently, in the security token based authentication system, there is an increasing trend of using fingerprint for the token holder verification, instead of passwords. However, the security of the fingerprint data is particularly important as the possible compromise of the data will be permanent. In this paper, we propose an approach for secure fingerprint verification by distributing both the secret and the computation based on the fuzzy vault(a cryptographic construct which has been proposed for crypto-biometric systems). That is, a user fingerprint template which is applied to the fuzzy vault is divided into two parts, and each part is stored into a security token and a server, respectively. At distributing the fingerprint template, we consider both the security level and the verification accuracy. Then, the geometric hashing technique is applied to solve the fingerprint alignment problem, and this computation is also distributed over the combination of the security token and the server in the form of the challenge-response. Finally, the polynomial can be reconstructed from the accumulated real points from both the security token and the server. Based on the experimental results, we confirm that our proposed approach can perform the fuzzy vault-based fingerprint verification more securely on a combination of a security token and a server without significant degradation of the verification accuracy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.93-100
• /
• 2004

This paper presents a method to integrate the multiple impressions of a finger for improving fingerprint verification performance. Small-sized sensor has advantage that it can be used in many application fields. However, sufficiently large impression of fingerprint is not available due to the small sensing area, and this degrades the verification performance of the system. The proposed method overcomes this problem by combining the information of fingerprints for enrollment. To combine the fingerprints, the alignment process is important first of all. In the proposed algorithm multiple impressions of a finger are coarsely aligned using the corresponding minutiae pairs and then are finely aligned using the Distance Map. We construct an integrated template for enrollment in aligned coordinate system Since this integrated template represents the enlarged finger region, the problem that is occurred by using small sensor can be overcome. Experimental results show that the use of the integrated template of multiple impressions improves the performance of the fingerprint verification system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5674-5691
• /
• 2016

Fast IDentity Online(FIDO) supports biometric authentications in an online environment without transmitting biometric templates over the network. For a given FIDO client, the "Fuzzy Vault" securely stores biometric templates, houses additional biometric templates, and unlocks private keys via biometrics. The Fuzzy Vault has been extensively researched and some vulnerabilities have been discovered, such as brute force, correlation, and key inversions attacks. In this paper, we propose a simple fingerprint Fuzzy Vault for FIDO clients. By using the FIDO feature, a simple minutiae alignment, and point-to-point matching, our Fuzzy Vault provides a secure algorithm to combat a variety of attacks, such as brute force, correlation, and key inversions. Using a case study, we verified our Fuzzy Vault by using a publicly available fingerprint database. The results of our experiments show that the Genuine Acceptance Rate and the False Acceptance Rate range from 48.89% to 80% and from 0.02% to 0%, respectively. In addition, our Fuzzy Vault, compared to existing similar technologies, needed fewer attempts.