• Title/Summary/Keyword: Fingerprint recognition system

Search Result 144, Processing Time 0.022 seconds

A Study of Car Plate Recognition System on The Park (주차장 자동차번호 인식 시스템에 관한 연구)

  • 신강호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.4
    • /
    • pp.87-91
    • /
    • 2003
  • In this paper, a rotation invariant fingerprint identification system is implemented using the circular harmonic filter and phase only correlator. We extracted the phase component from input fingerprint image and correlate it with the circular harmonic filter of the reference fingerprint image by POC. The input image is obtained using a prism operating in the internal full reflection mode. Then the input image is transformed to two dimensional Fourier spectrum in optical way and the phase component is extracted using a digital system from the spectrum. Because composed of the optical system and digital algorithm, the proposed system has the advantages of the two technologies such as realtime parallel processing property of the optics and the flexibility of the digital system.

  • PDF

Human Iris Recognition using Wavelet Transform and Neural Network

  • Cho, Seong-Won;Kim, Jae-Min;Won, Jung-Woo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.2
    • /
    • pp.178-186
    • /
    • 2003
  • Recently, many researchers have been interested in biometric systems such as fingerprint, handwriting, key-stroke patterns and human iris. From the viewpoint of reliability and robustness, iris recognition is the most attractive biometric system. Moreover, the iris recognition system is a comfortable biometric system, since the video image of an eye can be taken at a distance. In this paper, we discuss human iris recognition, which is based on accurate iris localization, robust feature extraction, and Neural Network classification. The iris region is accurately localized in the eye image using a multiresolution active snake model. For the feature representation, the localized iris image is decomposed using wavelet transform based on dyadic Haar wavelet. Experimental results show the usefulness of wavelet transform in comparison to conventional Gabor transform. In addition, we present a new method for setting initial weight vectors in competitive learning. The proposed initialization method yields better accuracy than the conventional method.

A Study on an Algorithm for Eliminating False Feature Points (의사 특징점 제거 알고리즘 관한 연구)

  • Jeong, Yang-Gwon;Choe, Jae-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.899-907
    • /
    • 1996
  • In this paper, we proposed an algorithm to eliminate false feature points to upgrade the system ability using the cross number method. By using the proposal algorithm, it was able to extract feature points exactly and increase the recognition rates.In the experiment, we used3 groups : the uncut-partially noised, and uncut completely noised fingerprint to verify our proposal. We then compared the results of the proposed system with those of another system in which false feature points were not eliminated. We have obtained good recognition rates of 97.7%, 97.7%, and95.0% in the cut, uncut-partially noised, and the uncut-completely noised fingerprints. However, the other system received the results of the cut 60%, the uncut-partially noised 35%, and the uncut-completely noised 50% respectively. As a result, we belive that the fingerprint may be recognized after adapting the proposal algorithm.

  • PDF

A Study of the Pattern Kernels for a Lip Print Recognition

  • Paik, Kyoung-Seok;Chung, Chin-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.64-69
    • /
    • 1998
  • This paper presents a lip print recognition by the pattern kernels for a personal identification. A lip print recognition is developed less than the other physical attributes of a fingerprint, a voice pattern, a retinal blood/vessel pattern, or a facial recognition. A new method is proposed to recognize a lip print bi the pattern kernels. The pattern kernels are a function consisted of some local lip print pattern masks. This function converts the information on a lip print into the digital data. The recognition in the multi-resolution system is more reliable than recognition in the single-resolution system. The results show that the proposed algorithm by the multi-resolution architecture can be efficiently realized.

  • PDF

Efficient 1:N Fingerprint Matching Algorithm using Matching Score Distribution (매칭 점수 분포를 이용한 효율적인 1:N 지문 매칭 알고리듬)

  • Kim, Kyoung-Min;Park, Joong-Jo;Lee, Buhm;Go, Young-Jin;Jung, Soon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.3
    • /
    • pp.208-217
    • /
    • 2012
  • This paper presents two adaptive fingerprint matching methods. First, we experiment an adaptive threshold selection of 1:N matching system in order to raise the reliability of the matching score. Second, we propose a adaptive threshold selection using fitting algorithm for high speed matching. The experiment was conducted on the NITZEN database, which has 5247 samples. Consequently, this paper shows that our suggested method can perform 1.88 times faster matching speed than the bidirectional matching speed. And, we prove that FRR of our suggested method decreases 1.43 % than that of the unidirectional matching.

Rotation and Size Invariant Fingerprint Recognition Using The Neural Net (회전과 크기변화에 무관한 신경망을 이용한 지문 인식)

  • Lee, Nam-Il;U, Yong-Tae;Lee, Jeong-Hwan
    • 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.

  • PDF

Volume holographic correlator for fingerprint recognition (지문 인식을 위한 체적 홀로그래픽 광상관기)

  • 이승현;김은수
    • Korean Journal of Optics and Photonics
    • /
    • v.9 no.6
    • /
    • pp.385-389
    • /
    • 1998
  • In this paper, we propose an optical correlator system using volume holograms for database of matched filters. Optical correlator has high speed and parallel processing characteristics of optics. Matched filters are recorded into a volume hologram that can store data with high density, transfer them with high speed, and select a randomly chosen data element. The multiple reference images of database are prerecorded in a photorefractive crystal in the form of Fourier transform images, simply by passing the image displayed in a spatial light modulator through a Fourier transform lens. The angular multiplexing method for multiple holograms of database can be achieved by rotating the crystal by use of a step motor. Experimental results show that the proposed system can be used for the fingerprint recognition.

  • PDF

Matching Algorithms using the Union and Division (결합과 분배를 이용한 정합 알고리즘)

  • 박종민;조범준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.1102-1107
    • /
    • 2004
  • Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

Fingerprint Identification Algorithm using Pixel Direction Factor in Blocks (블록별 화소방향성분을 이용한 지문의 동일성 판별 알고리즘)

  • Cho Nam-Hyung;Lee Joo-Shin
    • 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.

Animal Administration System Using Nose-Print Recognition and Blockchain Network (비문 인식과 블록체인 네트워크를 사용한 동물 관리 시스템)

  • Cho, Ji-Yeon;Lee, Seongsoo
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1477-1480
    • /
    • 2019
  • Animal authentication, where an animal is identified as the preregistered specific one or not, is exploited various fields such as animal hospital, animal shop, animal shelter, and animal insurance. Nose-print is widely exploited to identify animal as fingerprint is exploited to identify human. This paper introduces an animal administration system, where it performs animal registration and authentication through nose-print recognition and it connects various clients through blockchain network.