Gait Verification using Knee Acceleration Signals

A novel gait recognition method for biometric applications is proposed. The approach has the following distinct features. First, gait patterns are determined via knee acceleration signals, circumventing difficulties associated with conventional vision-based gait recognition methods. Second, an automatic procedure to extract gait features from acceleration signals is developed that employs a multiple-template classification method. Consequently, the proposed approach can adjust the sensitivity and specificity of the gait recognition system with great flexibility. Experimental results from 35 subjects demonstrate the potential of the approach for successful recognition. By setting sensitivity to be 0.95 and 0.90, the resulting specificity ranges from 1 to 0.783 and 1.00 to 0.945, respectively

Literature review of image compression effects on face recognition

In this research work, a literature review is conducted to assess the progress made in the field of image compression effects on the face recognition. The DCT algorithms are considered for the review and their application is limited only to JPEG compression. In this review, progress made in the DCT algorithms of a single image, and a series images from a video, namely 2D DCT and 3D DCT respectively, along with several other algorithms in the application of face recognition are discussed in detail.&nbsp

Adaptive noise reduction and code matching for IRIS pattern recognition system

Among all biometric modalities, iris is becoming more popular due to its high performance in recognizing or verifying individuals. Iris recognition has been used in numerous fields such as authentications at prisons, airports, banks and healthcare. Although iris recognition system has high accuracy with very low false acceptance rate, the system performance can still be affected by noise. Very low intensity value of eyelash pixels or high intensity values of eyelids and light reflection pixels cause inappropriate threshold values, and therefore, degrade the accuracy of system. To reduce the effects of noise and improve the accuracy of an iris recognition system, a robust algorithm consisting of two main components is proposed. First, an Adaptive Fuzzy Switching Noise Reduction (AFSNR) filter is proposed. This filter is able to reduce the effects of noise with different densities by employing fuzzy switching between adaptive median filter and filling method. Next, an Adaptive Weighted Shifting Hamming Distance (AWSHD) is proposed which improves the performance of iris code matching stage and level of decidability of the system. As a result, the proposed AFSNR filter with its adaptive window size successfully reduces the effects ofdifferent types of noise with different densities. By applying the proposed AWSHD, the distance corresponding to a genuine user is reduced, while the distance for impostors is increased. Consequently, the genuine user is more likely to be authenticated and the impostor is more likely to be rejected. Experimental results show that the proposed algorithm with genuine acceptance rate (GAR) of 99.98% and is accurate to enhance the performance of the iris recognition system

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