Compact and Cancelable Fingerprint Binary Codes Generation via One Permutation Hashing

Representing fingerprint templates in binary form can provide outstanding merits compared to the conventional minutiae-based fingerprint recognition system. The existing fixed-length fingerprint feature extraction methods either suffer from redundant feature magnitude or lack of template security. In this letter, we present a compact (128 bytes) and cancelable fingerprint binary codes generation scheme which enables accurate and efficient comparison as well as high security. This binary representation is also available for advanced encryption schemes (e.g., fuzzy commitment). Specifically, a kernel learning-based real-valued fingerprint feature is converted into compact and cancelable binary code via one permutation hashing. A partial Haar transform is deployed to further strengthen the irreversibility of the whole system. Experimental results on six benchmark datasets FVC2002 and FVC2004 coupled with security analysis demonstrate the superiority of the proposed method compared with several state-of-the-arts.