Driver Face Verification with Depth Maps

Face verification is the task of checking if two provided images contain the face of the same person or not. In this work, we propose a fully-convolutional Siamese architecture to tackle this task, achieving state-of-the-art results on three publicly-released datasets, namely Pandora, High-Resolution Range-based Face Database (HRRFaceD), and CurtinFaces. The proposed method takes depth maps as the input, since depth cameras have been proven to be more reliable in different illumination conditions. Thus, the system is able to work even in the case of the total or partial absence of external light sources, which is a key feature for automotive applications. From the algorithmic point of view, we propose a fully-convolutional architecture with a limited number of parameters, capable of dealing with the small amount of depth data available for training and able to run in real time even on a CPU and embedded boards. The experimental results show acceptable accuracy to allow exploitation in real-world applications with in-board cameras. Finally, exploiting the presence of faces occluded by various head garments and extreme head poses available in the Pandora dataset, we successfully test the proposed system also during strong visual occlusions. The excellent results obtained confirm the efficacy of the proposed method

Quality-Based Conditional Processing in Multi-Biometrics: Application to Sensor Interoperability

As biometric technology is increasingly deployed, it will be common to replace parts of operational systems with newer designs. The cost and inconvenience of reacquiring enrolled users when a new vendor solution is incorporated makes this approach difficult and many applications will require to deal with information from different sources regularly. These interoperability problems can dramatically affect the performance of biometric systems and thus, they need to be overcome. Here, we describe and evaluate the ATVS-UAM fusion approach submitted to the quality-based evaluation of the 2007 BioSecure Multimodal Evaluation Campaign, whose aim was to compare fusion algorithms when biometric signals were generated using several biometric devices in mismatched conditions. Quality measures from the raw biometric data are available to allow system adjustment to changing quality conditions due to device changes. This system adjustment is referred to as quality-based conditional processing. The proposed fusion approach is based on linear logistic regression, in which fused scores tend to be log-likelihood-ratios. This allows the easy and efficient combination of matching scores from different devices assuming low dependence among modalities. In our system, quality information is used to switch between different system modules depending on the data source (the sensor in our case) and to reject channels with low quality data during the fusion. We compare our fusion approach to a set of rule-based fusion schemes over normalized scores. Results show that the proposed approach outperforms all the rule-based fusion schemes. We also show that with the quality-based channel rejection scheme, an overall improvement of 25% in the equal error rate is obtained.Comment: Published at IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Human

Face recognition in the wild.

Research in face recognition deals with problems related to Age, Pose, Illumination and Expression (A-PIE), and seeks approaches that are invariant to these factors. Video images add a temporal aspect to the image acquisition process. Another degree of complexity, above and beyond A-PIE recognition, occurs when multiple pieces of information are known about people, which may be distorted, partially occluded, or disguised, and when the imaging conditions are totally unorthodox! A-PIE recognition in these circumstances becomes really “wild” and therefore, Face Recognition in the Wild has emerged as a field of research in the past few years. Its main purpose is to challenge constrained approaches of automatic face recognition, emulating some of the virtues of the Human Visual System (HVS) which is very tolerant to age, occlusion and distortions in the imaging process. HVS also integrates information about individuals and adds contexts together to recognize people within an activity or behavior. Machine vision has a very long road to emulate HVS, but face recognition in the wild, using the computer, is a road to perform face recognition in that path. In this thesis, Face Recognition in the Wild is defined as unconstrained face recognition under A-PIE+; the (+) connotes any alterations to the design scenario of the face recognition system. This thesis evaluates the Biometric Optical Surveillance System (BOSS) developed at the CVIP Lab, using low resolution imaging sensors. Specifically, the thesis tests the BOSS using cell phone cameras, and examines the potential of facial biometrics on smart portable devices like iPhone, iPads, and Tablets. For quantitative evaluation, the thesis focused on a specific testing scenario of BOSS software using iPhone 4 cell phones and a laptop. Testing was carried out indoor, at the CVIP Lab, using 21 subjects at distances of 5, 10 and 15 feet, with three poses, two expressions and two illumination levels. The three steps (detection, representation and matching) of the BOSS system were tested in this imaging scenario. False positives in facial detection increased with distances and with pose angles above ± 15°. The overall identification rate (face detection at confidence levels above 80%) also degraded with distances, pose, and expressions. The indoor lighting added challenges also, by inducing shadows which affected the image quality and the overall performance of the system. While this limited number of subjects and somewhat constrained imaging environment does not fully support a “wild” imaging scenario, it did provide a deep insight on the issues with automatic face recognition. The recognition rate curves demonstrate the limits of low-resolution cameras for face recognition at a distance (FRAD), yet it also provides a plausible defense for possible A-PIE face recognition on portable devices

On the Performance Improvement of Iris Biometric System

Iris is an established biometric modality with many practical applications. Its performance is influenced by noise, database size, and feature representation. This thesis focusses on mitigating these challenges by efficiently characterising iris texture,developing multi-unit iris recognition, reducing the search space of large iris databases, and investigating if iris pattern change over time.To suitably characterise texture features of iris, Scale Invariant Feature Transform (SIFT) is combined with Fourier transform to develop a keypoint descriptor-F-SIFT. Proposed F-SIFT is invariant to transformation, illumination, and occlusion along with strong texture description property. For pairing the keypoints from gallery and probe iris images, Phase-Only Correlation (POC) function is used. The use of phase information reduces the wrong matches generated using SIFT. Results demonstrate the effectiveness of F-SIFT over existing keypoint descriptors.To perform the multi-unit iris fusion, a novel classifier is proposed known as Incremental Granular Relevance Vector Machine (iGRVM) that incorporates incremental and granular learning into RVM. The proposed classifier by design is scalable and unbiased which is particularly suitable for biometrics. The match scores from individual units of iris are passed as an input to the corresponding iGRVM classifier, and the posterior probabilities are combined using weighted sum rule. Experimentally, it is shown that the performance of multi-unit iris recognition improves over single unit iris. For search space reduction, local feature based indexing approaches are developed using multi-dimensional trees. Such features extracted from annular iris images are used to index the database using k-d tree. To handle the scalability issue of k-d tree, k-d-b tree based indexing approach is proposed. Another indexing approach using R-tree is developed to minimise the indexing errors. For retrieval, hybrid coarse-to-fine search strategy is proposed. It is inferred from the results that unification of hybrid search with R-tree significantly improves the identification performance. Iris is assumed to be stable over time. Recently, researchers have reported that false rejections increase over the period of time which in turn degrades the performance. An empirical investigation has been made on standard iris aging databases to find whether iris patterns change over time. From the results, it is found that the rejections are primarily due to the presence of other covariates such as blur, noise, occlusion, pupil dilation, and not due to agin

Development of Multirate Filter – Based Region Features for Iris Identification

The emergence of biometric system is seen as the next-generation technological solution in strengthening the social and national security. The evolution of biometrics has shifted the paradigm of authentication from classical token and knowledge-based systems to physiological and behavioral trait based systems. R & D on iris biometrics, in last one decade, has established it as one of the most promising traits. Even though, iris biometric takes high resolution near-infrared (NIR) images as input, its authentication accuracy is very commendable. Its performance is often influenced by the presence of noise, database size, and feature representation. This thesis focuses on the use of multi resolution analysis (MRA) in developing suitable features for non-ideal iris images. Our investigation starts with the iris feature extraction technique using Cohen −Daubechies − Feauveau 9/7 (CDF 9/7) filter bank. In this work, a technique has been proposed to deal with issues like segmentation failure and occlusion. The experimental studies deal with the superiority of CDF 9/7 filter bank over the frequency based techniques. Since there is scope for improving the frequency selectivity of CDF 9/7 filter bank, a tunable filter bank is proposed to extract region based features from non-cooperative iris images. The proposed method is based on half band polynomial of 14th order. Since, regularity and frequency selectivity are in inverse relationship with each other, filter coefficients are derived by not imposing maximum number of zeros. Also, the half band polynomial is presented in x-domain, so as to apply semidefinite programming, which results in optimization of coefficients of analysis/synthesis filter. The next contribution in this thesis deals with the development of another powerful MRA known as triplet half band filter bank (THFB). The advantage of THFB is the flexibility in choosing the frequency response that allows one to overcome the magnitude constraints. The proposed filter bank has improved frequency selectivity along with other desired properties, which is then used for iris feature extraction. The last contribution of the thesis describes a wavelet cepstral feature derived from CDF 9/7 filter bank to characterize iris texture. Wavelet cepstrum feature helps in reducing the dimensionality of the detail coefficients; hence, a compact feature presentation is possible with improved accuracy against CDF 9/7. The efficacy of the features suggested are validated for iris recognition on three publicly available databases namely, CASIAv3, UBIRISv1, and IITD. The features are compared with other transform domain features like FFT, Gabor filter and a comprehensive evaluation is done for all suggested features as well. It has been observed that the suggested features show superior performance with respect to accuracy. Among all suggested features, THFB has shown best performance

Fairness and Bias in Algorithmic Hiring

Employers are adopting algorithmic hiring technology throughout the recruitment pipeline. Algorithmic fairness is especially applicable in this domain due to its high stakes and structural inequalities. Unfortunately, most work in this space provides partial treatment, often constrained by two competing narratives, optimistically focused on replacing biased recruiter decisions or pessimistically pointing to the automation of discrimination. Whether, and more importantly what types of, algorithmic hiring can be less biased and more beneficial to society than low-tech alternatives currently remains unanswered, to the detriment of trustworthiness. This multidisciplinary survey caters to practitioners and researchers with a balanced and integrated coverage of systems, biases, measures, mitigation strategies, datasets, and legal aspects of algorithmic hiring and fairness. Our work supports a contextualized understanding and governance of this technology by highlighting current opportunities and limitations, providing recommendations for future work to ensure shared benefits for all stakeholders

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%