On Mixing Fingerprints

Similar documents
MIXING FINGERPRINTS FOR TEMPLATE SECURITY AND PRIVACY. Arun Ross and Asem Othman

Combined Fingerprint Minutiae Template Generation

Ujma A. Mulla 1 1 PG Student of Electronics Department of, B.I.G.C.E., Solapur, Maharashtra, India. IJRASET: All Rights are Reserved

Published by: PIONEER RESEARCH & DEVELOPMENT GROUP ( 1

Generation of Combined Minutiae Template for Enrollment and Fingerprint Authentication

Robust biometric image watermarking for fingerprint and face template protection

Providing Authentication by Merging Minutiae Template.

FM Model Based Fingerprint Reconstruction from Minutiae Template

Fingerprint Image Enhancement and Mixing Fingerprints for Protecting Privacy Ria Mathews 1 Bino Thomas 2

A Review on Security of Fingerprint Template Using Fingerprint Mixing

Fingerprint + Iris = IrisPrint

Indexing Fingerprints using Minutiae Quadruplets

Quality Based Rank-Level Fusion in Multibiometric Systems

Local Correlation-based Fingerprint Matching

Multimodal Biometric Authentication using Face and Fingerprint

Finger Print Enhancement Using Minutiae Based Algorithm

Outline. Incorporating Biometric Quality In Multi-Biometrics FUSION. Results. Motivation. Image Quality: The FVC Experience

Reference Point Detection for Arch Type Fingerprints

Image Enhancement Techniques for Fingerprint Identification

Fingerprint Matching using Gabor Filters

Separation of Overlapped Fingerprints for Forensic Applications

A new approach to reference point location in fingerprint recognition

Stegano-CryptoSystem for Enhancing Biometric-Feature Security with RSA

Fingerprint Indexing using Minutiae and Pore Features

Development of an Automated Fingerprint Verification System

Adaptive Fingerprint Image Enhancement with Minutiae Extraction

OPTIMIZED DUAL FINGERPRINT MECHANISM FOR PRIVACY PROTECTION

AN EFFICIENT BINARIZATION TECHNIQUE FOR FINGERPRINT IMAGES S. B. SRIDEVI M.Tech., Department of ECE

Feature Level Fusion of Multibiometric Cryptosystem in Distributed System

CRIMINAL IDENTIFICATION USING PARTIAL FINGERPRINT RECONSTRUCTION METHOD

Mahmood Fathy Computer Engineering Department Iran University of science and technology Tehran, Iran

A Coding Scheme for Indexing Multimodal Biometric Databases

Reconstructing Ridge Frequency Map from Minutiae Template of Fingerprints

Abstract -Fingerprints are the most widely. Keywords:fingerprint; ridge pattern; biometric;

Improving Latent Fingerprint Matching Performance by Orientation Field Estimation using Localized Dictionaries

Comparison of fingerprint enhancement techniques through Mean Square Error and Peak-Signal to Noise Ratio

Keywords Wavelet decomposition, SIFT, Unibiometrics, Multibiometrics, Histogram Equalization.

Implementation of Fingerprint Matching Algorithm

BIOMET: A Multimodal Biometric Authentication System for Person Identification and Verification using Fingerprint and Face Recognition

Secure Fingerprint Matching with External Registration

Online and Offline Fingerprint Template Update Using Minutiae: An Experimental Comparison

Fingerprint Image Enhancement Algorithm and Performance Evaluation

Incorporating Image Quality in Multi-Algorithm Fingerprint Verification

Exploiting the Doddington Zoo Effect in Biometric Fusion

FINGERPRINT MATCHING BASED ON STATISTICAL TEXTURE FEATURES

Minutiae Based Fingerprint Authentication System

Filterbank-Based Fingerprint Matching. Multimedia Systems Project. Niveditha Amarnath Samir Shah

Fingerprint Ridge Orientation Estimation Using A Modified Canny Edge Detection Mask

Efficient Rectification of Malformation Fingerprints

Hiding Fingerprint Minutiae in Images

Secure and Private Identification through Biometric Systems

Biometric Security System Using Palm print

Using Support Vector Machines to Eliminate False Minutiae Matches during Fingerprint Verification

Latent Fingerprint Matching Using Descriptor-Based Hough Transform

A comparative study on feature extraction for fingerprint classification and performance improvements using rank-level fusion

International Journal of Advanced Research in Computer Science and Software Engineering

ISSN Vol.04,Issue.08, July-2016, Pages:

Fingerprint Classification Using Orientation Field Flow Curves

FINGERPRINTING is one of the most widely used biometric

A New Enhancement Of Fingerprint Classification For The Damaged Fingerprint With Adaptive Features

Towards Reconstructing Fingerprints From Minutiae Points

This is the published version:

Fingerprint Mosaicking by Rolling with Sliding

Logical Templates for Feature Extraction in Fingerprint Images

Call for participation. FVC2004: Fingerprint Verification Competition 2004

A Novel Technique in Fingerprint Identification using Relaxation labelling and Gabor Filtering

K-Nearest Neighbor Classification Approach for Face and Fingerprint at Feature Level Fusion

Fingerprint Matching Incorporating Ridge Features Using Contourlet Transforms

IRIS SEGMENTATION OF NON-IDEAL IMAGES

FVC2004: Third Fingerprint Verification Competition

Multimodal Biometric System by Feature Level Fusion of Palmprint and Fingerprint

An Efficient on-line Signature Verification System Using Histogram Features

Fingerprint Verification System using Minutiae Extraction Technique

Fingerprint Matching Using Minutiae Feature Hardikkumar V. Patel, Kalpesh Jadav

AN AVERGE BASED ORIENTATION FIELD ESTIMATION METHOD FOR LATENT FINGER PRINT MATCHING.

Fingerprint Image Synthesis based on Statistical Feature Models

Detecting Fingerprint Distortion from a Single Image

Augmenting Ridge Curves with Minutiae Triplets for Fingerprint Indexing

Enhanced Iris Recognition System an Integrated Approach to Person Identification

Reducing FMR of Fingerprint Verification by Using the Partial Band of Similarity

ISSN Vol.04,Issue.15, October-2016, Pages:

A New Pairing Method for Latent and Rolled Finger Prints Matching

Cancelable Biometrics

A Novel Data Encryption Technique by Genetic Crossover of Robust Finger Print Based Key and Handwritten Signature Key

A NOVEL APPROACH FOR GENERATING FACE TEMPLATE USING BDA

CHAPTER 6 EFFICIENT TECHNIQUE TOWARDS THE AVOIDANCE OF REPLAY ATTACK USING LOW DISTORTION TRANSFORM

FILTERBANK-BASED FINGERPRINT MATCHING. Dinesh Kapoor(2005EET2920) Sachin Gajjar(2005EET3194) Himanshu Bhatnagar(2005EET3239)

Biometrics- Fingerprint Recognition

Verifying Fingerprint Match by Local Correlation Methods

Encryption of Text Using Fingerprints

VOL. 3, NO. 3, Mar-April 2013 ISSN ARPN Journal of Systems and Software AJSS Journal. All rights reserved

Segmentation and Enhancement of Latent Fingerprints: A Coarse to Fine Ridge Structure Dictionary. Kai Cao January 16, 2014

arxiv: v1 [cs.ai] 7 Aug 2017

DEFORMABLE MATCHING OF HAND SHAPES FOR USER VERIFICATION. Ani1 K. Jain and Nicolae Duta

Exploring Similarity Measures for Biometric Databases

Rotation Invariant Finger Vein Recognition *

SIGNIFICANT improvements in fingerprint recognition

Fingerprint Identification Using SIFT-Based Minutia Descriptors and Improved All Descriptor-Pair Matching

PCA AND CENSUS TRANSFORM BASED FINGERPRINT RECOGNITION WITH HIGH ACCEPTANCE RATIO

Graph Matching Iris Image Blocks with Local Binary Pattern

Transcription:

260 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 On Mixing Fingerprints Asem Othman and Arun Ross Abstract This work explores the possibility of mixing two different fingerprints, pertaining to two different fingers, at the image level in order to generate a new fingerprint. To mix two fingerprints, each fingerprint pattern is decomposed into two different components, viz., the continuous and spiral components. After prealigning the components of each fingerprint, the continuous component of one fingerprint is combined with the spiral component of the other fingerprint. Experiments on the West Virginia University (WVU) and FVC2002 datasets show that mixing fingerprints has several benefits: (a) it can be used to generate virtual identities from two different fingers; (b) it can be used to obscure the information present in an individual s fingerprint image prior to storing it in a central database; and (c) it can be used to generate a cancelable fingerprint template, i.e., the template can be reset if the mixed fingerprint is compromised. Index Terms Fingerprints, image level fusion, mixing biometrics, phase decomposition, privacy protection, virtual Identities. I. INTRODUCTION Image level fusion refers to the consolidation of (a) multiple samples of the same biometric trait obtained from different sensors or (b) multiple instances of the same biometric trait obtained using a single sensor, in order to generate a new image [1]. In the context of fingerprints, image-level fusion has been typically used to combine multiple impressions of the same finger [2]. In this paper, unlike previous work, two fingerprint impressions acquired from two different fingers are fused into a new fingerprint image resulting in a new identity 1. The mixed image incorporates characteristics from both the original fingerprint images, and can be used directly in the feature extraction and matching stages of an existing fingerprint recognition system. As shown in Fig. 1, the mixing process begins by decomposing each fingerprint image into two different components, viz., the continuous and spiral components. The continuous component defines the local ridge orientation, and the spiral component characterizes the minutiae locations. Next, the two components of each fingerprint are aligned to a common coordinate system. Finally, the continuous component of one fingerprint is combined with the spiral component of the other fingerprint. The major motivations behind the development of the proposed approach are discussed below. The proposed approach explores the possibility of fusing images from distinct fingers at the image level and determining how this will affect authentication performance. As in [3], the proposed approach could be used to mix the prints of the thumb and the index Manuscript received January 18, 2012; revised June 25, 2012; accepted September 07, 2012. Date of publication October 09, 2012; date of current version January 03, 2013. This work was supported by U.S. NSF CAREER Award Grant IIS 0642554. Preliminary versions of this work were presented at the EUSIPCO 2011 conference, Barcelona, Spain, August 2011 and the WIFS 2011 workshop, Foz do Iguacu, Brazil, November/December 2011. The associate editor coordinating the review of this manuscript and approving it for publication was Alex ChiChung Kot. The authors are with West Virginia University, Department of Computer Science and Electrical Engineering, Morgantown, WV 26505 USA (e-mail: asem. othman@mail.wvu.edu; arun.ross@mail.wvu.edu). Color versions of one or more of the figures in this paper are available online at http://ieeexplore.ieee.org. Digital Object Identifier 10.1109/TIFS.2012.2223676 1 Here, the term identity is used to suggest that the mixed fingerprint is unique and possibly different from other fingerprints. Fig. 1. Proposed approach for mixing fingerprints. fingers of a single individual, or index fingers of two different individuals in order to generate a new fingerprint. Therefore, the concept of mixing fingerprints could be utilized in a multifinger authentication system. This has benefits in terms of storage and security. Fingerprint mixing can be used to generate a large set of virtual identities. These virtual identities can be used to conceal the original identities of subjects or be used for large-scale evaluation of algorithms [2], [4]. De-identifying a fingerprint image is necessary to mitigate concerns related to data sharing and data misuse [5] [7]. Although conventional cryptographic systems provide numerous ways to secure important data/images, there are two main concerns for encrypting templates of fingerprints. First, the security of these algorithms relies on the assumption that the cryptographic keys are known only to the legitimate user. Maintaining the secrecy of keys is one of the main challenges in practical cryptosystems. Second, during every identification/verification attempt, the stored template has to be decrypted (exceptions include fingerprint cryptosystems where matching can be done in the encrypted domain but this affects matching performance). Thus, the original fingerprint template will be exposed to eavesdroppers. The stolen templates could be used to reconstruct the original fingerprint image [8] [11]; in other words, compromising a fingerprint template can result in permanent loss of a subject s biometric. Fingerprint mixing can be used to de-identify an input fingerprint image by fusing it with another fingerprint (e.g., a synthetic fingerprint) at image level, in order to produce a new mixed image that obscures the identity of the original fingerprint. In [12] and [13] a similar approach has been proposed to preserve the privacy of fingerprints by fusing two distinct fingers but only at the feature level. Our proposed approach creates a new entity that looks like a plausible fingerprint image and, thus, (a) it can be processed by conventional fingerprint algorithms and (b) an intruder cannot easily determine if a given print is mixed or not. Hence, the concept of fingerprint mixing can be utilized in the following example to enhance the privacy of a fingerprint recognition system. Consider a remote fingerprint system that maintains a small set of preselected auxiliary fingerprints,, corresponding to multiple fingers (each finger in is assumed to have multiple impressions). Suppose that subject offers the left index fingerprint,, during enrollment at a local machine. At that time, the local machine decomposes the fingerprint 1556-6013/$31.00 2012 IEEE

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 261 Fig. 2. Schematic protocol to protect the privacy of a fingerprint image by utilizing the proposed approach. into two components, i.e., the spiral component and the continuous component. To ensure the privacy of the fingerprint image in the local system, the remote system transmits the fingerprints in the auxiliary set and the local machine searches through the received fingerprints to locate a compatible fingerprint based on the continuous component of (see step (1) in Fig. 2), say (here the subscript denotes a specific finger in the auxiliary set), which is then decomposed and its continuous component mixed with the spiral component of at the local machine(seestep(2) in Fig. 2). The template of the new mixed print is enrolled in the remote system database and is discarded from the local machine (see step (3) in Fig. 2). During authentication, when the subject presents a sample of the left index finger,, it is decomposed and its continuous component is used to search through the fingerprints in the auxiliary set from the remote fingerprint system to determine the most compatible fingerprint, say. In the local machine, the spiral component of is mixed with the continuous component of to generate a mixed fingerprint, which is then compared against the database entry. The security protocol (illustrated in Fig. 2) ensures that during the enrollment or the authentication process, the identities of the users will not be revealed by the fingerprint system. Further, although the privacy of the input fingerprints is the main concern, the privacy of the stored auxiliary set, e.g.,, could be preserved by storing just the continuous components of the preselected fingerprints. This work confirms that (a) the mixed fingerprint representing a new identity can potentially be used for authentication; (b) the proposed method can be utilized to generate different-sized databases of virtual identities from a fixed fingerprint dataset; (c) the mixing process can be used to obscure the information present in an individual s fingerprint image prior to storing it in a central database; and (d) the mixed fingerprint can be used to generate a cancelable template, i.e., the template can be reset if the mixed fingerprint is compromised. Since the proposed approach can be used for de-identifying fingerprints, in this paper, a detailed analysis of the security aspects, i.e., the changeability and noninvertability properties of the approach has been included. This security analysis is based on metrics commonly used in the cancelable biometrics literature [14], [15]. The rest of the paper is organized as follows. Section II presents the proposed approach for mixing fingerprints. Section III reports the experimental results and Section IV concludes the paper. II. MIXING FINGERPRINTS: THE PROPOSED APPROACH The ridge flow of a fingerprint can be represented as a 2-D Amplitude and Frequency Modulated (AM-FM) signal [16]: where is the intensity of the original image at, is the intensity offset, is the amplitude, is the phase and is the noise. Based on the Helmholtz Decomposition Theorem [17], the phase can be uniquely decomposed into the continuous phase and the spiral phase,. As shown in Fig. 3, the cosine of the continuous phase, i.e., the continuous component,defines the local ridge orientation, and the cosine of the spiral phase, i.e., the spiral component, characterizes the minutiae locations. A. Fingerprint Decomposition Since ridges and minutiae can be completely determined by the phase [16], we are only interested in. The other three parameters in (1) contribute to the realistic textural appearance of the fingerprint. Before fingerprint decomposition, the phase must be reliably estimated; this is termed as demodulation. 1) Vortex Demodulation: The objective of vortex demodulation [18] is to extract the amplitude and phase of the fingerprint pattern. First, the DC term has to be removed since the failure to remove this offset correctly may introduce significant errors in the demodulated amplitude and phase [18]. To facilitate this, a normalized fingerprint image,, containing the enhanced ridge (1)

262 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 Fig. 3. Decomposing a fingerprint. (a) Fingerprint image. (b) Continuous component,. (c) Spiral component,. The blue and pink dots represent ridge endings and ridge bifurcations, respectively. pattern of the fingerprint (generated by the VeriFinger SDK 2 )isused. From (1),.The vortex demodulation operator takes the normalized image and applies a spiral phase Fourier multiplier : where, is the Fourier transform, is the inverse Fourier transform and is a 2-D signum function [18] defined as a pure spiral phase function in the spatial frequency space : Note that in (2) there is a new parameter,, representing the perpendicular direction of the ridges. In (4), this directional map is used to isolate the desired magnitude and phase from (2), i.e., Then, (4) can be combined with the normalized image,, to obtain the magnitude and the raw phase map as follows: Therefore, determining is essential for obtaining the amplitude and phase functions, and, respectively. The direction map can be derived from the orientation image of the fingerprint by a process called unwrapping. A sophisticated unwrapping technique using the topological properties of the ridge flow fields is necessary to account for direction singularities such as cores and deltas [10], [16]. 2) Direction Map : Direction isuniquely defined in the range 0 to360 (modulo ).Incontrast,fingerprintridgeorientationisindistinguishable from that of a 180 rotated ridge (modulo ). Therefore, the fingerprint s orientation map, denoted by, should be unwrapped to a direction map, [16]. Phase unwrapping is a technique used to address a phase jump in the orientation map. The unwrapping process adds or subtracts an offset of to successive pixels whenever a phase jump is detected [17]. This process starts at any pixel within the orientation image and uses the local orientation information to traverse the image pixel-by-pixel, and assigns a direction (i.e., the traversed direction) to each pixel with the condition that there are no discontinuities of between neighboring pixels. However, the presence of flow singularities means that there will be pixels in the orientation image with a discontinuity of in the traversed direction and, therefore, the above unwrapping technique will fail at such pixels. In fingerprint images, flow 2 http://www.neurotechnology.com (2) (3) (4) (5) singularities arise from the presence of singular points such as core and delta. Fig. 4(a) illustrates that estimating the direction of ridges in the vicinity of a core point by starting at any point within the highlighted rectangle and arbitrarily assigning one of two possible directions, can result in an inconsistency in the estimated directions inside the dashed circle. This inconsistency in the estimated direction map can be avoided by using a branch cut [17]. A branch cut is a line or a curve used to isolate the flow singularity and which cannot be crossed by the paths of the unwrapping process. Consequently, branch cut prevents the creation of discontinuities and restores the path independence of the unwrapping process. As shown in Fig. 4(b), tracing a line down from the core point and using this line as a barrier resolves the inconsistency near the core point (i.e., inside the dashed circle) by selecting two different directions on either side of the branch cut within the same region (i.e., inside the highlighted rectangle). In our work, a strategy based on the techniques described in [10], [16], [19] has been adapted to estimate the direction map, which is summarized in the following three steps. 1. Theorientation image of thenormalized fingerprint is determined via the least mean-square method [20]. Then the Poincaré [2] index is used to locate the singular points, if any. 2. In case there are singular points, an algorithm is applied to extract the branch cuts along suitable paths such as ridge contours, as shown in Fig. 4(b), to resolve the inevitable direction ambiguities near these singularities. The branch cuts are extracted by tracing the contours of ridges (rather than the orientation field) in the skeleton images. The algorithm starts from each singular point in a skeleton image and proceeds until the trace reaches the border of the segmented foreground region of the fingerprint or when it encounters another singular point. To generate the skeleton images, first, a set of smoothed orientation maps are generated by applying a Gaussian smoothing operation at different smoothing scales on.next,a set of Gabor filters, tuned to the smoothed orientation maps [20], is convolved with the normalized image. Then, a local adaptive thresholding and thinning algorithm [21] is applied to the directionally filtered images producing 10 skeleton images. Thus, there are at least 10 branch cuts and the shortest one, associated with each singular point, is selected. Fig. 5 shows two examples of skeleton images and the corresponding branch cuts of a core point. Fig. 6 shows examples of the branch cuts extracted from the singular points of different fingerprints. 3. Thephaseunwrappingalgorithm[17],[22]startsfromanyarbitrary pixel in the orientation map and visits the other pixels, which are unwrapped in the same manner as in images without singularity, with the exception here that the branch cuts cannot be crossed. Then, each branch cut is visited individually and its pixels are traced and unwrapped. Finally, the direction map is determined from the unwrapped by adding which allows for the determination of the amplitude and phase modulations of the fingerprint image from (5). A flowchart for demodulating a fingerprint image is depicted in Fig. 7. 3) Helmholtz Decomposition: The Helmholtz Decomposition Theorem [17] is used to decompose the determined phase of a fingerprint image into two phases. The first phase, is a continuous one, which can be unwrapped, and the second is a spiral phase,,which cannot be unwrapped but can be defined as a phase that exhibits spiral behavior at a set of discrete points in the image. The Bone s residue detector [17], [23] is first used to determine the spiral phase from the demodulated phase. Next the continuous phase is computed as. Finally, although subtracting the spiral phase from the phase should result in a continuous phase with no discontinuities, due to the inevitable quantization errors in the subtracting operation, it is essential to unwrap the continuous phase again

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 263 Fig. 4. Portion of the estimated direction map (a) before assigning a branch cut and (b) after assigning a branch cut [19]. Fig. 6. Examples of fingerprints with singular points (the blue dots and red triangle represent cores and delta, respectively). (a), (c), and (e) The normalized fingerprints. (b), (d), and (f) The extracted branch cuts obtained by tracing the ridges instead of the orientation field. Fig. 5. Examples of skeleton images and branch cuts for a singular point where (a) and (c) are skeleton images generated with and, respectively, and (b) and (d) are the corresponding branch cuts. Branch cut in (d) is the selected one. by using the branch cuts from the previous step. Fig. 8 illustrates the steps to determine the continuous component (Fig. 8(h)) from the estimated spiral component (Fig. 8(f)) and the demodulated phase (Fig. 8(a)). B. Fingerprint Prealignment To mix two different fingerprints after decomposing each fingerprint into its continuous component and spiral component,thefingerprints themselves should be appropriately aligned. Previous research has shown that two fingerprints can be best aligned using their minutiae correspondences. However, it is difficult to ensure the existence of such correspondences between two fingerprints acquired from different fingers. In this paper, the components of individual fingerprints are prealigned to a common coordinate system prior to the mixing step by utilizing a reference point and an alignment line. The reference point is used to center the components. Thealignmentlineisusedtofind a rotation angle about the reference point. This angle rotates the alignment line to make it vertical. 1) Locating a Reference Point: The reference point used in this work is the northern most core point of extracted singularities. For plain arch fingerprints or partial fingerprint images, Novikov et al. s technique [8], [24], based on the Hough transform, is used to detect the reference point. 2) Finding the Alignment Line: The first step in finding the alignment line is to extract high curvature points from the skeleton of the fingerprint image s continuous component. Next, horizontal distances between the reference point and all high curvature points are calculated. Then, based on these distances, an adaptive threshold is applied to select and cluster points near the reference point. Finally, a line is fitted through the selected points to generate the alignment line. Fig. 9 shows the steps to find the reference point and the alignment line by utilizing the continuous phase component of an arch fingerprint. Since the continuous component of a fingerprint is a global and consistent feature of the fingerprint pattern and is not affected by breaks and discontinuities which are commonly encountered in ridge extraction, the determined reference point and alignment line are consistent and do not reveal any information about the minutia attributes which are local characteristics in the fingerprint. C. Mixing Fingerprints Let and be two different fingerprint images from different fingers, and let and be the prealigned continuous and spiral phases,, 2. As shown in Fig. 1, there are two different mixed fingerprint images that can be generated, and : The continuous phase of is combined with the spiral phase of which generates a new fused fingerprint image. D. Compatibility Measure Variations in the orientations and frequencies of ridges between fingerprint images can result in visually unrealistic mixed fingerprint images [3], [25], as shown in Fig. 10. This issue can be mitigated if the two fingerprints to be mixed are carefully chosen using a compatibility measure. In this paper, the compatibility between fingerprints is computed using nonminutiae features, viz., orientation fields and frequency maps of fingerprint ridges. The orientation and frequency images were computed from the prealigned continuous component of a fingerprint (6)

264 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 Fig. 7. Flowchart for demodulating a fingerprint image. Fig. 9. Finding the reference point and alignment line for an arch fingerprint. Fig. 8. Determining fingerprint constituents from (a) the demodulated phase. (b) Spiral phase. (c) Continuous phase.(d)unwrapped continuous phase. (e), (f), (g), and (h) are the cosine of (a), (b), (c), and (d), respectively. using the technique described in [20]. Then, Yager and Amin s [26] approach is used to compute the compatibility measure. To compute the compatibility between two fingerprint images, their orientation fields and frequency maps are first estimated (see below). Then, the compatibility measure between them is computed as the weighted sum of the normalized orientations and frequency differences, and, respectively: where and are weights that are determined empirically. Fig. 11 shows examples of mixed fingerprints after utilizing the compatibility measure to select the fingerprints pairs, (, ). Perfect compatibility is likely to occur when the two prints to be mixed are from the (7) same finger a scenario that is not applicable in the proposed application. On the other hand, two fingerprints having significantly different ridge structures are unlikely to be compatible and will generate an unrealistic looking fingerprint. Between these two extremes (see Fig. 12), lies a range of possible compatible values that is acceptable. However, determining this range automatically may be difficult. 1) Orientation Field Difference (OD): The difference in orientation fields between and is computed as where is a set of coordinates within the overlapped area of the aligned continuous components of two different fingerprints, and and represent the orientation fields of the two fingerprints. If orientations are restricted to the range, the operator is written as if if (9) if. (8)

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 265 where is a set of coordinates within the overlapped area, and and represent the frequency maps of the two fingerprints and, respectively. Fig. 11. Fig. 10. Examples of mixed fingerprints that look unrealistic. Examples of mixed fingerprints that appear to be visually realistic. Fig. 12. Example of a fingerprint image and its compatibility measure with other images. 2) Frequency Map Difference (FD): Local ridge frequencies are the inverse of the average distance between ridges in the local area in a direction perpendicular to the local orientation. Hong et al. s approach [20] is used to find the local ridge frequencies of the continuous component of a fingerprint image. The difference function is computed as: (10) III. EXPERIMENTS AND DISCUSSION The performance of the proposed fingerprints mixing approach was tested using two different datasets. The first dataset was taken from the West Virginia University (WVU) multimodal biometric database [27]. A subset of 1000 images corresponding to 500 fingers (two impressions per finger) was used. The second dataset was taken from the FVC2002-DB2_A fingerprint database containing 100 fingers with 2 impressions per finger (a total of 200 fingerprints). The VeriFinger SDK was used to generate the normalized fingerprint images and the matching scores. Also, an open source Matlab implementation [28] based on Hong et al. s approach [20] was used to compute the orientation and frequency images of the fingerprints. In order to establish the baseline performance, for each finger in each dataset, one impression was used as probe image and the other impression was added to the gallery. This resultedinarank-1accuracyof for the WVU dataset and for the FVC2002 dataset. The EERs for these two datasets were 0.5% and 0.2%, respectively. In Sections III-A and III-B, different experiments are discussed. These experiments investigate if the new approach for image level fusion can be utilized to (a) generate a new identity by mixing two distinct fingerprints and (b) de-identify a fingerprint by mixing it with another fingerprint. A. Generating Virtual Identities The purpose of this experiment was to report the matching performance of mixing images of two different fingers pertaining to two different individuals to generate virtual identities. 1) Mixing Fingerprints From the Same Database: For each finger in the WVU dataset, one impression was used as the probe image and the other was added to the gallery resulting in a probe set and a gallery set each containing 500 fingerprints. As shown in Figs. 10 and 11, the compatibility measure assists in generating visually appealing mixed fingerprints with less false minutia in the overlapping area [3], [25]. Therefore, the compatibility measures between different pairs of fingerprints in were computed using (7) with and.thefinger pairs to be mixed were selected based on this measure. Pairs were selected and mixed in decreasing order of their compatibility measures resulting in a new probe set consisting of 250 fingerprints. The corresponding pairs of fingerprints in were also mixed resulting in a new gallery set consisting of 250 impressions. Since, mixing is an asymmetric process (6), another probe set and gallery set were also generated. Matching images in against those in and against resulted in a rank-1 accuracy of andaneerof. The reasonably good recognition rates indicate the possibility of mixing fingerprints based on their compatibility measure. Currently, ways to further improve the rank-1 accuracy of mixed fingerprints is being examined. 2) Mixing Fingerprints From Two Different Databases: For each fingerprint in FVC 2002-DB2_A noted by, its compatibility measure with every fingerprint in the WVU dataset (1000 images of 500 subjects) was computed using (7) with and. Based on the computed compatibility measures, the spiral component of was combined with the continuous component of the most compatible fingerprint image in the WVU dataset, resulting in the mixed fingerprint. Because there are 2 impressions per finger in FVC2002-DB2_A, the mixing process resulted in 2 impressions per mixed finger. One of these mixed impressions was used as a probe image and the other was added to the gallery set. The rank-1 accuracy obtained was and the EER was. This indicates the possibility of matching mixed fingerprints.

266 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 TABLE I PROBABILITY OF GENERATING OR MORE MINUTIAE WHICH ARE THE SAME AS IN THE ORIGINAL FINGERPRINT ( AND ) B. Generating Cancelable Identities The purpose of the following experiments was to investigate if the proposed approach can be used to obscure the information present in a component fingerprint image by generating a cancelable template prior to storing it in a central database. Therefore, the mixed fingerprints generatedinsectioniii-a2wereused.withregardstomixingfingerprints for de-identification, the following key issues are raised [14], [15], [29] [32]: 1. Changeability: Are the original fingerprint and the mixed fingerprint correlated? It is essential to assure that the proposed approach prevents identity linking, by preventing the possibility of successfully matching the original print with the mixed print. 2. Noninvertibility: Can an adversary create a physical spoof of the original fingerprint from a compromised mixed fingerprint? It must be computationally infeasible to obtain the original fingerprint features, i.e., the locations and orientations of fingerprint minutia from the mixed fingerprint. 3. Cancelability: Does mixing result in cancelable templates? In case astoredfingerprint is compromised, a new mixed fingerprint can be generated by mixing the original with a new fingerprint. The new mixed fingerprint and the compromised mixed image must be sufficiently different, even though they are derived from the same finger. Another way of looking at this is as follows: if two different fingerprints, and, are mixed with the same fingerprint, are the resulting mixed fingerprints, and,similar?from the perspective of security, they should not be similar. Therefore, the following experiments were designed to evaluate the security strength and the usability of our proposed approach for generating cancelable fingerprints. 1) Studying the Changeability Property: In this experiment, the possibility of exposing the identity of the FVC2002-DB2_A fingerprint image by using the mixed fingerprint images was investigated. The mixed fingerprints (2 impressions per finger) were matched against the original images in the FVC2002-DB2_A database. The resultant rank-1 accuracy was less than 30% (and the EER was more than 30%) suggesting that the original identity cannot be easily deduced from the mixed image. Moreover, to confirm that the changeability property of the mixing fingerprint approach is independent of the nature of the used matcher, the mixed fingerprints were matched against the original fingerprint based on only the locations of minutiae after omitting the orientation features. The EER in this case increased from 30% to 40% and the rank-1 accuracy decreased from 30% to 12%. This suggests that the mixed and the original fingerprints are sufficiently dissimilar even if only minutiae information is used. 2) Studying the Noninvertibility Property: In this experiment, the vulnerability of the proposed de-identification approach to brute-force attacks is discussed with respect to noninvertibility [30] if an attacker were to access the mixed fingerprint. In other words, if the mixed fingerprint were to be compromised, the probability of successfully reconstructing the original fingerprint is estimated. Based on (6), if an attacker were to access a mixed fingerprint (with the knowledge that it is a mixed fingerprint) and, and then decomposes by using the technique described in Section II-A, the minutia locations of the original fingerprint, characterized by the spiral component, are compromised. Although several researchers have shown that the original fingerprint image can be reconstructed from a fingerprint s minutiae consisting of their locations and orientations [8] [11], there is no published work that discusses the possibility to reconstruct the original fingerprint image only from the minutiae locations. Therefore, the attacker must guess the orientation of each minutia to be able to reconstruct the original fingerprint. Hence, if is the tolerance determining the acceptable deviation from the original orientation, the probability of assuming the correct orientation for a given minutiae is Consequently, the probability of successfully generating minutiae which are the same as in the original fingerprint is (11) or more (12) where is the total number of minutiae in a fingerprint, and is the minimum number of minutiae required for authentication. Table I shows the probabilities of successfully compromising the orientations of minutiae points in the original fingerprints for different values of. In our experiments, the average number of minutiae per fingerprint,, is 45. The low probabilities in the table indicate that it is difficult to regenerate the original fingerprint from the mixed fingerprint. 3) Studying the Cancelability Property: The purpose of this experiment was to investigate if the proposed approach can be used to cancel a compromised mixed fingerprint and generate a new mixed fingerprint by mixing the original fingerprint with a new fingerprint. To evaluate this, the two impressions of one single fingerprint in the FVC2002-DB2_A database were selected. Next, this fingerprint was mixed with each of the 500 fingers in the WVU dataset. This resulted in 500 mixed fingerprints with 2 impressions per finger. One of these impressions per mixed finger was used as probe image and the other was added to the gallery set. Then, each image in the probe set was compared against all images in the gallery set in order to determine a match. A match is deemed to be correct (i.e., the probe is correctly identified) if the probe image and the matched gallery image are from thesamemixedfinger. In the resulting experiments, the rank-1 identification accuracy obtained was 85% and the EER was 7%. The reasonably high identification rate suggests that the 500 mixed fingerprints are different from each other. This means, the fingerprint from the FVC2002-DB2_A database can be successfully canceled and converted into a new identity based on the choice of the fingerprint selected from the WVU database for mixing. IV. CONCLUSIONS In this work, it was demonstrated that the concept of mixing fingerprints can be utilized to (a) generate a new identity by mixing two distinct fingerprints and (b) de-identify a fingerprint by mixing it with another fingerprint. To mix two fingerprints, each fingerprint is decomposed into two components, viz., the continuous and spiral components. After aligning the components of each fingerprint, the continuous component of one fingerprint is combined with the spiral component of the other fingerprint image. Experiments on two fingerprint

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 8, NO. 1, JANUARY 2013 267 databases show that (a) the mixed fingerprint representing a new identity can potentially be used for authentication, (b) the mixed fingerprint is dissimilar from the original fingerprints, (c) the same fingerprint can be used in various applications and cross-matching between applications can be prevented by mixing the original fingerprint with a different fingerprint, (d) mixing different fingerprints with the same fingerprint results in different identities, and (e) the proposed method can be utilized to generate a database of virtual identities from a fixed fingerprint dataset. Further work is required to enhance the performance due to mixed fingerprints by exploring alternate algorithms for prealigning, selecting and mixing the different pairs. REFERENCES [1] A. Ross, K. Nandakumar, and A. Jain, Handbook of Multibiometrics. New York: Springer-Verlag, 2006, New York Inc.. [2] D. Maltoni, D. Maio, A. Jain, and S. Prabhakar, Handbook of Fingerprint Recognition. New York: Springer-Verlag, 2009, New York Inc.. [3] A. Othman and A. Ross, Mixing fingerprints for generating virtual identities, in Proc. IEEE Int. Workshop Information Forensics and Security (WIFS), Foz do Iguacu, Brazil, Nov./Dec. 2011. [4] R. Cappelli, Sfinge: Synthetic fingerprint generator, in Proc. Int. Workshop Modeling and Simulation in Biometric Technology, 2004, pp. 147 154. [5] A. Jain, A. Ross, and U. Uludag, Biometric template security: Challenges and solutions, in Proc. Eur. Signal Processing Conf. (EUSIPCO), 2005, pp. 469 472. [6] G.I.Davida,Y.Frankel,andB.J.Matt, Onenablingsecureapplications through off-line biometric identification, in Proc. IEEE Symp. Security and Privacy, 1998, pp. 148 157. [7] N.Ratha,J.Connell,andR.Bolle, Enhancingsecurityandprivacyin biometrics-based authentication systems, IBM Syst. J., vol. 40, no. 3, pp. 614 634, 2001. [8] A. Ross, J. Shah, and A. Jain, From template to image: Reconstructing fingerprints from minutiae points, IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 4, pp. 544 560, Apr. 2007. [9] R. Cappelli, A. Lumini, D. Maio, and D. Maltoni, Fingerprint image reconstruction from standard templates, IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 9, pp. 1489 1503, Sep. 2007. [10] J. Feng and A. K. Jain, Fingerprint reconstruction: From minutiae to phase, IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 2, pp. 209 223, Feb. 2011. [11] S.LiandA.Kot, Attackusingreconstructedfingerprint, in Proc. IEEE Int. Workshop Information Forensics and Security (WIFS),2011, pp. 1 6. [12] B. Yanikoglu and A. Kholmatov, Combining multiple biometrics to protect privacy, in Proc. ICPR-BCTP Workshop, Aug. 2004, pp. 43 46. [13] S.LiandA.C.Kot, Anovelsystemforfingerprint privacy protection, in Proc. 7th Int. Conf. Information Assurance and Security (IAS), Dec. 2011, pp. 262 266. [14] A. Jain, K. Nandakumar, and A. Nagar, Biometric template security, EURASIP J. Adv. Signal Process., vol. 2008, pp. 1 17, 2008. [15] C. Rathgeb and A. Uhl, A survey on biometric cryptosystems and cancelable biometrics, EURASIP J. Inf. Security, vol. 2011, no. 1, pp. 1 25, 2011 [Online]. Available: http://www.opticsexpress.org/abstract.cfm?uri=oe-15-14-8667 [16] K. G. Larkin and P. A. Fletcher, A coherent framework for fingerprint analysis: Are fingerprints holograms?, Opt. Express vol. 15, no. 14, pp. 8667 8677, 2007. [17] D. Ghiglia and M. Pritt, Two-Dimensional Phase Unwrapping: Theory, Algorithms, and Software. Hoboken, NJ: Wiley, 1998. [18] K.G.Larkin,D.J.Bone,andM.A.Oldfield, Natural demodulation of two-dimensional fringe patterns. I. General background of the spiral phase quadrature transform, J. Opt. Soc. Amer. A, vol.18,no.8,pp. 1862 1870, 2001. [19] B. Hastings, An integrated representation of fingerprint patterns, in Proc. 16th School of Computer Science & Software Engineering Research Conf., Yanchep, Western Australia, Jun. 2008. [20] L. Hong, Y. Wan, and A. Jain, Fingerprint image enhancement: Algorithm and performance evaluation, IEEE Trans. Pattern Anal. Mach. Intell., vol. 20, no. 8, pp. 777 789, Aug. 1998. [21] R. Thai, Fingerprint Image Enhancement and Minutiae Extraction, Ph.D. thesis, School of Computer Science and Software Engineering, The University of Western Australia, Perth, Western Australia, Australia, 2003. [22] R. Goldstein, H. Zebker, and C. Werner, Satellite radar interferometry Two-dimensional phase unwrapping, Radio Sci.,vol.23,no.4, pp. 713 720, 1988. [23] D. Bone, Fourier fringe analysis: The two-dimensional phase unwrapping problem, Appl. Opt., vol. 30, no. 25, pp. 3627 3632, 1991. [24] S. O. Novikov and V. S. Kot, Singular feature detection and classification of fingerprints using hough transform, in Proc. SPIE Int. Workshop on Digital Image Processing and Computer Graphics, 1998, vol. 3346, no. 1, pp. 259 269. [25] A. Ross and A. Othman, Mixing fingerprints for template security and privacy, in Proc. 19th Eur. Signal Processing Conf. (EUSIPCO), Barcelona, Spain, Aug. 2011. [26] N. Yager and A. Amin, Fingerprint alignment using a two stage optimization, Pattern Recognit. Lett., vol. 27, no. 5, pp. 317 324, 2006. [27] S. Crihalmeanu, A. Ross, S. Schuckers, and L. Hornak, A Protocol for Multibiometric Data Acquisition, Storage and Dissemination Lane Department of Computer Science and Electrical Engineering, WVU, Tech. Rep., 2007. [28] P. D. Kovesi, MATLAB and Octave Functions for Computer Vision and Image Processing Centre for Exploration Targeting, School of Earth and Environment, The University of Western Australia [Online]. Available: http://www.csse.uwa.edu.au/~pk/research/matlabfns/ [29] N. Ratha, S. Chikkerur, J. Connell, and R. Bolle, Generating cancelable fingerprint templates, IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 4, pp. 561 572, Apr. 2007. [30] C. Lee, J. Choi, K. Toh, and S. Lee, Alignment-free cancelable fingerprint templates based on local minutiae information, IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 4, pp. 980 992, Aug. 2007. [31] S. Chikkerur, N. Ratha, J. Connell, and R. Bolle, Generating registration-free cancelable fingerprint templates, in Proc. 2nd IEEE Int. Conf. Biometrics: Theory, Applications and Systems, 2008, pp. 1 6, IEEE. [32] A. Nagar, K. Nandakumar, and A. K. Jain, Biometric template transformation: A security analysis, in Proc. SPIE, Electronic Imaging, Media Forensics and Security XII, San Jose, Jan. 2010.