Information theory and the iriscode

Iris recognition has legendary resistance to False Matches, and the tools of information theory can help to explain why. The concept of entropy is fundamental to understanding biometric collision avoidance. This paper analyses the bit sequences of IrisCodes computed both from real iris images and from synthetic “white noise” iris images whose pixel values are random and uncorrelated. The capacity of the IrisCode as a channel is found to be 0.566 bits per bit encoded, of which 0.469 bits of entropy per bit is encoded from natural iris images. The difference between these two rates reflects the existence of anatomical correlations within a natural iris, and the remaining gap from one full bit of entropy per bit encoded reflects the correlations in both phase and amplitude introduced by the Gabor wavelets underlying the IrisCode. A simple two-state Hidden Markov Model is shown to emulate exactly the statistics of bit sequences generated both from natural and white noise iris images, including their “imposter” distributions, and may be useful for generating large synthetic IrisCode databases.This is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/TIFS.2015.250019

Constrained Design of Deep Iris Networks

Despite the promise of recent deep neural networks in the iris recognition setting, there are vital properties of the classic IrisCode which are almost unable to be achieved with current deep iris networks: the compactness of model and the small number of computing operations (FLOPs). This paper re-models the iris network design process as a constrained optimization problem which takes model size and computation into account as learning criteria. On one hand, this allows us to fully automate the network design process to search for the best iris network confined to the computation and model compactness constraints. On the other hand, it allows us to investigate the optimality of the classic IrisCode and recent iris networks. It also allows us to learn an optimal iris network and demonstrate state-of-the-art performance with less computation and memory requirements

Anonymous subject identification and privacy information management in video surveillance

The widespread deployment of surveillance cameras has raised serious privacy concerns, and many privacy-enhancing schemes have been recently proposed to automatically redact images of selected individuals in the surveillance video for protection. Of equal importance are the privacy and efficiency of techniques to first, identify those individuals for privacy protection and second, provide access to original surveillance video contents for security analysis. In this paper, we propose an anonymous subject identification and privacy data management system to be used in privacy-aware video surveillance. The anonymous subject identification system uses iris patterns to identify individuals for privacy protection. Anonymity of the iris-matching process is guaranteed through the use of a garbled-circuit (GC)-based iris matching protocol. A novel GC complexity reduction scheme is proposed by simplifying the iris masking process in the protocol. A user-centric privacy information management system is also proposed that allows subjects to anonymously access their privacy information via their iris patterns. The system is composed of two encrypted-domain protocols: The privacy information encryption protocol encrypts the original video records using the iris pattern acquired during the subject identification phase; the privacy information retrieval protocol allows the video records to be anonymously retrieved through a GC-based iris pattern matching process. Experimental results on a public iris biometric database demonstrate the validity of our framework

SHE based Non Interactive Privacy Preserving Biometric Authentication Protocols

Being unique and immutable for each person, biometric signals are widely used in access control systems. While biometric recognition appeases concerns about password's theft or loss, at the same time it raises concerns about individual privacy. Central servers store several enrolled biometrics, hence security against theft must be provided during biometric transmission and against those who have access to the database. If a server's database is compromised, other systems using the same biometric templates could also be compromised as well. One solution is to encrypt the stored templates. Nonetheless, when using traditional cryptosystem, data must be decrypted before executing the protocol, leaving the database vulnerable. To overcame this problem and protect both the server and the client, biometrics should be processed while encrypted. This is possible by using secure two-party computation protocols, mainly based on Garbled Circuits (GC) and additive Homomorphic Encryption (HE). Both GC and HE based solutions are efficient yet interactive, meaning that the client takes part in the computation. Instead in this paper we propose a non-interactive protocol for privacy preserving biometric authentication based on a Somewhat Homomorphic Encryption (SHE) scheme, modified to handle integer values, and also suggest a blinding method to protect the system from spoofing attacks. Although our solution is not as efficient as the ones based on GC or HE, the protocol needs no interaction, moving the computation entirely on the server side and leaving only inputs encryption and outputs decryption to the client

Information Theoretical Analysis of the Uniqueness of Iris Biometrics

With the rapid globalization of technology in the world, the need for a more reliable and secure online method of authentication is required. This can be achieved by using each individual’s distinctive biometric identifiers, such as the face, iris, fingerprint, palmprint, etc.; however, there is a bound to the uniqueness of each identifier and consequently, a limit to the capacity that a biometric recognition system can sustain before false matches occur. Therefore, knowing the limitations on the maximum population that a biometric modality can uniquely represent is essential now more than ever. In an effort to address the general problem, we turn to the use of iris biometrics to measure its uniqueness. The measure of iris uniqueness was first introduced by John Daugman in 2003 and its analysis since then remained an open research problem. Daugman defines uniqueness as the ability to enroll more and more classes into a recognition system while the probability of collision among the classes remains fixed and near zero. Due to errors while collecting these datasets (such as occlusions, illumination conditions, camera noise, motion, and out-of-focus blur) and quality degradation from any signal processing of the iris data, even the highest in-quality datasets will not approach a perfect zero probability of collision. Because of this, we appeal to techniques presented in information theory to analyze and find the maximum possible population the system can support while also measuring the quality of the iris data present in the datasets themselves. The focus of this work is divided into two new techniques to find the maximum population of an iris database: finding the limitations of Daugman\u27s widely accepted IrisCode and proposing a new methodology leveraging the raw iris data. Firstly, Daugman\u27s IrisCode is defined as binary templates representing each independent class present in the database. Through the assumption that a one-to-one encoding technique is available to map the IrisCode of each class to a new binary codeword with the length determined by the degrees of freedom inferred from the distribution of distances between each pair of independent class IrisCodes, we can appeal to Rate-Distortion Theory (limits of error-correcting codes) to establish bounds on the maximum population the IrisCode algorithm can sustain using the minimum Hamming distance (HD) between codewords as a quality metric. Our second approach leverages an Autoregressive (AR) model to estimate each iris class\u27s distinctive power spectral densities and then assume a similar one-to-one mapping of each iris class to a unique Gaussian codeword. A Gaussian Sphere Packing Bound is invoked to realize the maximum population of the dataset and measure the iris quality dependent on the noise present in the data. Another bound, the Daugman-like Bound, is developed that uses the relative entropy between models of classes as a distance metric, like Hamming distance, to find the maximum population given a fixed recognition error for the system. Using these two approaches, we hope to help researchers understand the limitations present in their recognition system depending on the quality of their iris database

An anatomy of IrisCode for precise phase representation

Author name used in this publication: Adams KongAuthor name used in this publication: David ZhangBiometrics Research Centre, Department of ComputingRefereed conference paper2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Gender-From-Iris or Gender-From-Mascara?

Predicting a person's gender based on the iris texture has been explored by several researchers. This paper considers several dimensions of experimental work on this problem, including person-disjoint train and test, and the effect of cosmetics on eyelash occlusion and imperfect segmentation. We also consider the use of multi-layer perceptron and convolutional neural networks as classifiers, comparing the use of data-driven and hand-crafted features. Our results suggest that the gender-from-iris problem is more difficult than has so far been appreciated. Estimating accuracy using a mean of N person-disjoint train and test partitions, and considering the effect of makeup - a combination of experimental conditions not present in any previous work - we find a much weaker ability to predict gender-from-iris texture than has been suggested in previous work

Iris Recognition in Multiple Spectral Bands: From Visible to Short Wave Infrared

The human iris is traditionally imaged in Near Infrared (NIR) wavelengths (700nm-900nm) for iris recognition. The absorption co-efficient of color inducing pigment in iris, called Melanin, decreases after 700nm thus minimizing its effect when iris is imaged at wavelengths greater than 700nm. This thesis provides an overview and explores the efficacy of iris recognition at different wavelength bands ranging from visible spectrum (450nm-700nm) to NIR (700nm-900nm) and Short Wave Infrared (900nm-1600nm). Different matching methods are investigated at different wavelength bands to facilitate cross-spectral iris recognition.;The iris recognition analysis in visible wavelengths provides a baseline performance when iris is captured using common digital cameras. A novel blob-based matching algorithm is proposed to match RGB (visible spectrum) iris images. This technique generates a match score based on the similarity between blob like structures in the iris images. The matching performance of the blob based matching method is compared against that of classical \u27Iris Code\u27 matching method, SIFT-based matching method and simple correlation matching, and results indicate that the blob-based matching method performs reasonably well. Additional experiments on the datasets show that the iris images can be matched with higher confidence for light colored irides than dark colored irides in the visible spectrum.;As part of the analysis in the NIR spectrum, iris images captured in visible spectrum are matched against those captured in the NIR spectrum. Experimental results on the WVU multispectral dataset show promise in achieving a good recognition performance when the images are captured using the same sensor under the same illumination conditions and at the same resolution. A new proprietary \u27FaceIris\u27 dataset is used to investigate the ability to match iris images from a high resolution face image in visible spectrum against an iris image acquired in NIR spectrum. Matching in \u27FaceIris\u27 dataset presents a scenario where the two images to be matched are obtained by different sensors at different wavelengths, at different ambient illumination and at different resolution. Cross-spectral matching on the \u27FaceIris\u27 dataset presented a challenge to achieve good performance. Also, the effect of the choice of the radial and angular parameters of the normalized iris image on matching performance is presented. The experiments on WVU multispectral dataset resulted in good separation between genuine and impostor score distributions for cross-spectral matching which indicates that iris images in obtained in visible spectrum can be successfully matched against NIR iris images using \u27IrisCode\u27 method.;Iris is also analyzed in the Short Wave Infrared (SWIR) spectrum to study the feasibility of performing iris recognition at these wavelengths. An image acquisition setup was designed to capture the iris at 100nm interval spectral bands ranging from 950nm to 1650nm. Iris images are analyzed at these wavelengths and various observations regarding the brightness, contrast and textural content are discussed. Cross-spectral and intra-spectral matching was carried out on the samples collected from 25 subjects. Experimental results on this small dataset show the possibility of performing iris recognition in 950nm-1350nm wavelength range. Fusion of match scores from intra-spectral matching at different wavelength bands is shown to improve matching performance in the SWIR domain

Feature-domain super-resolution framework for Gabor-based face and iris recognition

The low resolution of images has been one of the major limitations in recognising humans from a distance using their biometric traits, such as face and iris. Superresolution has been employed to improve the resolution and the recognition performance simultaneously, however the majority of techniques employed operate in the pixel domain, such that the biometric feature vectors are extracted from a super-resolved input image. Feature-domain superresolution has been proposed for face and iris, and is shown to further improve recognition performance by capitalising on direct super-resolving the features which are used for recognition. However, current feature-domain superresolution approaches are limited to simple linear features such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which are not the most discriminant features for biometrics. Gabor-based features have been shown to be one of the most discriminant features for biometrics including face and iris. This paper proposes a framework to conduct super-resolution in the non-linear Gabor feature domain to further improve the recognition performance of biometric systems. Experiments have confirmed the validity of the proposed approach, demonstrating superior performance to existing linear approaches for both face and iris biometrics