Efficient Iris Pattern Recognition Method By Using Adaptive Hamming Distance And 1d Log-Gabor Filter

Iris recognition is one of the highly reliable security methods as compared to the other bio-metric security techniques. The iris is an internal organ whose texture is randomly determined during embryonic gestation and is amenable with a computerized machine vision system for the remote examination. Previously, researchers utilized different approaches like Hamming Distance in their iris recognition algorithms. In this paper, we propose a new method to improve the performance of the iris recognition matching system. Firstly, 1D Log-Gabor Filter is used to encode the unique features of iris into the binary template. The efficiency of the algorithm can be increased by taking into account the coincidence fragile bit's location with 1D Log-Gabor filter. Secondly, Adaptive Hamming Distance is used to examine the affinity of two templates. The main steps of proposed iris recognition algorithm are segmentation by using the Hough's circular transformation method, normalization by Daugman's rubber sheet model that provides a high percentage of accuracy, feature encoding and matching. Simulation studies are made to test the validity of the proposed algorithm. The results obtained ensure the superior performance of our algorithm against several state-of-the-art iris matching algorithms. Experiments are performed on the CASIA V1.0 iris database, the success of the proposed method with a genuine acceptance rate is 99.92%.