Palmprint Identification Based on Generalization of IrisCode

The development of accurate and reliable security systems is a matter of wide interest, and in this context biometrics is seen as a highly effective automatic mechanism for personal identification. Among biometric technologies, IrisCode developed by Daugman in 1993 is regarded as a highly accurate approach, being able to support real-time personal identification of large databases. Since 1993, on the top of IrisCode, different coding methods have been proposed for iris and fingerprint identification. In this research, I extend and generalize IrisCode for real-time secure palmprint identification. PalmCode, the first coding method for palmprint identification developed by me in 2002, directly applied IrisCode to extract phase information of palmprints as features. However, I observe that the PalmCodes from the different palms are similar, having many 45o streaks. Such structural similarities in the PalmCodes of different palms would reduce the individuality of PalmCodes and the performance of palmprint identification systems. To reduce the correlation between PalmCodes, in this thesis, I employ multiple elliptical Gabor filters with different orientations to compute different PalmCodes and merge them to produce a single feature, called Fusion Code. Experimental results demonstrate that Fusion Code performs better than PalmCode. Based on the results of Fusion Code, I further identify that the orientation fields of palmprints are powerful features. Consequently, Competitive Code, which uses real parts of six Gabor filters to estimate the orientation fields, is developed. To embed the properties of IrisCode, such as high speed matching, in Competitive Code, a novel coding scheme and a bitwise angular distance are proposed. Experimental results demonstrate that Competitive Code is much more effective than other palmprint algorithms. Although many coding methods have been developed based on IrisCode for iris and palmprint identification, we lack a detailed analysis of IrisCode. One of the aims of this research is to provide such analysis as a way of better understanding IrisCode, extending the coarse phase representation to a precise phase representation, and uncovering the relationship between IrisCode and other coding methods. This analysis demonstrates that IrisCode is a clustering process with four prototypes; the locus of a Gabor function is a two-dimensional ellipse with respect to a phase parameter and the bitwise hamming distance can be regarded as a bitwise angular distance. In this analysis, I also point out that the theoretical evidence of the imposter binomial distribution of IrisCode is incomplete. I use this analysis to develop a precise phase representation which can enhance iris recognition accuracy and to relate IrisCode and other coding methods. By making use of this analysis, principal component analysis and simulated annealing, near optimal filters for palmprint identification are sought. The near optimal filters perform better than Competitive Code in term of d’ index. Identical twins having the closest genetics-based relationship are expected to have maximum similarity in their biometrics. Classifying identical twins is a challenging problem for some automatic biometric systems. Palmprint has been studied for personal identification for many years. However, genetically identical palmprints have not been studied. I systemically examine Competitive Code on genetically identical palmprints for automatic personal identification and to uncover the genetically related palmprint features. The experimental results show that the three principal lines and some portions of weak lines are genetically related features but our palms still contain rich genetically unrelated features for classifying identical twins. As biometric systems are vulnerable to replay, database and brute-force attacks, such potential attacks must be analyzed before they are massively deployed in security systems. I propose projected multinomial distribution for studying the probability of successfully using brute-force attacks to break into a palmprint system based on Competitive Code. The proposed model indicates that it is computationally infeasible to break into the palmprint system using brute-force attacks. In addition to brute-force attacks, I address the other three security issues: template re-issuances, also called cancellable biometrics, replay attacks, and database attacks. A random orientation filter bank (ROFB) is used to generate cancellable Competitive Codes for templates re-issuances. Secret messages are hidden in templates to prevent replay and database attacks. This technique can be regarded as template watermarking. A series of analyses is provided to evaluate the security levels of the measures

Palmprint Identification Based on Generalization of IrisCode

The development of accurate and reliable security systems is a matter of wide interest, and in this context biometrics is seen as a highly effective automatic mechanism for personal identification. Among biometric technologies, IrisCode developed by Daugman in 1993 is regarded as a highly accurate approach, being able to support real-time personal identification of large databases. Since 1993, on the top of IrisCode, different coding methods have been proposed for iris and fingerprint identification. In this research, I extend and generalize IrisCode for real-time secure palmprint identification. PalmCode, the first coding method for palmprint identification developed by me in 2002, directly applied IrisCode to extract phase information of palmprints as features. However, I observe that the PalmCodes from the different palms are similar, having many 45o streaks. Such structural similarities in the PalmCodes of different palms would reduce the individuality of PalmCodes and the performance of palmprint identification systems. To reduce the correlation between PalmCodes, in this thesis, I employ multiple elliptical Gabor filters with different orientations to compute different PalmCodes and merge them to produce a single feature, called Fusion Code. Experimental results demonstrate that Fusion Code performs better than PalmCode. Based on the results of Fusion Code, I further identify that the orientation fields of palmprints are powerful features. Consequently, Competitive Code, which uses real parts of six Gabor filters to estimate the orientation fields, is developed. To embed the properties of IrisCode, such as high speed matching, in Competitive Code, a novel coding scheme and a bitwise angular distance are proposed. Experimental results demonstrate that Competitive Code is much more effective than other palmprint algorithms. Although many coding methods have been developed based on IrisCode for iris and palmprint identification, we lack a detailed analysis of IrisCode. One of the aims of this research is to provide such analysis as a way of better understanding IrisCode, extending the coarse phase representation to a precise phase representation, and uncovering the relationship between IrisCode and other coding methods. This analysis demonstrates that IrisCode is a clustering process with four prototypes; the locus of a Gabor function is a two-dimensional ellipse with respect to a phase parameter and the bitwise hamming distance can be regarded as a bitwise angular distance. In this analysis, I also point out that the theoretical evidence of the imposter binomial distribution of IrisCode is incomplete. I use this analysis to develop a precise phase representation which can enhance iris recognition accuracy and to relate IrisCode and other coding methods. By making use of this analysis, principal component analysis and simulated annealing, near optimal filters for palmprint identification are sought. The near optimal filters perform better than Competitive Code in term of d’ index. Identical twins having the closest genetics-based relationship are expected to have maximum similarity in their biometrics. Classifying identical twins is a challenging problem for some automatic biometric systems. Palmprint has been studied for personal identification for many years. However, genetically identical palmprints have not been studied. I systemically examine Competitive Code on genetically identical palmprints for automatic personal identification and to uncover the genetically related palmprint features. The experimental results show that the three principal lines and some portions of weak lines are genetically related features but our palms still contain rich genetically unrelated features for classifying identical twins. As biometric systems are vulnerable to replay, database and brute-force attacks, such potential attacks must be analyzed before they are massively deployed in security systems. I propose projected multinomial distribution for studying the probability of successfully using brute-force attacks to break into a palmprint system based on Competitive Code. The proposed model indicates that it is computationally infeasible to break into the palmprint system using brute-force attacks. In addition to brute-force attacks, I address the other three security issues: template re-issuances, also called cancellable biometrics, replay attacks, and database attacks. A random orientation filter bank (ROFB) is used to generate cancellable Competitive Codes for templates re-issuances. Secret messages are hidden in templates to prevent replay and database attacks. This technique can be regarded as template watermarking. A series of analyses is provided to evaluate the security levels of the measures

Composite Fixed-Length Ordered Features for Palmprint Template Protection with Diminished Performance Loss

Palmprint recognition has become more and more popular due to its advantages over other biometric modalities such as fingerprint, in that it is larger in area, richer in information and able to work at a distance. However, the issue of palmprint privacy and security (especially palmprint template protection) remains under-studied. Among the very few research works, most of them only use the directional and orientation features of the palmprint with transformation processing, yielding unsatisfactory protection and identification performance. Thus, this paper proposes a palmprint template protection-oriented operator that has a fixed length and is ordered in nature, by fusing point features and orientation features. Firstly, double orientations are extracted with more accuracy based on MFRAT. Then key points of SURF are extracted and converted to be fixed-length and ordered features. Finally, composite features that fuse up the double orientations and SURF points are transformed using the irreversible transformation of IOM to generate the revocable palmprint template. Experiments show that the EER after irreversible transformation on the PolyU and CASIA databases are 0.17% and 0.19% respectively, and the absolute precision loss is 0.08% and 0.07%, respectively, which proves the advantage of our method

Multi-spectral palmprint recognition based on oriented multiscale log-Gabor filters

Among several palmprint recognition methods proposed recently, coding-based approaches using multi-spectral palmprint images are attractive owing to their high recognition rates. Aiming to further improve the performance of these approaches, this paper presents a novel multi-spectral palmprint recognition approach based on oriented multiscale log-Gabor filters. The proposed method aims to enhance the recognition performances by proposing novel solutions at three stages of the recognition process. Inspired by the bitwise competitive coding, the feature extraction employs a multi-resolution log-Gabor filtering where the final feature map is composed of the winning codes of the lowest filters’ bank response. The matching process employs a bitwise Hamming distance and Kullback–Leibler divergence as novel metrics to enable an efficient capture of the intra- and inter-similarities between palmprint feature maps. Finally, the decision stage is carried pout using a fusion of the scores generated from different spectral bands to reduce overlapping. In addition, a fusion of the feature maps through two proposed novel feature fusion techniques to allow us to eliminate the inherent redundancy of the features of neighboring spectral bands is also proposed. The experimental results obtained using the multi-spectral palmprint database MS-PolyU have shown that the proposed method achieves high accuracy in mono-spectral and multi-spectral recognition performances for both verification and identification modes; and also outperforms the state-of-the-art methods

Multi-spectral palmprint recognition based on oriented multiscale log-Gabor filters

Among several palmprint recognition methods proposed recently, coding-based approaches using multi-spectral palmprint images are attractive owing to their high recognition rates. Aiming to further improve the performance of these approaches, this paper presents a novel multi-spectral palmprint recognition approach based on oriented multiscale log-Gabor filters. The proposed method aims to enhance the recognition performances by proposing novel solutions at three stages of the recognition process. Inspired by the bitwise competitive coding, the feature extraction employs a multi-resolution log-Gabor filtering where the final feature map is composed of the winning codes of the lowest filters’ bank response. The matching process employs a bitwise Hamming distance and Kullback–Leibler divergence as novel metrics to enable an efficient capture of the intra- and inter-similarities between palmprint feature maps. Finally, the decision stage is carried pout using a fusion of the scores generated from different spectral bands to reduce overlapping. In addition, a fusion of the feature maps through two proposed novel feature fusion techniques to allow us to eliminate the inherent redundancy of the features of neighboring spectral bands is also proposed. The experimental results obtained using the multi-spectral palmprint database MS-PolyU have shown that the proposed method achieves high accuracy in mono-spectral and multi-spectral recognition performances for both verification and identification modes; and also outperforms the state-of-the-art methods

A PIPELINED APPROACH FOR FPGA IMPLEMENTATION OF BI MODAL BIOMETRIC PATTERN RECOGNITION

ABSTRACT A Biometric system is essentially a pattern recognition system that makes use of biometric traits to recognize individuals. Systems which are built upon multiple sources of information for establishing identity which are known as multimodal biometric systems can overcome some of the limitations like noisy captured data, intra class variations etc… In this paper a Bi modal biometric system of iris and palm print based on Wavelet Packet Transform (WPT), gabor filters and a neural classifier implemented in FPGA is described. Iris is the unique observable visible feature present in the detailed texture of each eye. Palmprint is referred to the textural data like principal lines wrinkles and ridges present in the palm. The visible texture of a person's iris and palm print is encoded into a compact sequence of 2-D wavelet packet coefficients constituting a biometric signature or a feature vector code. In this paper, a novel multi-resolution approach based on WPT for recognition of iris and palmprint is proposed. With an adaptive threshold, WPT sub image coefficients are quantized into 1, 0 or -1 as biometric signature resulting in the size of biometric signature as 960 bits. The combined pattern vector of palm print features and iris features are formed using fusion at feature level and applied to the pattern classifier. The Learning Vector Quantization neural network is used as pattern classifier and a recognition rate of 97.22% is obtained. A part of the neural network is implemented for input data of 16 dimensions and 12 input classes and 8 output classes, using virtex-4 xc4vlx15 device. This system can complete recognition in 3.25 microseconds thus enabling it being suitable for real time pattern recognition tasks

Biometric recognition based on the texture along palmprint lines

Tese de Mestrado Integrado. Bioengenharia. Faculdade de Engenharia. Universidade do Porto. 201