• 대한전자공학회논문지SP
• /
• 제40권6호
• /
• pp.10-19
• /
• 2003

현재 상용화된 지문인식 시스템은 지문 입력기를 구동하는데 필요한 함수가 표준화 되어있지 않기 때문에 입력기 사이의 호환이 불가능하다. 본 연구의 목적은 지문인식 시스템이 대중화됨에 따라 앞으로 지문인식 시장에서 수요가 예상되는 다양한 지문 입력기 사이의 지문인식이 가능한 시스템의 개발이다. 본 논문에서는 광학식, 반도체식, 열감지 방식의 지문 입력기를 대상으로 하여 지문인식 시스템을 설계 구현하였으며, 융선 개수 정보의 추출 방법과 융선 개수 정보를 이용한 정합 방법을 제안하였다.

• Journal of Information Processing Systems
• /
• 제15권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.

• 전자공학회논문지CI
• /
• 제45권5호
• /
• pp.173-179
• /
• 2008

본 논문에서는 지문 인식에 있어서 매칭 시간을 줄일 수 있는 효율적인 매칭 방법을 제안한다. 통상 지문의 특징점을 이용하여 지문 매칭을 수행하는 경우, 특징점간의 기하학적 유사성을 분석하여 두 지문의 매칭 점수를 계산한다. 이러한 기하학적 유사도를 계산하기 위해서는, 하나의 지문 데이터를 기준으로 다른 하나의 지문 데이터를 미리 정렬하는 과정이 필요하며, 정렬 결과에 따라 두 지문의 유사도가 달라지므로 통상의 지문 매칭에 있어서는 양방향 매칭을 통하여 최종 매칭 점수를 구한다. 양방향 매칭의 경우 단방향 매칭에 비하여 매칭 신뢰도는 높아지나 매칭에 걸리는 시간이 단방향 매칭에 비해 두 배로 걸린다. 이 문제를 해결하기 위하여, 본 논문에서는 대규모 지문 데이터 베이스에 대한 양방향 매칭 점수의 분포를 구하고, 이를 기초로 효율적인 1:N 지문 매칭방법을 제안하였다. 실험 결과는 이러한 방법이 유용함을 보여준다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제7권2호
• /
• pp.109-114
• /
• 2007

Fingerprints have been widely used in the biometric authentication because of its performance, uniqueness and universality. Lately, the speed of identification has become a very important aspect in the fingerprint-based security applications. Also, the reliability still remains the main issue in the fingerprint identification. A fast and reliable fingerprint matching algorithm based on the process of the 'self-nonself' discrimination in the biological immune system was proposed. The proposed algorithm is organized by two-matching stages. The 1st matching stage utilized the self-space and MHC detector string set that are generated from the information of the minutiae and the values of the directional field. The 2nd matching stage was made based on the local-structure of the minutiae. The proposed matching algorithm reduces matching time while maintaining the reliability of the matching algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권1호
• /
• pp.343-364
• /
• 2021

In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

• 한국멀티미디어학회논문지
• /
• 제10권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 Information Processing Systems
• /
• 제12권1호
• /
• pp.83-99
• /
• 2016

The latest research on the image-based fingerprint matching approaches indicates that they are less complex than the minutiae-based approaches when it comes to dealing with low quality images. Most of the approaches in the literature are not robust to fingerprint rotation and translation. In this paper, we develop a robust fingerprint matching system by extracting the circular region of interest (ROI) of a radius of 50 pixels centered at the core point. Maximizing their orientation correlation aligns two fingerprints that are to be matched. The modified Euclidean distance computed between the extracted orientation features of the sample and query images is used for matching. Extensive experiments were conducted over four benchmark fingerprint datasets of FVC2002 and two other proprietary databases of RFVC 2002 and the AITDB. The experimental results show the superiority of our proposed method over the well-known image-based approaches in the literature.

• 스마트미디어저널
• /
• 제3권3호
• /
• pp.15-19
• /
• 2014

지문 인식 시스템은 지문인식 장치(fingerprint acquisition device)를 통하여 아날로그(analog) 지문으로부터 변환된 디지털(digital) 지문에서 특이점을 추출하고 추출한 특이점들에 대한 정보를 데이터베이스에 등록하는 오프라인(off-line) 처리와 사용자가 시스템에 접근 할 때 입력한 지문으로부터 특이점을 추출한 후 데이터베이스에 저장되어 있는 특이점들과 정합(matching) 하여 사용자의 시스템 접근 여부를 결정하는 온라인(on-line) 처리로 이루어져 있다. 본 논문에서는 다양한 생체인식시스템 중, 통계 지문 인식 정합 방법인 지문의 특이점 을 사용한다. 좌표를 기준으로서 유사성 거리 측정을 하고, 그리고 특정한 각도, 통계 배포 판에 따라서 지문 인식 모델을 찾는 것이다.

• 한국멀티미디어학회논문지
• /
• 제23권1호
• /
• pp.8-14
• /
• 2020

For a reliable fingerprinting system, improving fingerprint matching accuracy is crucial. In this paper, we try to improve a binary image fingerprint matching performance by utilizing auxiliary information, power mask, which is obtained while constructing fingerprint DB. The power mask is an expected robustness of each fingerprint bit. A caveat of the power mask is the increased storage cost of the fingerprint DB. This paper mitigates the problem by reducing the size of the power mask utilizing spatial correlation of an image. Experiments on a publicly-available image dataset confirmed that the power mask is effective in improving fingerprint matching accuracy.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.301-304
• /
• 2003

This raper propose a matching algorithm using voronoi diagram for rotation and translation invariant fingerprint identification. The proposed algorithm extracts geometrical structures that ate derived from voronoi diagram of a fingerprint image. Then distances and angles are extracted from the geometrical structure and saved indexing form for fingerprint matching. Experimental results show that the proposed algorithm invariant to fingerprint rotation and translation requirements and matching time.