• Title/Summary/Keyword: Minutiae classification

Search Result 10, Processing Time 0.021 seconds

Delaunay Triangulation based Fingerprint Matching Algorithm using Quality Estimation and Minutiae Classification (화질 추정과 특징점 분류를 이용한 Delaunay 삼각화 기반의 지문 정합 알고리즘)

  • Sung, Young-Jin;Kim, Gyeong-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.4
    • /
    • pp.547-559
    • /
    • 2010
  • Delaunay triangulation is suitable for fingerprint matching because of its robustness to rotation and translation. However, missing and spurious minutiae degrade the performance and computational efficiency. In this paper, we propose a method of combining local quality assessment and 4-category minutiae classification to improve accuracy and decrease computational complexity in matching process. Experimental results suggest that removing low quality areas from matching candidate areas and classifying minutiae improve computational efficiency without degrading performance. The results proved that the proposed algorithm outperforms the matching algorithm (BOZORTH3) provided by NIST.

An Efficient Fingerprint Matching by Multiple Reference Points

  • Khongkraphan, Kittiya
    • 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.

Fingerprint Recognition using Gabor Filter (Gabor 필터를 이용한 지문 인식)

  • Shim, Hyun-Bo;Park, Young-Bae
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.653-662
    • /
    • 2002
  • Fingerprint recognition is a task to find a matching pattern in a database for a specific persons fingerprint. To accomplish this task, preprocessing, classification, and matching steps are taken for a large-scale fingerprint database but only the matching step is taken without classification for a small-scale database. The primary matching method is based on minutiae (ridge ending point, bifurcation). This matching method, however, requires a very complex computation to extract minutiae and match minutiae-to-minutiae accurately due to translation, rotation, nonlinear deformation of fingerprint and occurrence of spurious minutiae. In addition, this method requires a laborious preprocessing step in order to improve the quality of fingerprint Images. This paper proposes a new simple method to eliminate these problems. With this method, Gabor variance is used instead of minutiae for fingerprint recognition. The Gabor variance is computed from Gabor features that result from filtering a fingerprint image through Gabor filter. In this paper, this method is described and its test result is shown, demonstrating the potential of using this new method for fingerprint recognition.

A Fingerprint Identification System using Large Database (대용량 DB를 사용한 지문인식 시스템)

  • Cha, Jeong-Hee;Seo, Jeong-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.203-211
    • /
    • 2005
  • In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

  • PDF

A Study on the Extraction of the Minutiae and Singular Point for Fingerprint Matching

  • Na Ho-Jun;Kim Chang-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.6
    • /
    • pp.761-767
    • /
    • 2005
  • The personal identification procedure through the fingerprints is divided as the classification process by the type of the fingerprints and the matching process to confirm oneself. Many existing researches for the classification and the matching of the fingerprint depend on the number of the minutiae of the fingerprints and the flow patterns by their direction information. In this paper, we focus on extracting the singular points by using the flow patterns of the direction information from identification. The extracted singular points are utilized as a standard point for the matching process by connecting with the extracted information from the singular point embodied. The orthogonal coordinates which is generated by the axises of the standard point can increase the accuracy of the fingerprints matching because of minimizing the effects on the location changes of the fingerprint images.

  • PDF

Cost Effective Mobility Anchor Point Selection Scheme for F-HMIPv6 Networks (F-HMIPv6 환경에서의 비용 효율적인 MAP 선택 기법)

  • Roh Myoung-Hwa;Jeong Choong-Kyo
    • KSCI Review
    • /
    • v.14 no.1
    • /
    • pp.265-271
    • /
    • 2006
  • In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

  • PDF

Classification of Fingerprint Ridge Lines Using Runlength Codes (런길이 부호화를 이용한 지문융선 분류)

  • 이정환;노석호;김윤호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.468-471
    • /
    • 2004
  • In this paper, a method for classifying fingerprint ridge lines using runlength codes is proposed. To detect feature points(minutiae) in automatic fingerprint identification system(AFIS), classification of fingerprint ridge lines are essential process. The fingerprint ridge lines are classified by run-length coding, and also the end and bifurcation regions in ridge lines are separated. To evaluate the performance of the proposed method, detected feature regions including minutiae points and classified fingerprint ridge lines are shown.

  • PDF

Plain Fingerprint Classification Based on a Core Stochastic Algorithm

  • Baek, Young-Hyun;Kim, Byunggeun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.1
    • /
    • pp.43-48
    • /
    • 2016
  • We propose plain fingerprint classification based on a core stochastic algorithm that effectively uses a core stochastic model, acquiring more fingerprint minutiae and direction, in order to increase matching performance. The proposed core stochastic algorithm uses core presence/absence and contains a ridge direction and distribution map. Simulations show that the fingerprint classification accuracy is improved by more than 14%, on average, compared to other algorithms.

Postprocessing Algorithm of Fingerprint Image Using Isometric SOM Neural Network (Isometric SOM 신경망을 이용한 지문 영상의 후처리 알고리듬)

  • Kim, Sang-Hee;Kim, Yung-Jung;Lee, Sung-Koo
    • 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.

Secured Authentication through Integration of Gait and Footprint for Human Identification

  • Murukesh, C.;Thanushkodi, K.;Padmanabhan, Preethi;Feroze, Naina Mohamed D.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.2118-2125
    • /
    • 2014
  • Gait Recognition is a new technique to identify the people by the way they walk. Human gait is a spatio-temporal phenomenon that typifies the motion characteristics of an individual. The proposed method makes a simple but efficient attempt to gait recognition. For each video file, spatial silhouettes of a walker are extracted by an improved background subtraction procedure using Gaussian Mixture Model (GMM). Here GMM is used as a parametric probability density function represented as a weighted sum of Gaussian component densities. Then, the relevant features are extracted from the silhouette tracked from the given video file using the Principal Component Analysis (PCA) method. The Fisher Linear Discriminant Analysis (FLDA) classifier is used in the classification of dimensional reduced image derived by the PCA method for gait recognition. Although gait images can be easily acquired, the gait recognition is affected by clothes, shoes, carrying status and specific physical condition of an individual. To overcome this problem, it is combined with footprint as a multimodal biometric system. The minutiae is extracted from the footprint and then fused with silhouette image using the Discrete Stationary Wavelet Transform (DSWT). The experimental result shows that the efficiency of proposed fusion algorithm works well and attains better result while comparing with other fusion schemes.