• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.10-19
• /
• 2003

As the technical demand for biometrics is increasing, users expect that fingerprint recognition systems are operable with various fingerprint readers. However, current commercial off-the-shelf fingerprint recognition systems are no interoperable due to the lack of standardization in application program interfaces for fingerprint readers. A cross-matching fingerprint recognition system is a person authentication system based on fingerprints and utilizing different types of fingerprint readers. It should be able to overcome variations in fingerprint images acquired by different readers, such as the size, resolution, contrast of images. The purpose of this research is to develop across-matching fingerprint recognition system for fingerprint research of different sensing mechanism. The fingerprint readers tested in this study are optical, semiconductor and thermal sensor modules, and the prpoposed cross-matching system utilizes both a minutiae-based similarity and a ridge count-based similarity in matching fingerprint images acquired by different sensors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.866-872
• /
• 2004

In fingerprint verification and identification, fingerprint and background region should be segmented. For this purpose, most systems obtain variance of brightness of X and Y direction using Sobel mask. To decide given local region is background or not, the variance is compared with a certain threshold. Although this method is simple, most fingerprint image does not separated with two region of fingerprint and background region. In this paper, we presented a new segmentation algorithm based on run-length connectivity analysis. For a given binary image after thresholding, suggested algorithm calculates RL of X and Y direction. Until the given image is segmented to two regions, small run region is successively inverted. Experimental result show that this algorithm effectively separates fingerprint region and background region.

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

To extract the creditable features in fingerprint image, many people use the thinning algorithm that has a very important position in the preprocessing. In this paper, we propose the robust parallel thinning algorithm that can preserve the connectivity of the binarized fingerprint image, make the thinnest skeleton with 1-pixel width and get near to the medial axis extremely. The proposed thinning method repeats three sub-iterations. The first sub-iteration takes off only the outer boundary pixel by using the interior points. To extract the one side skeletons, the second sub-iteration finds the skeletons with 2-pixel width. The third sub-iteration prunes the needless pixels with 2-pixel width existing in the obtained skeletons and then the proposed thinning algorithm has the robustness against the rotation and noise and can make the balanced medial axis. To evaluate the performance of the proposed thinning algorithm we compare with and analyze the previous algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.860-867
• /
• 2003

In this paper, an efficient core point detection method using orientation pattern labeling is proposed in fingerprint image. The core point, which is one of the singular points in fingerprint image, is used as the reference point in the most fingerprint recognizing system. Therefore, the detection of the core point is the most essential step of the fingerprint recognizing system, it can affect in the whole system performance. The proposed method could detect the position of the core point by applying the labeling method for the directional pattern which is come from the distribution of the ridges in fingerprint image and applying detailed algorithms for the decision of the core point's position. The simulation result of proposed method is better than the result of Poincare index method and the sine map method in executing time and detecting rate. Especially, the Poincare index method can't detect the core point in the detection of the arch type and the sine map method takes too much times for executing. But the proposed method can overcome these problems.

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

This paper presents a new postprocessing method to eliminate the false minutiae, that caused by the skelectonization of fingerprint image, and an image compression method using Isometric Self Organizing Map(ISOSOM). Since the SOM has simple structure, fast encoding time, and relatively good classification characteristics, many image processing areas adopt this such as image compression and pattern classification, etc. But, the SOM shows limited performances in pattern classification because of it's single layer structure. To maximize the performance of the pattern classification with small code book, we a lied the Isometric SOM with the isometry of the fractal theory. The proposed Isometric SOM postprocessing and compression algorithm of fingerprint image showed good performances in the elimination of false minutiae and the image compression simultaneously.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.63-71
• /
• 2006

In this paper, we propose a secure solution for user authentication by using fingerprint verification on the sensor-client-server model, even with the client that is not necessarily trusted by the sensor holder or the server. To protect possible attacks launched at the untrusted client, our solution makes the fingerprint sensor validate the result computed by the client for the feature extraction. However, the validation should be simple so that the resource-constrained fingerprint sensor can validate it in real-time. To solve this problem, we separate the feature extraction into binarization and minutiae extraction, and assign the time-consuming binarization to the client. After receiving the result of binarization from the client, the sensor conducts a simple validation to check the result, performs the minutiae extraction with the received binary image from the client, and then sends the extracted minutiae to the server. Based on the experimental results, the proposed solution for fingerprint verification can be performed on the sensor-client-server model securely and in real-time with the aid of an untrusted client.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.757-759
• /
• 2005

Henry의 지문분류법이 창안된 후, 지문분류에 대한 여러 가지 접근 방법이 연구되고 있다. 특이점에 의한 분류는 가장 많이 연구되고 있는 방법이지만, 지문영상의 품질에 민감하기 때문에 정확한 분류가 쉽지 않다. 의사 융선은 특이점과 더불어 지문을 분류하기 위한 특징으로, 특이점의 불완전함을 보완하는데 이용한다. 본 논문에서는 나이브 베이즈 분류기를 이용하여 특이점과 의사 융선 정보의 확률적인 분류 방법을 제안한다. NIST DB 4에 대해 제안하는 방법을 실험한 결과 5클래스 분류에 대해 $85.4\%$의 분류율을 획득하였으며, 제안하는 방법이 신경망, 최근접 이웃에 의한 분류에 비해 더 빠르다는 것을 확인하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.370-373
• /
• 2002

본 논문에서는 단일영상들에 포함된 특징들을 효과적으로 추출하기 위하여 신경망 기반 독립성분분석기법의 이용을 제안하였다. 여기서 독립성분의 효과적인 분석을 위해 고정점 학습알고리즘의 신경망 기반 기법을 이용하였다. 이는 수치적 기법에 비해 신경망이 가지는 ？ㄱ습 등의 우수한 속성과 뉴우턴법의 고정점 알고리즘이 가지는 빠르고 간단한 계산속성을 동시에 살리기 위함이다. 제안된 기법을 512x412 픽셀의 L둠 영상과 480x225 픽셀의 지폐영상 각각에서 선택된 1,000개의 영상패치들을 대상으로 시뮬레이션 한 결과, 추출된 16x16 펙셀의 160개 독립성분 기저벡터는 지문영상과 지폐영상 각각에 포함된 공간적인 주파수 특성과 방향성을 가지는 경계 특성이 잘 드러나는 국부적인 특징들임을 확인할 수 있었다.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.215-224
• /
• 1994

In this paper, the rotation and size invariant fingerprint recognition using the neural network EART (Extended Adaptive Resonance Theory) is studied ($515{\times}512$) gray level fingerprint images are converted into the binary thinned images based on the adaptive threshold and a thinning algorithm. From these binary thinned images, we extract the ending points and the bifurcation points, which are the most useful critical feature points in the fingerprint images, using the $3{\times}3$ MASK. And we convert the number of these critical points and the interior angles of convex polygon composed of the bifurcation points into the 40*10 critical using the weighted code which is invariant of rotation and size as the input of EART. This system produces very good and efficient results for the rotation and size variations without the restoration of the binary thinned fingerprints.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.123-130
• /
• 2005

In this paper, fingerprint identification algorithm using pixel direction factor in blocks is proposed to minimize false acceptance ratio and to apply security system. The proposed algorithm is that a fingerprint image is divided by 16 blocks, then feature parameters which have direct factors of $0^{\circ},\;45^{\circ},\;90^{\circ}\;and\;135^{\circ}$ is extracted for each block. Membership function of a reference fingerprint and an input fingerprint for the extracted parameters is calculated, then identification of two fingerprint is distinguished using fuzzy inference. False acceptance ratio is evaluated about different fingerprints of In kinds regardless of sex and shape which are obtained from adults, and false rejection ratio is evaluated about fingerprints which are obtained by adding fingerprints of 10 kinds on different fingerprints of 100 kinds. The experiment results is that false acceptance ratio is average $0.34\%$ about experiment of 4,950 times, and false rejection ratio is average $3.7\%$ about experiment of 1,000 times. The proposed algerian is excellent for recognition rate and security.