• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.113-118
• /
• 2011

This paper has analyzed recognizing performance depending on the size of iris codes extracting by iris recognition algorithm using scale-space filtering. The iris images were created through pre-processing, the features were extracted by scale-space filtering, and the codes of 16 sizes were generated. The generated code's performance was compared for each code to calculate FAR and FRR by matching method utilizing Hamming distance. Every code had little overlapping portion between same person and other persons group so that the proposed algorithm's superiority was proved, and the performance of iris codes was analyzed for each size focused on convenience to use when implementing in realization. In addition, the iris codes suitable to iris recognition system that is high-reliable and is able to reduce user's inconvenience due to mis-rejection has been presented considering for commercialization.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.237-240
• /
• 2001

In this work, we will present an iris pattern recognition method as a biometrically based technology for personal identification and authentication. For this, we propose a new algorithm for extraction unique feature from images of the iris of the human eye and representing these feature using the discrete fourier transform. From the computational simplicity of the adopted transform, we can obtain more fast and efficient results than previous ones.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.133-137
• /
• 2006

In iris recognition, iris segmentation plays a very important role because its accuracy affects directly to the performance of the whole system. This paper proposes a new approach for segmenting iris that is fast, accurate and especially robust to occlusion and illumination. In this method, a circular filter is used for detecting the center of the inner circle. Then, a technique to linearize the limbus is applied and the limbus is detected using a linear filter. Experimental results show that the proposed method has promising performance for improving the iris recognition accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2424-2441
• /
• 2012

In this paper, we propose a fake iris detection method that combines the optical and textural features of the human eye. To extract the optical features, we used dual Purkinje images that were generated on the anterior cornea and the posterior lens surfaces based on an analytic model of the human eye's optical structure. To extract the textural features, we measured the amount of change in a given iris pattern (based on wavelet decomposition) with regard to the direction of illumination. This method performs the following two procedures over previous researches. First, in order to obtain the optical and textural features simultaneously, we used five illuminators. Second, in order to improve fake iris detection performance, we used a SVM (Support Vector Machine) to combine the optical and textural features. Through combining the features, problems of single feature based previous works could be solved. Experimental results showed that the EER (Equal Error Rate) was 0.133%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.20-30
• /
• 2003

In a conventional method based on quadrature 2D Gator wavelets to extract iris features, the iris recognition is performed by a 256-byte iris code, which is computed by applying the Gabor wavelets to a given area of the iris. However, there is a code redundancy because the iris code is generated by basis functions without considering the characteristics of the iris texture. Therefore, the size of the iris code is increased unnecessarily. In this paper, we propose a new feature extraction algorithm based on the ICA (Independent Component Analysis) for a compact iris code. We implemented the ICA to generate optimal basis functions which could represent iris signals efficiently. In practice the coefficients of the ICA expansions are used as feature vectors. Then iris feature vectors are encoded into the iris code for storing and comparing an individual's iris patterns. Additionally, we introduce two methods to enhance the recognition performance of the ICA. The first is to reorganize the ICA bases and the second is to use a different ICA bases set. Experimental results show that our proposed method has a similar EER (Equal Error Rate) as a conventional method based on the Gator wavelets, and the iris code size of our proposed methods is four times smaller than that of the Gabor wavelets.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.459-464
• /
• 2003

This paper proposes the use of a wavelet based image transform algorithm in human iris recognition method and the effectiveness of this technique will be determined in preprocessing of extracting Iris image from the user´s eye obtained by imaging device such as CCD Camera or due to torsional rotation of the eye, and it also resolves the problem caused by invariant under translations and dilations due to tilt of the head. This technique values through the proposed translation-invariant wavelet transform algorithm rather than the conventional wavelet transform method. Therefore we extracted the best-matching iris feature values and compared the stored feature codes with the incoming data to identify the user. As result of our experimentation, this technique demonstrate the significant advantage over verification when it compares with other general types of wavelet algorithm in the measure of FAR & FRR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.94-104
• /
• 2007

Iris recognition is biometric technology which uses a unique iris pattern of user in order to identify person. In the captured iris image by conventional iris recognition camera, it is often the case with eyelid occlusion, which covers iris information. The eyelids are unnecessary information that causes bad recognition performance, so this paper proposes robust algorithm in order to detect eyelid. This research has following three advantages compared to previous works. First, we remove the detected eyelash and specular reflection by linear interpolation method because they act as noise factors when locating eyelid. Second, we detect the candidate points of eyelid by using mask in limited eyelid searching area, which is determined by searching the cross position of eyelid and the outer boundary of iris. And our proposed algorithm detects eyelid by using parabolic hough transform based on the detected candidate points. Third, there have been many researches to detect eyelid, but they did not consider the rotation of eyelid in an iris image. Whereas, we consider the rotation factor in parabolic hough transform to overcome such problem. We tested our algorithm with CASIA Database. As the experimental results, the detection accuracy were 90.82% and 96.47% in case of detecting upper and lower eyelid, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.57-63
• /
• 2010

The damping parameter of Levenberg-Marquardt algorithm switches between error backpropagation and Gauss-Newton learning and affects learning speed. Fixing the damping parameter induces some oscillation of error and decreases learning speed. Therefore, we propose the way of a variable damping parameter with referring to the alternation of error. The proposed method makes the damping parameter increase if error rate is large and makes it decrease if error rate is small. This method so plays the role of momentum that it can improve learning speed. We tested both iris recognition and wine recognition for this paper. We found out that this method improved learning speed in 67% cases on iris recognition and in 78% cases on wine recognition. It was also showed that the oscillation of error by the proposed way was less than those of other algorithms.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.53-56
• /
• 2002

In this paper, we propose the method of iris lacuna extraction using watershed transform. Lacuna is salient feature of iris. It has three dimensional structure formed by leak of pigmentation and loss of fiber tissues. Lacuna can be used for iris recognition system, and generally used in health diagnosis and character analysis with its shape and position. The main idea of the proposed method is applying the watershed transform to radial gray scale profile of iris image. The result shows that the lacuna can be extracted automatically from eye image.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.716-721
• /
• 2003

This paper deals with the iris recognition as one of biometric techniques which are applied to identify a person using his/her behavior or congenital characteristics. The iris of a human eye has a texture that is unique and time invariant for each individual. First, we obtain the feature vector from the 2D iris pattern having a property of size invariant and divide it into 24 sectors which are further through three types of 2D Gabor filters. At the recognition process, we compute the similarity measure based on the correlation values. Here, since we use three different matching values obtained from three different directional Gabor filters and select the maximum value among them, it is possible to minimize the recognition error rate. To show the usefulness of the proposed algorithm, we applied it to a biometric database consisting of 50 iris patterns extracted from 10 subjects and finally get more higher than 90% recognition rate.