600 likes | 708 Views
Fingerprint Recognition. CPSC 601. Lecture Plan. Fingerprint features Fingerprint matching. Fingerprint verification and identification. Coarse representation – Level 1 features. ___ ____ ____ ____ ____ ___ _____ ___.
E N D
Fingerprint Recognition • CPSC 601
Lecture Plan • Fingerprint features • Fingerprint matching
___ ____ ____ ____ ____ ___ _____ ___ Coarse representation –Level 1 features Left loop Right loop Whorl Arch Tented Arch
Level 3 features Sweat pores
Minutiae Detection Original image Binary image Skeleton and extracted minutiae
Feature extraction process Fingerprint image Fingerprint area Frequency image Orientation image Ridge pattern & Minutiae points
Orientation image of fingerprint • Computation of gradients over a square-meshed grid of size 16 x 16; the element length is proportional to its reliability.
____ _________ _______ __ ___ _______ ________ _______ ___________ _____ Frequency image • Ridge frequency: inverse of the average distance between 2 consecutive peaks
Segmentation • Segmentation is the process of isolating foreground from background: • Image block (16x16 pixels) decomposition • Thresholding using variance of gradient for each block
Enhancement • Initial enhancement may involve the normalization of the inherent intensity variation in a digitized fingerprint caused either by the inking or the live-scan device. • One such process - local area contrast enhancement (LACE) is useful to provide such normalization through the scaling of local neighborhood pixels in relation to a calculated global mean. • An inked fingerprint image • The results of the LACE algorithm on (a) Histograms of fingerprint images in (a) and (b) above.
Enhancement Another type of enhancement is contextual filtering that: 1. Provide a low-pass (averaging) effect along the ridge direction with the aim of linking small gaps and filling impurities due to pores or noise. 2. Perform a bandpass (differentiating) effect in a direction orthogonal to the ridges to increase the discrimination between ridges and valleys and to separate parallel linked ridges. 3. Gabor filters have both frequency-selective and orientation-selective properties and have optimal joint resolution in both spatial and frequency domains.
Enhancement Graphical representation (lateral and top view) of the Gabor filter defined by the parameters θ = 1350,f = 1/5, σx = σy = 3
Enhancement • The simplest and most natural approach for extracting the local ridge orientation field image, D, containing elements θij, in a fingerprint image is based on the computation of gradients in the fingerprint image.
Enhancement • The local ridge frequency (or density) fxy at point [x, y] is the inverse of the number of ridges per unit length along a hypothetical segment centered at [x, y] and orthogonal to the local ridge orientation θxy. • A frequency image F, analogous to the orientation image D, is defined if the frequency is estimated at discrete positions and arranged into a matrix. The local ridge frequency varies across different fingers and regions. • The ridge pattern can be locally modeled as a sinusoidal-shaped surface and the variation theorem can be exploited to estimate the unknown frequency.
Enhancement The variation of the function h in the interval [x1, x2] is the sum of the amplitudes α1, α2, … α8. If the function is periodic or the function amplitude does not change significantly within the interval of interest, the average amplitude αm can be used to approximate the individual α. Then the variation can be expressed as 2αm multiplied by the number of periods of the function over the interval.
_____ ___ ______ __ _____ ______ __ ___ ______ Extraction of minutiae • count the number of ridge pixels in the window except middle
Feature extraction errors • The feature extraction algorithms are imperfect and often introduce measurement errors • Errors may be made during any of the feature extraction stages, e.g., estimation of orientation and frequency images, detection of the number, type, and position of the singularities and minutiae, segmentation of the fingerprint area from background, etc. • Aggressive enhancement algorithms may introduce inconsistent biases that perturb the location and orientation of the reported minutiae from their gray-scale counterparts • In low-quality fingerprint images, the minutiae extraction process may introduce a large number of spurious minutiae and may not be able to detect all the true minutiae
Fingerprint Recognition • Fingerprint features • Fingerprint matching
Intra-variability • Matching fingerprint images is an extremely difficult problem, mainly due to the large variability in different impressions of the same finger (intra-variability). The main factors are: • Displacement (global translation of the fingerprint area) • Rotation • Partial overlap • Non-linear distortion: • the act of sensing maps the three-dimensional shape of a finger onto the two-dimensional surface of the sensor • skin elasticity • Pressure and skin condition • Noise: introduced by the fingerprint sensing system • Feature extraction errors
Matching illustration Examples of mating, non-mating and multiple mating minutiae.
Matching illustration An example of matching the search minutiae set in (a) with the file minutiae set in (b) is shown in (c).
Small overlap Non-linear distortion Different skin conditions Difficulty in fingerprint matching
Finger placement • A finger placement is correct when user: • Approaches the finger to the sensor through a movement that is orthogonal to the sensor surface • Once the finger touches the sensor surface, the user does not apply traction or torsion
Non-linear distortion • Three distinct regions: • A close-contact region (a) where the high pressure and the surface friction do not allow any skin slippage • A transitional region (b) where an elastic distortion is produced by skin compression and stretching • An external region (c) where the light pressure allows the finger skin to be dragged by the finger movement
Fingerprint Matching • Minutiae-based matching: finding the alignment between the template and the input minutiae sets that results in the maximum number of minutiae pairings • Correlation-based matching: correlation between corresponding pixels is computed for different alignments (e.g. various displacements and rotations) • Ridge feature-based matching: comparison in term of features such as local orientation and frequency, ridge shape, texture information, etc.
Pre-alignment • Absolute pre-alignment • The most common absolute pre-alignment technique translates and rotates the fingerprint according to the position of the core point and the delta point (if a delta exists) • Relative pre-alignment • By superimposing the singularities • By correlating the orientation images • By correlating ridge features (e.g. length and orientation of the ridges)
Fingerprint matching with absolute pre-alignment • First align the fingerprints using the global structure. • Extract the core-points (prominent symmetry points) to estimate the transformation parameters v, ϕ (v from the difference in their position, and ϕ from the difference in their angle) by complex filtering of the smoothed orientation field. • Then use the local structure for ”point-to-point”matching. Input image Template image
Minutiae matching with relative pre-alignment Pre-alignment based on the minutiae marked with circles and the associated ridges Matching results, where paired minutiae are connected by green lines
Ridge count 47
DT method • We first compute the Delaunay triangulation of minutiae sets Q and P. Second, we use triangle edge as comparing index. To compare two edges, Length, θ1 , θ2 , Ridgecount values are used, all of which invariant of the translation and rotation.
Correlation based matching • Non-linear distortion makes fingerprint impressions significantly different in terms of global structure; two global fingerprint patterns cannot be reliably correlated • Due to the cyclic nature of fingerprint patterns, if two corresponding portions of the same fingerprint are slightly misaligned, the correlation value falls sharply • A direct application of 2D correlation is computationally very expensive