Generating a Cancellable Fingerprint using Matrices Operations and Its Fingerprint Processing Requirements


  •  Riki Mukhaiyar    

Abstract

Cancellable fingerprint uses transformed or intentionally distorted biometric data instead of the original biometric data for identifying person. When a set of biometric data is found to be compromised, they can be discarded, and a new set of biometric data can be regenerated. This initial principal is identical with a non-invertible concept in matrices operations. In matrix domain, a matrix cannot be transformed into its original form if it meets several requirements such as non-square form matrix, consist of one zero row/column, and no row as multiple of another row. These conditions can be acquired by implementing three matrix operations using Kronecker Product (KP) operation, Elementary Row Operation (ERO), and Inverse Matrix (INV) operation. KP is useful to produce a non-square form matrix, to enlarge the size of matrix, to distinguish and disguise the element of matrix by multiplying each of elements of the matrix with a particular matrix. ERO can be defined as multiplication and addition force to matrix rows. INV is utilized to transform one matrix to another one with a different element or form as a reciprocal matrix of the original. These three matrix operations should be implemented together in generating the cancellable feature to robust image. So, if once three conditions are met by imposter, it is impossible to find the original image of the fingerprint. The initial aim of these operations is to camouflage the original look of the fingerprint feature into an abstract-look to deceive an un-authorized personal using the fingerprint irresponsibly. In this research, several fingerprint processing steps such as fingerprint pre-processing, core-point identification, region of interest, minutiae extration, etc; are determined to improve the quality of the cancellable feature. Three different databases i.e. FVC2002, FVC2004, and BRC are utilized in this work.



This work is licensed under a Creative Commons Attribution 4.0 License.