A drowsiness detection method based on displacement and gradient vectors

This paper presents a drowsiness detection method for drivers based on visual features in a video sequence. Image intensities are traditionally visual features. However, it is known that they are directly influenced by lighting conditions. We propose a human eye detection method using the normalized cross-correlation between displacement vectors and gradient vectors. Gradient vectors are dependent on lighting conditions but the normalization step makes them independent of illuminations. In this way, the proposed method can detect human eyes regardless of various lighting conditions. We have also found that normalized cross-correlation can be useful, not only for detecting eyes, but also for recognizing open and closed eye states. To overcome poor lighting conditions, we used infrared auxiliary illumination in order to make the proposed method work every moment. The computation speed of the proposed method is fast enough to perform at video rates

Hamming Distance Method with Subjective and Objective Weights for Personnel Selection

Multicriteria decision making (MCDM) is one of the methods that popularly has been used in solving personnel selection problem. Alternatives, criteria, and weights are some of the fundamental aspects in MCDM that need to be defined clearly in order to achieve a good result. Apart from these aspects, fuzzy data has to take into consideration that it may arise from unobtainable and incomplete information. In this paper, we propose a new approach for personnel selection problem. The proposed approach is based on Hamming distance method with subjective and objective weights (HDMSOW’s). In case of vagueness situation, fuzzy set theory is then incorporated onto the HDMSOW’s. To determine the objective weight for each attribute, the fuzzy Shannon’s entropy is considered. While for the subjective weight, it is aggregated into a comparable scale. A numerical example is presented to illustrate the HDMSOW’s

Iris recognition performance enhancement using weighted majority voting

Biometric authentication is a convenient and increasingly reli-able way to prove one’s identity. Iris scanning in particular is among the most accurate biometric authentication technologies currently available. However, despite their extremely high accuracy under ideal imaging conditions, existing iris recognition methods degrade when the iris images are noisy or the enrollment and verification imaging conditions are substantially different. To address this issue and enable iris recognition on less-than-ideal images, we introduce a weighted majority voting technique applicable to any biometric authentication system using bitwise comparison of enrollment-time and verification-time biometric templates. In a series of experiments with the CASIA iris database, we find that the method outperforms existing majority voting and reliable bit selection techniques. Our method is a simple and efficient means to improve upon the accu-racy of existing iris recognition systems. Index Terms — Biometrics, iris recognition, weighted majority voting 1

Recognition of Nonideal Iris Images Using Shape Guided Approach and Game Theory

Most state-of-the-art iris recognition algorithms claim to perform with a very high recognition accuracy in a strictly controlled environment. However, their recognition accuracies significantly decrease when the acquired images are affected by different noise factors including motion blur, camera diffusion, head movement, gaze direction, camera angle, reflections, contrast, luminosity, eyelid and eyelash occlusions, and problems due to contraction and dilation. The main objective of this thesis is to develop a nonideal iris recognition system by using active contour methods, Genetic Algorithms (GAs), shape guided model, Adaptive Asymmetrical Support Vector Machines (AASVMs) and Game Theory (GT). In this thesis, the proposed iris recognition method is divided into two phases: (1) cooperative iris recognition, and (2) noncooperative iris recognition. While most state-of-the-art iris recognition algorithms have focused on the preprocessing of iris images, recently, important new directions have been identified in iris biometrics research. These include optimal feature selection and iris pattern classification. In the first phase, we propose an iris recognition scheme based on GAs and asymmetrical SVMs. Instead of using the whole iris region, we elicit the iris information between the collarette and the pupil boundary to suppress the effects of eyelid and eyelash occlusions and to minimize the matching error. In the second phase, we process the nonideal iris images that are captured in unconstrained situations and those affected by several nonideal factors. The proposed noncooperative iris recognition method is further divided into three approaches. In the first approach of the second phase, we apply active contour-based curve evolution approaches to segment the inner/outer boundaries accurately from the nonideal iris images. The proposed active contour-based approaches show a reasonable performance when the iris/sclera boundary is separated by a blurred boundary. In the second approach, we describe a new iris segmentation scheme using GT to elicit iris/pupil boundary from a nonideal iris image. We apply a parallel game-theoretic decision making procedure by modifying Chakraborty and Duncan's algorithm to form a unified approach, which is robust to noise and poor localization and less affected by weak iris/sclera boundary. Finally, to further improve the segmentation performance, we propose a variational model to localize the iris region belonging to the given shape space using active contour method, a geometric shape prior and the Mumford-Shah functional. The verification and identification performance of the proposed scheme is validated using four challenging nonideal iris datasets, namely, the ICE 2005, the UBIRIS Version 1, the CASIA Version 3 Interval, and the WVU Nonideal, plus the non-homogeneous combined dataset. We have conducted several sets of experiments and finally, the proposed approach has achieved a Genuine Accept Rate (GAR) of 97.34% on the combined dataset at the fixed False Accept Rate (FAR) of 0.001% with an Equal Error Rate (EER) of 0.81%. The highest Correct Recognition Rate (CRR) obtained by the proposed iris recognition system is 97.39%

A generic computer platform for efficient iris recognition

This document presents the work carried out for the purposes of completing the Engineering Doctorate (EngD) program at the Institute for System Level Integration (iSLI), which was a partnership between the universities of Edinburgh, Glasgow, Heriot-Watt and Strathclyde. The EngD is normally undertaken with an industrial sponsor, but due to a set of unforeseen circumstances this was not the case for this work. However, the work was still undertaken to the same standards as would be expected by an industrial sponsor. An individual’s biometrics include fingerprints, palm-prints, retinal, iris and speech patterns. Even the way people move and sign their name has been shown to be uniquely associated with that individual. This work focuses on the recognition of an individual’s iris patterns. The results reported in the literature are often presented in such a manner that direct comparison between methods is difficult. There is also minimal code resource and no tool available to help simplify the process of developing iris recognition algorithms, so individual developers are required to write the necessary software almost every time. Finally, segmentation performance is currently only measurable using manual evaluation, which is time consuming and prone to human error. This thesis presents a completely novel generic platform for the purposes of developing, testing and evaluating iris recognition algorithms which is designed to simplify the process of developing and testing iris recognition algorithms. Existing open-source algorithms are integrated into the generic platform and are evaluated using the results it produces. Three iris recognition segmentation algorithms and one normalisation algorithm are proposed. Three of the algorithms increased true match recognition performance by between two and 45 percentage points when compared to the available open-source algorithms and methods found in the literature. A matching algorithm was developed that significantly speeds up the process of analysing the results of encoding. Lastly, this work also proposes a method of automatically evaluating the performance of segmentation algorithms, so minimising the need for manual evaluation