Search

The main role of cancellable biometric schemes is to protect the privacy of the enrolled users. The protected biometric data are generated by applying a parametrized transformation function to the original biometric data. Although cancellable biometric schemes achieve high security levels, they may degrade the recognition accuracy. One of the mostwidely used approaches to enhance the recognition accuracy in biometric systems is to combine several instances of the same biometric modality. In this paper, two multi-instance cancellable biometric schemes based on iris traits are presented. The iris biometric trait is used in both schemes because of the reliability and stability of iris traits compared to the other biometric traits. A generative adversarial network (GAN) is used as a transformation function for the biometric features. The first scheme is based on a pre-transformation feature-level fusion, where the binary features of multiple instances are concatenated and inputted to the transformation phase. On the other hand, the second scheme is based on a post-transformation feature-level fusion, where each instance is separately inputted to the transformation phase. Experiments conducted on the CASIA Iris-V3-Internal database confirm the high recognition accuracy of the two proposed schemes. Moreover, the security of the proposed schemes is analyzed, and their robustness against two well-known types of attacks is proven. [ABSTRACT FROM AUTHOR]

Feature transformation methods can be used effectively to improve the performance of the machine learning techniques, such as classification and clustering, via enhancing the discrimination among the samples. Additionally, binary representation of features may be necessary in several circumstances. For example, distributed systems may have limited bandwidth, storage, and energy that necessitate rough quantization of the measurements. This paper proposes a random projection-based feature transformation method that maps the data points from the original space into a new binary space. In the proposed transformation method, the random projection process is formulated as an optimization problem. A modified chaotic version of the sine–cosine algorithm is used to find the optimal random projector. The performance of the proposed transformation method is validated using 15 standard UCI benchmark datasets against the linear discernment analysis. Moreover, it is compared to other metaheuristic-based feature reduction methods including the gray wolf optimizer, the genetic algorithm, and the antlion optimizer. The obtained results assure the superiority of the proposed transformation method in terms of classification accuracy and storage requirements. [ABSTRACT FROM AUTHOR]