Cancelable fingerprint templates using minutiae-based bit-strings |
| |
| Affiliation: | 1. Jongno Technology Appraisal Center, Kibo Technology Fund, #22F, Samil Building, 10-2, GwanCheol-Dong, Jongno-Goo, Seoul, Republic of Korea;2. School of Electrical and Electronic Engineering, Yonsei University, Biometrics Engineering Research Center (BERC), Republic of Korea;1. Center of Excellence in Information Assurance (CoEIA), King Saud University, Riyadh, Kingdom of Saudi Arabia;2. Department of Electrical & Computer Engineering, University of Waterloo, Canada;3. School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore;1. School of Computer Science and Engineering, Nanjing University of Science and Technology, China;2. Key Laboratory of Trusted Cloud Computing and Big Data Analysis, Nanjing Xiaozhuang University, China;1. Bengal Engineering and Science University, Shibpur, P.O. Botanic Garden, Howrah 711 103, India;2. Department of Electronics Communication Engineering, College of Engineering and Management, Kolaghat, P.O. KTPP Township, Midnapur (East) 721 171, India;3. Laboratoire des Signaux et Systemes, CNRS, Universite Paris-Sud, Supélec – 3, rue Joliot-Curie 91192, France |
| |
| Abstract: | It has become critical to protect biometric templates in the current biometric community. One way for doing this is using a cancelable biometric method, which transforms original biometric templates in a non-invertible way and uses those transformed templates to verify a person's identity. In this paper, we propose a new method to generate cancelable bit-strings (templates) from fingerprint minutiae. Our method is to provide a simple mean to generate cancelable templates without requiring for pre-alignment of fingerprints. The main idea is to map the minutiae into a predefined 3 dimensional array which consist of small cells and find out which cells include minutiae. To do this, we choose one of minutiae as a reference minutia and other minutiae are translated and rotated in order to map the minutiae into the cells based on the position and orientation of the reference minutia. After mapping, we set the cells in the 3D array to 1 if they include more than one minutia otherwise the cells are set to 0. A 1D bit-string is generated by sequentially visiting the cells in the 3D array. The order of the 1D bit-string is permuted according to the type of reference minutiae and user's PIN so that we can regenerate new templates when we need them. Finally, cancelable bit-strings are generated by changing the reference minutia into another minutia in turn. In the experiments, we evaluate our method using the FVC2004 database and show that the performance is better than that of a previous method. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
