• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.283-286
• /
• 2002

Most of the Automatic Fingerprint Identification Systems define the ridge endings and bifurcation points as the minutia for matching. Therefore, the precise extraction of the minutia is critical in raising the efficiency and reliability of the system. The fingerprint images produced through the preprocessing may have the false minutia happened over the process and they can be the factors to decrease the system efficiency This paper suggests the algorithm, which removes the false minutia after extracting the candidate minutia from the thinned binary images of fingerprint images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.359-367
• /
• 2004

The postprocessing to remove false minutia is important because the extraction of true minutia affects the performance as a key factor in fingerprint identification system. In this paper, we propose an efficient postprocessing algorithm for removing false minutia among the extracted candidates in a thinned image. The proposed algorithm removes false minutia in three steps by using various information in the acquired fingerprint image: the structural information of minutia (end point and bifurcation), the inherent characteristics of fingerprint, and the quality of acquired images. Under Intel Celeron processor environment with 248${\times}$292 images acquired by optic device, the experiments showed that the proposed algorithm efficiently removed false minutia while preserving true minutia. Moreover, the proposed algorithm takes 0.0154 second, which is very small compared to the time for preprocessing (0.343 second).

• 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.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.263-266
• /
• 2000

We proposes a new fingerprint minutia matching algorithm which matches the fingerprint minutiae by using adaptive distance. In general, fingerprint is deformed by pressure and orientation when a user press his fingerprint to sensor. These nonlinear deformations change the distance between minutiae and reduce verification rate. We define the adaptive distance using ridge frequency. Adaptive distance normalizes the distance between minutiae and compensates for nonlinear deformation. Our algorithm can distinguish two different fingerprints better and is more robust. Experimental results show that the performance of the proposed algorithm is superior to using Euclidean distance.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.215-222
• /
• 2005

In this paper, we propose a fingerprint verification algorithm for the embedded system based on the minutia extracted using the image quality, the minutia structure, and the Sequency and the orientation of ridges. After the pre- and the post-processing, the true minutia are selected, thus it shows high reliability in the fingerprint verification. In matching process, we consider the errors caused by shift, rotation, and pressure when acquiring the fingerprint image and reduce the matching time by applying a local matching instead of a full matching to select the reference pair. The proposed algorithm has been designed and verified in Arm920T environment and various techniques for the realtime process have been applied. Time taken from the fingerprint registration through out the matching is 0.541 second that is relevant for the realtime applications. The FRR (False Reject Rate) and FAR (False Accept Rate) show 0.079 and 0.00005 respectively.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.2
• /
• pp.67-73
• /
• 2005

Recently, the social requirement of personal identification techniques has been increasing. Fingerprint recognition is one of the biometries methods that has been widely used for this requirement. This paper proposes the fingerprint matching algorithm that uses the information of the ridge shapes of minutiae. In which, the data of the ridge shape are expressed in one-dimensional discrete-time signals. In our algorithm, we obtain one-dimensional discrete-time signals for ridge at every minutiae from input and registered fingerprints, and find pairs of minutia which have the similar ridge shape by comparing input fingerprint with registered fingerprint, thereafter we find candidates of rotation angle and moving displacement from the pairs of similar minutia, and obtain the final rotation angle and moving displacement value from those candidates set by using clustering method. After that, we align an input fingerprint by using obtained data, and calculate the matching rate by counting the number of corresponded pairs of minutia within the overlapped area of an input and registered fingerprints. As a result of experiment, false rejection rate(FRR) of $18.0\%$ at false acceptance rate(FAR) of $0.79\%$ is achieved.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.9-12
• /
• 2001

Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for finger print images of poor quality. We present a finger print recognition scheme, where transformation parameter of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information. Proposed method may exhibit extremely low FAR(False Accept Ratio) while maintaining low reject ratio even for the images of poor quality because of the robustness to the variation of minutia points.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.37-40
• /
• 2012

본 논문에서는 지문 인식 시스템의 인식을 위한 등록점으로 융선의 단점과 분기점에 관하여 연구하였다. 원 지문 영상은 전처리 과정을 거치게 되면서 잘못된 특징점을 포함하게 되며 이는 지문 인식 시스템의 효율성을 감소시키는 원인이 될 수 있다. 이 논문에서는 세선화된 지문 영상으로부터 후보 특징점을 추출한 후 연결성 탐색 정보를 이용하여 의사 특징점을 제거할 수 있는 알고리즘을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1204-1209
• /
• 2001

According to the rapid development of information and communication, various services are offered using information and communication infrastructure for example e-commerce, internet banking, stock dealings, etc. This time, the most important problem is personal identification. But now secret number that is used to personal identification mostly can be misappropriated. To solve this problem, this paper proposes smart card identification system using 1 vs. 1 fingerprint matching. Information protection and security of smart card excel and use is convenient. And fingerprint becomes the focus of public attention in biometric field. Implemented system in this paper is based on PC. This system stores minutia that is fingerprint information into smart card and compare it with personal minutia. Therefore this system is sure to be on personal identification. If this system is applied to various services, safety degree of services will be enhanced.