Iris Code Analysis and Preservation Implication Using Daugman Algorithm

Authors

  • Karthiga A Pondicherry Engineering College
  • Ramya Priya K Pondicherry Engineering College
  • Anu J Pondicherry Engineering College

Keywords:

Biometrics, Segmentation, Normalization, Iris code, Hamming Distance, Encryption Algorithm

Abstract

The authentication of a specific person based on the unique characteristics of that particular individual is
provided by biometric Verification method. Biometrics is a technological and scientific authentication method which is
used for security and replacement systems for ID cards, tokens or pins. There are many biometric technologies such as
face recognition, fingerprint, voice authentication etc, but iris recognition plays a crucial role related to the security
issue because it is one of the most reliable, robust, accurate biometric system for a specific user. It is well protected and
it is difficult to modify. Currently hacker easily get the information of a particular user by decompressing the iris image
and generating a iris template. This paper provide a solution to overcome these issues by generating a more secured and
unique cryptographic key from the iris template. This is achieved by extracting the features of through the preprocessing such as segmentation and normalization. Iris code is generated by using the linear binary patterns and the
generated code is encrypted using AES Encryption Algorithm. The Encryption Algorithm is employed to encrypt and
decrypt the identity data into the database and the matching is done by Hamming distance. This system provides a high
security with a low false acceptance rate.

Published

2018-05-25

How to Cite

Karthiga A, Ramya Priya K, & Anu J. (2018). Iris Code Analysis and Preservation Implication Using Daugman Algorithm. International Journal of Advance Research in Engineering, Science & Technology, 5(5), 71–76. Retrieved from https://ijarest.org/index.php/ijarest/article/view/1672