• Title/Summary/Keyword: Fingerprint matching

Search Result 142, Processing Time 0.024 seconds

The Vulnerability Evaluation of Matching Algorithm and Minutiae Detection for Fingerprint Recognition (지문 인식을 위한 특징점 추출 및 매칭 알고리즘 취약성 평가)

  • 최진호;김창수
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.206-209
    • /
    • 2003
  • 생체인식 기술 중에서 지문-기반 인식은 많은 어플리케이션에 성공적으로 이용되어온 가장 오래된 방법이지만 지문 인식 시스템이 클라이언트/서버 형식으로 운영될 경우 지문 이미지를 획득하여 특징점을 추출하고 이를 서버로 전송하는 경우 보안 취약성이 존재한다. 취약성에는 여러 가지가 있을 수 있지만 본 연구와 관련된 부분은 지문 이미지 획득과 특징점 추출과정 그리고 추출된 특징점의 매칭 과정에 초점을 맞추고 있다. 본 논문에서는 지문 이미지의 영상 처리를 통한 특징점 추출 및 추출된 특징점을 변조하는 도구를 구현하여 기존의 지문인식 시스템들에 대한 매칭 알고리즘 취약성 평가를 검증할 수 있는 평가 도구를 설계 및 구현하였다. 매칭 알고리즘 취약성 평가는 평가를 위해 구현된 지문 인식 시스템에서 특징점을 추출하고, 추출된 특징점 중 단점을 이용하여 선택된 이미지 영역을 변조한다. 변조된 이미지는 평가 대상 시스템에서 재입력하여 평가를 수행한다.

  • PDF

Individual Identification Using Ear Region Based on SIFT (SIFT 기반의 귀 영역을 이용한 개인 식별)

  • Kim, Min-Ki
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.1
    • /
    • pp.1-8
    • /
    • 2015
  • In recent years, ear has emerged as a new biometric trait, because it has advantage of higher user acceptance than fingerprint and can be captured at remote distance in an indoor or outdoor environment. This paper proposes an individual identification method using ear region based on SIFT(shift invariant feature transform). Unlike most of the previous studies using rectangle shape for extracting a region of interest(ROI), this study sets an ROI as a flexible expanded region including ear. It also presents an effective extraction and matching method for SIFT keypoints. Experiments for evaluating the performance of the proposed method were performed on IITD public database. It showed correct identification rate of 98.89%, and it showed 98.44% with a deformed dataset of 20% occlusion. These results show that the proposed method is effective in ear recognition and robust to occlusion.

Contactless Biometric Using Thumb Image (엄지손가락 영상을 이용한 비접촉식 바이오인식)

  • Lim, Naeun;Han, Jae Hyun;Lee, Eui Chul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.12
    • /
    • pp.671-676
    • /
    • 2016
  • Recently, according to the limelight of Fintech, simple payment using biometric at smartphone is widely used. In this paper, we propose a new contactless biometric method using thumb image without additional sensors unlike previous biometrics such as fingerprint, iris, and vein recognition. In our method, length, width, and skin texture information are used as features. For that, illumination normalization, skin region segmentation, size normalization and alignment procedures are sequentially performed from the captured thumb image. Then, correlation coefficient is calculated for similarity measurement. To analyze recognition accuracy, genuine and imposter matchings are performed. At result, we confirmed the FAR of 1.68% at the FRR of 1.55%. In here, because the distribution of imposter matching is almost normal distribution, our method has the advantage of low FAR. That is, because 0% FAR can be achieved at the FRR of 15%, the proposed method is enough to 1:1 matching for payment verification.

Fingerprint Matching Algorithm Based on Artificial Immune System (인공 면역계에 기반한 지문 매칭 알고리즘)

  • 정재원;양재원;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.05a
    • /
    • pp.173-176
    • /
    • 2003
  • 지문은 종생불변성, 만인부동성, 그리고 사용상의 편리함 때문에 신원인증을 위한 생체인식에 많이 사용되고 있다. 최근에는 기하학구조에 기반한 특이점 매칭방식이 제안되어 인식성능이 매우 높고 잡음에 강한 특성이 있으나 매칭 회수가 많아 인식속도가 느린 단점이 있다. 따라서 기존의 방식은 소수의 지문에 대한 1:다 매칭이나 1:1매칭에 주로 사용된다. 본 논문에서는 기존의 문제점들을 개선하기 위하여 생체 면역계의 자기-비자기 인식 능력에 주목하였다. 생체 면역계는 자기-비자기의 구별 능력을 바탕으로 바이러스나병원균 등의 낮선 외부침입자로부터 자신을 보호하고 침입자를 식별, 제거하는 시스템이다. 본 논문에서는 생체 면역계를 이루는 면역세포 중의 하나인 세포독성 T세포의 생성과정에서 자기, 비자기를 구별하기 위한 MHC 인식부를 형성하는 과정에 착안한 빠르고 신뢰성 있는 지문 인식 알고리즘을 제안한다. 제안한 방식은 지문에 존재하는 특이점(minutiae)인식을 통해 1단계로 global 패턴을 생성하고 2단계로 기하학적인 구조를 만들며, 인식시 global 패턴을 인식한 MHC 인식부에 대해서만 2차 local 매칭을 수행함으로써 매칭 속도가 매우 빠르며 지문의 비틀림이나 회전 등에 대하여 강인하게 인식된다.

  • PDF

Audio Fingerprinting Based on Constant Q Transform for TV Commercial Advertisement Identification (TV 광고 식별을 위한 Constant-Q 변환 기반의 오디오 핑거프린팅 방식)

  • Ryu, Sang Hyeon;Kim, Hyoung-Gook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.3
    • /
    • pp.210-215
    • /
    • 2014
  • In spite of distortion caused by noise and echo, the audio fingerprinting technique must identify successfully an audio source. This audio fingerprinting technique is applying for TV commercial advertisement identification. In this paper, we propose a robust audio fingerprinting method for TV commercial advertisement identification. In the proposed method, a prominent audio peak pair fingerprint based on constant Q transform improves the accuracy of the audio fingerprinting system in real noisy environments. Experimental results confirm that the proposed method is quite robust than previous audio fingerprinting method in different noise conditions and achieves promising accurate results.

A study on Iris Recognition using Wavelet Transformation and Nonlinear Function

  • Hur, Jung-Youn;Truong, Le Xuan
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.10a
    • /
    • pp.553-559
    • /
    • 2004
  • In todays security industry, personal identification is also based on biometric. Biometric identification is performed basing on the measurement and comparison of physiological and behavioral characteristics, Biometric for recognition includes voice dynamics, signature dynamics, hand geometry, fingerprint, iris, etc. Iris can serve as a kind of living passport or living password. Iris recognition system is the one of the most reliable biometrics recognition system. This is applied to client/server system such as the electronic commerce and electronic banking from stand-alone system or networks, ATMs, etc. A new algorithm using nonlinear function in recognition process is proposed in this paper. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transform into polar coordinates. After performing three times Wavelet transformation, normalization was done using sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compare pairs of two adjacent pixels. The binary code of the iris is transmitted to the by server. the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the University database. Process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.

  • PDF

A Study of Location Correction Algorithm for Pedestrian Location Tracking in Traffic Connective Transferring System (교통 연계 환승 시스템의 보행자 위치 추적을 위한 보정 알고리즘 연구)

  • Jung, Jong-In;Lee, Sang-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.2
    • /
    • pp.149-157
    • /
    • 2009
  • Tracking technologies which provide real-time and customized information through various information collecting and processing for pedestrians who use traffic connective and transferring center have been being examined. However some problems are caused due to the wide-range positioning error for some services as device installation and service place. It is also difficult to be applied to traffic linkage and transfer services because many situations can be barren. In the testbed, Gwangmyoung Station, we got some results in bad conditions such as a lot of steel construction and another communication device. Practically, conditions of the place which will be built can be worse than Gwangmyoung station. Therefore, we researched suitable Location correction algorithm as a method for accuracy to traffic connective and transferring system. And its algorithm is designed through grid coordinates, map-matching, modeling coordinates and Kalman filtering and is being implemented continuously. Also preparing for optimization of various transferring center model, we designed for simulator type algorithm what is available for deciding algorithm factor.

  • PDF

Optimized KNN/IFCM Algorithm for Efficient Indoor Location (효율적인 실내 측위를 위한 최적화된 KNN/IFCM 알고리즘)

  • Lee, Jang-Jae;Song, Lick-Ho;Kim, Jong-Hwa;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.125-133
    • /
    • 2011
  • For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So intuitive fuzzy c-means(IFCM) clustering algorithm is applied to improve KNN, which is the KNN/IFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of IFCM based on signal to noise ratio(SNR). Then, the k RPs are classified into different clusters through IFCM based on SNR. Experimental results indicate that the proposed KNN/IFCM hybrid algorithm generally outperforms KNN, KNN/FCM, KNN/PFCM algorithm when the locations error is less than 2m.

KNN/ANN Hybrid Location Determination Algorithm for Indoor Location Base Service (실내 위치기반서비스를 위한 KNN/ANN Hybrid 측위 결정 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro;Song, Iick-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.109-115
    • /
    • 2011
  • As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So artificial neural network(ANN) clustering algorithm is applied to improve KNN, which is the KNN/ANN hybrid algorithm presented in this paper. For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of ANN based on SNR. Then, the k RPs are classified into different clusters through ANN based on SNR. Experimental results indicate that the proposed KNN/ANN hybrid algorithm generally outperforms KNN algorithm when the locations error is less than 2m.

Vector Calibration for Geomagnetic Field Based Indoor Localization (지자기 기반 실내 위치 추정을 위한 지자기 벡터 보정법)

  • Son, Won Joon;Choi, Lynn
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.15 no.3
    • /
    • pp.25-30
    • /
    • 2019
  • Magnetic sensors have the disadvantage that their vector values differ depending on the direction. In this paper, we propose a magnetic vector calibration method for geomagnetic-based indoor localization estimates. The fingerprinting technique used in geomagnetic-based indoor localization the position by matching the magnetic field map and the magnetic sensor value. However, since the moving direction of the current user may be different from the moving direction of the person who creates the magnetic field map at the collection time, the sampled magnetic vector may have different values from the vector values recorded in the field map. This may substantially lower the positioning accuracy. To avoid this problem, the existing studies use only the magnitude of magnetic vector, but this reduces the uniqueness of the fingerprint, which may also degrade the positioning accuracy. In this paper we propose a vector calibration algorithm which can adjust the sampled magnetic vector values to the vector direction of the magnetic field map by using the parametric equation of a circle. This can minimize the inaccuracy caused by the direction mismatch.