1 / 55

Fingerprint Recognition

Fingerprint Recognition. CPSC 601. Lecture Plan. Fingerprint features Fingerprint matching. Fingerprint verification and identification. Coarse representation – Level 1 features. ___ ____ ____ ____ ____ ___ _____ ___.

Télécharger la présentation

Fingerprint Recognition

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Fingerprint Recognition • CPSC 601

  2. Lecture Plan • Fingerprint features • Fingerprint matching

  3. Fingerprint verification and identification

  4. Coarse representation –Level 1 features

  5. ___ ____ ____ ____ ____ ___ _____ ___ Coarse representation –Level 1 features Left loop Right loop Whorl Arch Tented Arch

  6. Minutiae –Level 2 features

  7. Minutia –Level 2 features

  8. Level 3 features Sweat pores

  9. Level 3 features

  10. Minutiae Detection Original image Binary image Skeleton and extracted minutiae

  11. Feature extraction process Fingerprint image Fingerprint area Frequency image Orientation image Ridge pattern & Minutiae points

  12. Feature extraction process

  13. 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.

  14. Orientation image of fingerprint

  15. ____ _________ _______ __ ___ _______ ________ _______ ___________ _____ Frequency image • Ridge frequency: inverse of the average distance between 2 consecutive peaks

  16. Segmentation • Segmentation is the process of isolating foreground from background: • Image block (16x16 pixels) decomposition • Thresholding using variance of gradient for each block

  17. Why do we need enhancement?

  18. Why do we need enhancement?

  19. Need for Enhancement

  20. 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.

  21. 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.

  22. Enhancement Graphical representation (lateral and top view) of the Gabor filter defined by the parameters θ = 1350,f = 1/5, σx = σy = 3

  23. 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.

  24. 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.

  25. 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.

  26. Gabor filters

  27. Enhancement Results

  28. Artifacts

  29. Post-processing

  30. _____ ___ ______ __ _____ ______ __ ___ ______ Extraction of minutiae • count the number of ridge pixels in the window except middle

  31. 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

  32. Fingerprint Recognition • Fingerprint features • Fingerprint matching

  33. 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

  34. Matching illustration Examples of mating, non-mating and multiple mating minutiae.

  35. Matching illustration An example of matching the search minutiae set in (a) with the file minutiae set in (b) is shown in (c).

  36. Small overlap Non-linear distortion Different skin conditions Difficulty in fingerprint matching

  37. 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

  38. Non-linear distortion

  39. 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

  40. 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.

  41. Local minutiae matching

  42. Minutiae correspondence

  43. 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)

  44. 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

  45. 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

  46. Triangular matching

  47. Ridge count 47

  48. 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.

  49. Matching parameters

  50. 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

More Related