An LBP based Iris Recognition System using Feed Forward Back Propagation Neural Network

An iris recognition system using LBP feature extraction technique with Feed Forward Back Propagation Neural Network is presented. For feature extraction from the eye images the iris localization and segmentation is very important task so in proposed work Hough circular transform (HCT) is used to segment the iris region from the eye mages. In this proposed work Local Binary Pattern (LBP) feature extraction technique is used to extract feature from the segmented iris region, then feed forward back propagation neural network is use as a classifier and in any classifier there to phases training and testing. The LBP feature extraction technique is a straightforward technique and every proficient feature operator which labels the pixels of an iris image by thresholding the neighbourhood of each pixel and considers the feature as a result in form of binary number. Due to its discriminative efficiency and computational simplicity the LBP feature extractor has become a popular approach in various recognition systems. This proposed method decreased the FAR as well as FRR, & has increases the system performance on the given dataset. The average accuracy of proposed iris recognition system is more than 97%

An application of ARX stochastic models to iris recognition

We present a new approach for iris recognition based on stochastic autoregressive models with exogenous input (ARX). Iris recognition is a method to identify persons, based on the analysis of the eye iris. A typical iris recognition system is composed of four phases: image acquisition and preprocessing, iris localization and extraction, iris features characterization, and comparison and matching. The main contribution in this work is given in the step of characterization of iris features by using ARX models. In our work every iris in database is represented by an ARX model learned from data. In the comparison and matching step, data taken from iris sample are substituted into every ARX model and residuals are generated. A decision of accept or reject is taken based on residuals and on a threshold calculated experimentally. We conduct experiments with two different databases. Under certain conditions, we found a rate of successful identifications in the order of 99.7 % for one database and 100 % for the other.Applications in Artificial Intelligence - ApplicationsRed de Universidades con Carreras en Informática (RedUNCI

Multispectral iris recognition analysis: Techniques and evaluation

This thesis explores the benefits of using multispectral iris information acquired using a narrow-band multispectral imaging system. Commercial iris recognition systems typically sense the iridal reflection pertaining to the near-infrared (IR) range of the electromagnetic spectrum. While near-infrared imaging does give a very reasonable image of the iris texture, it only exploits a narrow band of spectral information. By incorporating other wavelength ranges (infrared, red, green, blue) in iris recognition systems, the reflectance and absorbance properties of the iris tissue can be exploited to enhance recognition performance. Furthermore, the impact of eye color on iris matching performance can be determined. In this work, a multispectral iris image acquisition system was assembled in order to procure data from human subjects. Multispectral images pertaining to 70 different eyes (35 subjects) were acquired using this setup. Three different iris localization algorithms were developed in order to isolate the iris information from the acquired images. While the first technique relied on the evidence presented by a single spectral channel (viz., near-infrared), the other two techniques exploited the information represented in multiple channels. Experimental results confirm the benefits of utilizing multiple channel information for iris segmentation. Next, an image enhancement technique using the CIE L*a*b* histogram equalization method was designed to improve the quality of the multispectral images. Further, a novel encoding method based on normalized pixel intensities was developed to represent the segmented iris images. The proposed encoding algorithm, when used in conjunction with the traditional texture-based scheme, was observed to result in very good matching performance. The work also explored the matching interoperability of iris images across multiple channels. This thesis clearly asserts the benefits of multispectral iris processing, and provides a foundation for further research in this topic

An application of ARX stochastic models to iris recognition

We present a new approach for iris recognition based on stochastic autoregressive models with exogenous input (ARX). Iris recognition is a method to identify persons, based on the analysis of the eye iris. A typical iris recognition system is composed of four phases: image acquisition and preprocessing, iris localization and extraction, iris features characterization, and comparison and matching. The main contribution in this work is given in the step of characterization of iris features by using ARX models. In our work every iris in database is represented by an ARX model learned from data. In the comparison and matching step, data taken from iris sample are substituted into every ARX model and residuals are generated. A decision of accept or reject is taken based on residuals and on a threshold calculated experimentally. We conduct experiments with two different databases. Under certain conditions, we found a rate of successful identifications in the order of 99.7 % for one database and 100 % for the other.Applications in Artificial Intelligence - ApplicationsRed de Universidades con Carreras en Informática (RedUNCI

Development of Robust Iris Localization and Impairment Pruning Schemes

Iris is the sphincter having flowery pattern around pupil in the eye region. The high randomness of the pattern makes iris unique for each individual and iris is identified by the scientists to be a candidate for automated machine recognition of identity of an individual. The morphogenesis of iris is completed while baby is in mother's womb; hence the iris pattern does not change throughout the span of life of a person. It makes iris one of the most reliable biometric traits. Localization of iris is the first step in iris biometric recognition system. The performance of matching is dependent on the accuracy of localization, because mislocalization would lead the next phases of biometric system to malfunction. The first part of the thesis investigates choke points of the existing localization approaches and proposes a method of devising an adaptive threshold of binarization for pupil detection. The thesis also contributes in modifying conventional integrodifferential operator based iris detection and proposes a modified version of it that uses canny detected edge map for iris detection. The other part of the thesis looks into pros and cons of the conventional global and local feature matching techniques for iris. The review of related research works on matching techniques leads to the observation that local features like Scale Invariant Feature Transform(SIFT) gives satisfactory recognition accuracy for good quality images. But the performance degrades when the images are occluded or taken non-cooperatively. As SIFT matches keypoints on the basis of 128-D local descriptors, hence it sometimes falsely pairs two keypoints which are from different portions of two iris images. Subsequently the need for filtering or pruning of faulty SIFT pairs is felt. The thesis proposes two methods of filtering impairments (faulty pairs) based on the knowledge of spatial information of the keypoints. The two proposed pruning algorithms (Angular Filtering and Scale Filtering) are applied separately and applied in union to have a complete comparative analysis of the result of matching

GPU Accelerated Parallel Iris Localization

Iris recognition is quite a computation intensive task with huge amounts of pixel processing. After the image acquisition of the eye, Iris recognition is basically divided into Iris localization, Feature Extraction and Matching steps. Each of these tasks involves a lot of processing. It thus becomes essential to improve the performance of each step to gain an overall increase in performance. The localization step is of utmost importance since it nds out the essential region over which further steps of Iris Recognition are to be performed. It thus decreases the amount of computation that will be needed in the subsequent steps. In this thesis an effort has been made to improve the performance of Iris localization by the use of parallel computing techniques. Recently the General Purpose Graphics Processing Units(GPUs) have come to be very popular in solving complex computational tasks. In order to achieve a speedup in the localization step, the Compute Unifed Device Architecture(CUDA) platform released by NVIDIA corporation has been used. Hough Transform for circles has been used to perform the localization step since it has the ability to handle noisy data very effciently. The edge image has been obtained using the popular canny edge detector and it serves as the input for the Hough Transformation step. Since the image data as well as the edge detecting mechanism may not be perfect, the Hough transform method carries out a voting mechanism over the image objects, in order to deal with imperfections like noisy data. Parallelism is employed in the Hough transformation step, when for each possible value of the radius a large number of circles have to be generated in the parameter space, and this task is taken over by parallel blocks and threads, which substantially improves the computation time required to identify the circular contours in the image space

Learning to Find Eye Region Landmarks for Remote Gaze Estimation in Unconstrained Settings

Conventional feature-based and model-based gaze estimation methods have proven to perform well in settings with controlled illumination and specialized cameras. In unconstrained real-world settings, however, such methods are surpassed by recent appearance-based methods due to difficulties in modeling factors such as illumination changes and other visual artifacts. We present a novel learning-based method for eye region landmark localization that enables conventional methods to be competitive to latest appearance-based methods. Despite having been trained exclusively on synthetic data, our method exceeds the state of the art for iris localization and eye shape registration on real-world imagery. We then use the detected landmarks as input to iterative model-fitting and lightweight learning-based gaze estimation methods. Our approach outperforms existing model-fitting and appearance-based methods in the context of person-independent and personalized gaze estimation

Fast and Accurate Algorithm for Eye Localization for Gaze Tracking in Low Resolution Images

Iris centre localization in low-resolution visible images is a challenging problem in computer vision community due to noise, shadows, occlusions, pose variations, eye blinks, etc. This paper proposes an efficient method for determining iris centre in low-resolution images in the visible spectrum. Even low-cost consumer-grade webcams can be used for gaze tracking without any additional hardware. A two-stage algorithm is proposed for iris centre localization. The proposed method uses geometrical characteristics of the eye. In the first stage, a fast convolution based approach is used for obtaining the coarse location of iris centre (IC). The IC location is further refined in the second stage using boundary tracing and ellipse fitting. The algorithm has been evaluated in public databases like BioID, Gi4E and is found to outperform the state of the art methods.Comment: 12 pages, 10 figures, IET Computer Vision, 201