Kernel PCA enabled bit-string representation for minutiae-based cancellable fingerprint template. (March 2016)

• Record Type: Journal Article
• Authors: Wong, Wei Jing; Teoh, Andrew B.J.; Kho, Yau Hee; Wong, M.L. Dennis
• Is Part Of: Pattern recognition. Volume 51(2016:Mar.)
• Page Start: 197
• Page End: 208
• Publication Date: 2016-03
• Subjects: Cancellable fingerprint -- Multi-line code (MLC) -- Kernel principal components analysis (KPCA) -- Fixed-length representation; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2015.09.032
• Languages: English
• ISSNs: 0031-3203

Abstract

Abstract: Minutiae set is one of the prevalent features used to represent a fingerprint. Many minutiae protection schemes have been proposed in recent literature, but only a few have demonstrated successful conversion from minutiae set to fixed-length bit-string. In this paper, we develop a fixed-length binary cancellable fingerprint template generation scheme based on a minutia descriptor known as the multi-line code (MLC). While retaining the core of MLC algorithm, we transform the unordered and variable-size MLC template into an ordered and fixed-length bit-string using kernel principal components analysis (KPCA) and state-of-the-art binarization techniques. The construction of a proper kernel suited for the scenario was validated using Mercer׳s Theorem. Evaluation of the proposed scheme was performed over several FVC datasets and the best equal-error rate (EER) obtained for the final bit-string is 1.61%. In addition, extensive analysis was done to justify the non-invertibility and revocability property of the cancellable template. Abstract : Highlights: A fixed-length binary representation of fingerprint using kernel PCA is proposed. Performance after applying KPCA drops slightly. Performance of the final bit-string is excellent, achieving average EER of 0.09%. The method is strong against inverse and linkage attacks but not masquerade attack. The computational complexity of the proposed scheme is high.