• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1577-1584
• /
• 2007

Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.173-179
• /
• 2008

This paper proposes an efficient 1:N matching scheme for fingerprint identification. Usually, in the minutiae-based matching scheme, fingerprint matching score could be calculated by analyzing geometrical similarity between minutiae from two fingerprints. To calculate the geometrical similarity between them, it is necessary to fingerprint align a fingerprint data with the other one. The final matching score is obtained by bidirectional matching in the common fingerprint matching scheme, because the similarity between two fingerprints varies with the result of alignments. The reliability of matching score by the bidirectional matching is better than by the unidirectional matching, but it takes two times comparing with unidirectional matching. To solve the problem, this paper proposes an efficient 1:N fingerprint matching scheme based on the distribution of bidirectional matching scores for the large fingerprints database. The experimental result shows the usefulness of the proposed scheme.

• 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 Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.61-69
• /
• 2007

This paper proposes new preprocessing algorithm to extract minutiae in the process of fingerprint recognition. Fingerprint images quality enhancement is a topic phase to ensure good performance in a topic phase to ensure good performance in a Automatic Fingerprint Identification System(AFIS) based on minutiae matching. This paper proposes an algorithm to improve fingerprint image preprocessing to extract minutiae accurately based on directional filter. We improved the suitability of low quality fingerprint images to better suit fingerprint recognition by using valid ridge vector and ridge probability of fingerprint images. With the proposed fingerprint improvement algorithm, noise is removed and presumed ridges are more clearly ascertained. The algorithm is based on five step: computation of effective ridge vector, computation of ridge probability, noise reduction, ridge emphasis, and orientation compensation and frequency estimation. The performance of the proposed approach has been evaluated on two set of images: the first one is self collected using a capacitive semiconductor sensor and second one is DB3 database from Fingerprint Verification Competition (FVC).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.6
• /
• pp.611-620
• /
• 1989

In this paper, Fingerprint matching method which is able to confirm one's identity using microcomputer is discussed. In matching method, fingerprint image is thinned and we extracted feature point data which is composed of position and direction of end-point and branch-point. Identification is conducted by decision of disagreement between reference finger print and input fingerprint us ing this extracted data. After averaging and binariztion process, thining method is conducted. Restoration process is carried out to seek precise feature pointdatd. We compensate position difference of reference fingerprint and input fingerprint, which is divied end-point and branch-point, and translated and rotated its position. Using this compensdate difference of position, we decide whether fingerp-print identity is true or not.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.497-502
• /
• 2003

Fingerprint classification plays a role of reduction of precise joining time and improvement of the accuracy in a large volume of database. Patterns of fingerprint are classified as 5 patterns : left loop, right loop, arch, whorl, and tented arch by numbers and the location of core point and delta point. The existing fingerprint classification is useful in a captured fingerprint image of core point and delta point using paper and ink. However, this system is unapplicable in modern Automatic Fingerprint Identification System (AFIS) because of problems such as size of input and way of input. To solve the problem, this study is to suggest the way of being able to improve accuracy of fingerprint by fingerprint classification based on the entropy of ridges using fingerprint captured mage of core point and prove this through the experiment.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.794-799
• /
• 2008

This paper presents a user identification method at H.264 streaming using watermarking with fingerprints. The watermark can efficiently reduce the potential danger of forgery or alteration. Especially a biometric watermark has convenient, economical advantages. The fingerprint watermark can also improve reliability of verification using automated fingerprint identification systems. These algorithms, however, are not robust against common video compression. To overcome this problem, we analyze H.264 compression pattern and extract watermark after restoring damaged watermark using various filters. The proposed algorithm consists of enhancement of a fingerprint image, watermark insertion using discrete wavelet transform and extraction after restoring. The proposed algorithm can achieve robust watermark extraction against H.264 compressed videos.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.317-323
• /
• 2014

The registration cards that are currently used to identify the people of Korea may cause secondary damage once stolen because they contain very specifically expressed fingerprint information. In order to solve this problem, in ID is required that can utilize the state-owned fingerprint DB, while while maintaining confidentiality of the identification information and satisfying the cost as well. At this point accordingly, a secure form of ID, which uses the encrypted QR code and fingerprint information, is proposed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.9
• /
• pp.801-805
• /
• 2012

This paper proposes dynamic thresholding scheme for fingerprint identification. As a user authentication method by fingerprint recognition technology, verification method based on 1:1 matching was mainly used in the past, but identification method based on 1:N matching is generally used recently. The control of the value of FAR is very important in the application areas such as access control and time attendance systems. This paper proposes dynamic thresholding scheme which could properly control the value of FAR according to the field of applications and size of the fingerprints database.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.199-208
• /
• 2014

In this paper, we represent a system of identification and feature search for scanned comics in consideration of their content characteristics. For creating the feature of the scanned comics, we utilize a method of hierarchical symmetry fingerprinting. Proposed identification and search system is designed to give online service provider, such as Webhard, an immediate identification result under conditions of huge volume of the scanned comics. In simulation part, we analyze the robustness of the identification of the fingerprint to image modification such as rotation and translation. Also, we represent a structure of database for fast matching in feature point database, and compare search performance between other existing searching methods such as full-search and most significant feature search.