Optimal Generation of Iris Codes for Iris Recognition

Abstract

The calculation of binary iris codes from feature values (e.g., the result of Gabor transform) is a key step in iris recognition systems. Traditional binarization method based on the sign of feature values has achieved very promising performance. However, currently, little research focuses on a deeper insight into this binarization method to produce iris codes. In this paper, we illustrate the iris code calculation from the perspective of optimization. We demonstrate that the traditional iris code is the solution of an optimization problem, which minimizes the distance between the feature values and the iris codes. Furthermore, we show that more effective iris codes can be obtained by adding terms to the objective function of this optimization problem. We investigate two additional objective terms. The first objective term exploits the spatial relationships of the bits in different positions of an iris code. The second objective term mitigates the influence of less reliable bits in iris codes. The two objective terms can be applied to the optimization problem individually, or in a combined scheme. We conduct experiments on four benchmark datasets with varying image quality. The experimental results demonstrate that the iris code produced by solving the optimization problem with the two additional objective terms achieves a generally improved performance in comparison to the traditional iris code calculated by binarizing feature values based on their signs.