algorithm for iris code organization and searching for iris recognition system
Iris recognition has become one of the prominent biometrics features in human identification system. In addition to light intensity, focusing and capture distance problems, percent of IRIS visibility are also one of the major problems. This can cause failure in most common method, Hamming Distance (HD), used for matching the templates. This paper proposes the iris code organization and searching algorithm suggesting the improvement in template matching process. The algorithm also suggests template selection to avoid comparison with all existing IRIS codes resulting in faster searching speed. For the IRIS that has accumulated the cataract, HD methods shows major failure results. The proposed algorithm shows better performance over conventional HD method of template matching and IRIS code selection for template matching.
iris codes organization iris comparison iris code searching iris code database