Iris Localization Based on Edge Searching Strategies

An iris localization scheme based on edge searching strategies is presented. First, the edge detection operator Laplacian-of-Gaussian （LOG） is used to iris original image to search its inner boundary. Then, a circle detection operator is introduced to locate the outer boundary and its center, which is invariant of translation, rotation and scale. Finally, the method of curve fitting is developed in localization of eyelid. The performance of the proposed method is tested with 756 iris images from 108 different classes in CASIA Iris Database and compared with the conventional Hough transform method. The experimental results show that without loss of localization accuracy, the proposed iris localization algorithm is apparendy faster than Hough transform.

New Iris Localization Method Based on Chaos Genetic Algorithm

This paper present a new method based on Chaos Genetic Algorithm (CGA) to localize the human iris in a given image. First, the iris image is preprocessed to estimate the range of the iris localization, and then CGA is used to extract the boundary of the ~iris . Simulation results show that the proposed algorithms is efficient and robust, and can achieve sub pixel precision. Because Genetic Algorithms (GAs) can search in a large space, the algorithm does not need accurate estimation of iris center for subsequent localization, and hence can lower the requirement for original iris image processing. On this point, the present localization algirithm is superior to Daugman's algorithm.

Reliable iris localization using integral projection function and 2D-shape properties

Iris recognition technology recognizes a human based on his/her iris pattern. However, the accuracy of the iris recognition technology depends on accurate iris localization. Localizing a pupil region in the presence of other low-intensity regions, such as hairs, eyebrows, and eyelashes, is a challenging task. This study proposes an iris localization technique that includes a localizing pupillary boundary in a sub-image by using an integral projection function and two-dimensional shape properties （e.g., area, geometry, and circularity）. The limbic boundary is localized using gradients and an error distance transform, and the boundary is regularized with active contours. Experimental results obtained from public databases show the superiority of the Drooosed techniaue over contemporary methods.

Iris Recognition Technique

The demand on security is increasing greatly in these years and biometric recognition gradually becomes a hot field of research. Iris recognition is a new branch of biometric recognition, which is regarded as the most stable, safe and accurate biometric recognition method. In these years, much progress in this field has been made by scholars and experts of different countries. In this paper, some successful iris recognition methods are listed and their performance are compared. Furthermore, the existing problems and challenges are discussed.

An Improved Daugman Method for Iris Recognition

An improved Daugman iris recognition algorithm is provided in this paper, which embodies in two aspects： 1 Improvement for iris localization and 2 The improvement for both iris encoding and matching algorithms. In Step 1, the localization and shape of the pupil are roughly determined in iris image, which is used as prior knowledge to quickly locate the inner and outer boundary of iris from rough to fine scale. Eyelids, eyelashes areas and the spot in the pupil are automatically detected and removed to improve the localization accuracy. In Step 2, the possible noise from residual eyelashes is further filtered by selecting a ＂pure＂ iris area as a reference and making a validation judgment pixel-wise. Furthermore, the validation flag for each pixel is introduced into the iris encoding and matching computation, as a result, the rejection rate of iris recognition is reduced. Compared with Daugman algorithm, iris recognition test on collected human eye images shows that our proposed algorithm has an obvious improvement both on boosting the speed and reducing the rejection rate.