High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Iris Recognition using Hamming Distance and Fragile Bit Distance

Author(s):

Vivek Balasaheb Mandlik , Walchand College of Engineering, Sangli; Babasaheb G. Patil, Walchand College of Engineering, Sangli

Keywords:

Iris recognition algorithms, Bit fragility, Fragile bit pattern

Abstract

Iris recognition algorithms use the binary iris codes for iris. In iris code the iris information is represented with binary values. Iris recognition algorithms use different kind of filters to get details of iris pattern. The Gabor filters or Log-Gabor filters are mostly used for iris recognition. The iris code is real or imaginary part of the filtered iris template. Hamming distance between two iris codes can be used to measure similarity of two irises. Fragile bit pattern is term which defines location of fragile bits in the iris code. Similar to iris code, a fragile bit pattern for each iris can be generated. Based on hamming distance between two fragile bit patterns some similarity or non-similarity information for two irises can be obtained.

Other Details

Paper ID: IJSRDV3I60175
Published in: Volume : 3, Issue : 6
Publication Date: 01/09/2015
Page(s): 672-676

Article Preview

Download Article