An efficient iris image thresholding based on binarization threshold in black hole search method

In iris recognition system, the segmentation stage is one of the most important stages where the iris is located and then further segmented into outer and lower boundary of iris region. Several algorithms have been proposed in order to segment the outer and lower boundary of the iris region. The aim of this research is to identify the suitable threshold value in order to locate the outer and lower boundaries using Black Hole Search Method. We chose these methods because of the ineffient features of the other methods in image indetification and verifications. The experiment was conducted using three data set; UBIRIS, CASIA and MMU because of their superiority over others. Given that different iris databases have different file formats and quality, the images used for this work are jpeg and bmp. Based on the experimentation, most suitable threshold values for identification of iris aboundaries for different iris databases have been identified. It is therefore compared with the other methods used by other researchers and found out that the values of 0.3, 0.4 and 0.1 for database UBIRIS, CASIA and MMU respectively are more accurate and comprehensive. The study concludes that threshold values vary depending on the database

Indexing techniques for fingerprint and iris databases

This thesis addresses the problem of biometric indexing in the context of fingerprint and iris databases. In large scale authentication system, the goal is to determine the identity of a subject from a large set of identities. Indexing is a technique to reduce the number of candidate identities to be considered by the identification algorithm. The fingerprint indexing technique (for closed set identification) proposed in this thesis is based on a combination of minutiae and ridge features. Experiments conducted on the FVC2002 and FVC2004 databases indicate that the inclusion of ridge features aids in enhancing indexing performance. The thesis also proposes three techniques for iris indexing (for closed set identification). The first technique is based on iriscodes. The second technique utilizes local binary patterns in the iris texture. The third technique analyzes the iris texture based on a pixel-level difference histogram. The ability to perform indexing at the texture level avoids the computational complexity involved in encoding and is, therefore, more attractive for iris indexing. Experiments on the CASIA 3.0 database suggest the potential of these schemes to index large-scale iris databases

FPGA-based enhanced probabilistic convergent weightless network for human iris recognition

This paper investigates how human identification and identity verification can be performed by the application of an FPGA based weightless neural network, entitled the Enhanced Probabilistic Convergent Neural Network (EPCN), to the iris biometric modality. The human iris is processed for feature vectors which will be employed for formation of connectivity, during learning and subsequent recognition. The pre-processing of the iris, prior to EPCN training, is very minimal. Structural modifications were also made to the Random Access Memory (RAM) based neural network which enhances its robustness when applied in real-time

Deep Learning-Based Iris Segmentation Algorithm for Effective Iris Recognition System

In this study, a 19-layer convolutional neural network model is developed for accurate iris segmentation and is trained and validated using five publicly available iris image datasets. An integrodifferential operator is used to create labeled images for CASIA v1.0, CASIA v2.0, and PolyU Iris image datasets. The performance of the proposed model is evaluated based on accuracy, sensitivity, selectivity, precision, and F-score. The accuracy obtained for CASIA v1.0, CASIA v2.0, CASIA Iris Interval, IITD, and PolyU Iris are 0.82, 0.97, 0.9923, 0.9942, and 0.98, respectively. The result shows that the proposed model can accurately predict iris and non-iris regions and thus can be an effective tool for iris segmentation

Binary Weighted Memristive Analog Deep Neural Network for Near-Sensor Edge Processing

The memristive crossbar aims to implement analog weighted neural network, however, the realistic implementation of such crossbar arrays is not possible due to limited switching states of memristive devices. In this work, we propose the design of an analog deep neural network with binary weight update through backpropagation algorithm using binary state memristive devices. We show that such networks can be successfully used for image processing task and has the advantage of lower power consumption and small on-chip area in comparison with digital counterparts. The proposed network was benchmarked for MNIST handwritten digits recognition achieving an accuracy of approximately 90%

Development of CUiris: A Dark-Skinned African Iris Dataset for Enhancement of Image Analysis and Robust Personal Recognition

Iris recognition algorithms, especially with the emergence of large-scale iris-based identification systems, must be tested for speed and accuracy and evaluated with a wide range of templates – large size, long-range, visible and different origins. This paper presents the acquisition of eye-iris images of dark-skinned subjects in Africa, a predominant case of verydark- brown iris images, under near-infrared illumination. The peculiarity of these iris images is highlighted from the histogram and normal probability distribution of their grayscale image entropy (GiE) values, in comparison to Asian and Caucasian iris images. The acquisition of eye-images for the African iris dataset is ongoing and will be made publiclyavailable as soon as it is sufficiently populated

Indexing Iris Database Using Multi-Dimensional R-Trees

Iris is one of the most widely used biometric modality for recognition due to its reliability, non-invasive characteristic, speed and performance. The patterns remain stable throughout the lifetime of an individual. Attributable to these advantages, the application of iris biometric is increasingly encouraged by various commercial as well as government agencies. Indexing is done to identify and retrieve a small subset of candidate data from the database of iris data of individuals in order to determine a possible match. Since the database is extremely large, it is necessary to find fast and efficient indexing methods. In this thesis, an efficient local feature based indexing approach is proposed using clustered scale invariant feature transform (SIFT) keypoints, that achieves invariance to similarity transformations, illumination and occlusion. These cluster centers are used to construct R-trees for indexing. This thesis proposes an application of R-trees for iris database indexing. The system is tested using publicly available BATH and CASIA-IrisV4 databases