Patent EP0062066B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0062066B1 Expired / Lapsed EP ⏱️ 0.0 years remaining

Fingerprint minutiae matcher

Assignee: De la Rue Printrak Inc
•
Filing: 1981-10-20
•
Granted: 1988-01-20
•
Expires: 2001-10-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A machine or process for comparing fingerprints based on the correspondence between fingerprint minutiae. The pattern of minutiae in an unknown or search fingerprint is rotated and translated to obtain approximate registration with the pattern of minutiae in a known on file fingerprint. Following rotation and translation, only those search and file fingerprints that exhibit a sufficient number of mating minutiae between the fingerprints are compared further. For each pair of mating search and file minutiae, the neighbouring mating minutiae are compared and an individual minutia 'match score' is determined based on the degree of correspondence between the other mating pairs of minutiae within a specified neighbourhood of the individual pair of mating search and file minutiae. The individual 'match scores' for each of the mating minutiae are summed to yield a total score that is indicative of the correspondence between the search and the file fingerprints.

Inventors

  • 👤 John Charles Elsey

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-09 13:07
CPC Classifications
G; G06; G06V; G06V40/00; G06V40/10; G06V40/12

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 294 words
A method employing a programmed computer for comparing the minutiae of a search fingerprint (the "search minutiae") with the minutiae of a file fingerprint (the "file minutiae") to determine if the search fingerprint closely resembles the file fingerprint, including the steps of pairing mating search (S1,S2 ...) and file (F1,F2 ...) minutiae, computing scores (S M ) or individual pairs of mating search and file minutiae (S4,F2; S9,F14 ...), and summing the computed scores (S M ) to obtain a final match score indicative of the overall resemblance of the search fingerprint to the file fingerprint, the method being characterised by: a) prior to the pairing step, rotating and translating the search and file fingerprints relatively to one another (N R ) to determine a selected rotation (a) and translation (△X, ΔY) which most nearly brings the search minutiae (S1,S2...) into registration with the file (F1,F2...) minutiae (Figure 5, MM*); b) carrying out the step of pairing mating search and file minutiae (S4, F2; S9, F14...) based upon the selected rotation and translation; and c) computing the individual minutia score (S M ) for each search minutia (S1 ,S2 ...) that has a mating file minutia based on the spatial and angular relationship between the other mating file and search minutiae (Tables 7(c), 7(a)) located within a neighbourhood of each such search minutia (S1,S2...), the step of computing an individual score comprising the steps of (c1) computing a variance (σ 2 ) of the spatial and angular relationships between file and search minutiae of the neighbouring pairs of file and search minutiae (Tables 7(b), 7(d) and (c2) comprising an individual minutiae score (S M ) based upon the number of neighbouring pairs (N M ) and the variances (σ 2 ) of such pairs.
Claim 2
Independent Claim 294 words
A method employing a programmed computer for comparing the minutiae of a search fingerprint (the "search minutiae") with the minutiae of a file fingerprint (the "file minutiae") to determine if the search fingerprint closely resembles the file fingerprint, including the steps of pairing mating search (S1,S2 ...) and file (F1,F2 ...) minutiae, computing scores (S M ) or individual pairs of mating search and file minutiae (S4,F2; S9,F14 ...), and summing the computed scores (S M ) to obtain a final match score indicative of the overall resemblance of the search fingerprint to the file fingerprint, the method being characterised by: a) prior to the pairing step, rotating and translating the search and file fingerprints relatively to one another (N R ) to determine a selected rotation (a) and translation (△X, ΔY) which most nearly brings the search minutiae (S1,S2...) into registration with the file (F1,F2...) minutiae (Figure 5, MM*); b) carrying out the step of pairing mating search and file minutiae (S4, F2; S9, F14...) based upon the selected rotation and translation; and c) computing the individual minutia score (S M ) for each search minutia (S1 ,S2 ...) that has a mating file minutia based on the spatial and angular relationship between the other mating file and search minutiae (Tables 7(c), 7(a)) located within a neighbourhood of each such search minutia (S1,S2...), the step of computing an individual score comprising the steps of (c1) computing a variance (σ 2 ) of the spatial and angular relationships between file and search minutiae of the neighbouring pairs of file and search minutiae (Tables 7(b), 7(d) and (c2) comprising an individual minutiae score (S M ) based upon the number of neighbouring pairs (N M ) and the variances (σ 2 ) of such pairs.
Claim 3
Dependent Claim 33 words
A method according to claim 1, wherein step c2 comprises selecting an individual score that increases with increase of the number of neighbouring pairs and decreases with increase in the amount of variance.
Claim 4
Dependent Claim 67 words
A method according to claim 2, wherein the individual score is selected from a scoring table having the number of neighbouring pairs as one dimension and a scaled variance as the other dimension, the table having entries denoting scores that increase in the one dimension as the number of neighbouring pairs increases and that decrease in the other dimension as the magnitude of the scaled variance increases.
Claim 5
Dependent Claim 38 words
A method according to claim 1, including the steps of selecting a number of neighbouring pairs of file and search minutiae displaced from an individual minutia in any direction by a distance not greater than a predetermined distance.
Claim 6
Independent Claim 37 words
A method according to any of the preceding claims, wherein the variances are computed as the average of the sum of the squares of translational and angular differences between file and search minutiae of the respective pairs.
Claim 7
Independent Claim 47 words
A method according to any of the preceding claims, further comprising: (a) sorting the search minutiae into angle order; (b) finding the closest neighbours for each search minutia; (c) sorting the file minutiae into angle order; and (d) computing maximum and minimum coordinates for the file minutiae.
Claim 8
Independent Claim 51 words
A method according to any of claims 1 to 3, wherein step a) comprises terminating the comparison between the minutiae of a search fingerprint and the minutiae of a file fingerprint whenever the degree of registration of the search minutiae with the file minutiae fails to exceed an operator selected threshold.
Claim 9
Independent Claim 96 words
A method according to any of the preceding claims, wherein the step of rotating and translating comprises: (a) rotating the search minutiae through a preselected set of rotations; (b) for each rotated set of search minutia constructing a histogram showing the number of coincident search and file minutiae for various translations of the search minutiae relative to the file minutiae; and (c) determining the rotation and translation which most nearly brings the search minutia into registration with the file minutiae by comparing the magnitudes of the largest adjacent blocks of entries in each of the histograms.
Claim 10
Independent Claim 251 words
A method of comparing minutiae of a search fingerprint (search minutiae) with minutiae of a file fingerprint (file minutiae) to determine if the two fingerprints match one another, including the steps of pairing mating search (S1,S2...) and file (F1,F2...) minutiae, computing scores (S M ) for individual pairs of mating search and file minutiae (S4,F2; S9,F14...), and summing the computed scores (S M ) to obtain a final match score indicative of the overall resemblance of the search fingerprint to the file fingerprint, the method being characterised by: (a) prior to the pairing step, relatively rotating the search and file fingerprints through a plurality of discrete rotations (N R ); (b) determining for each rotation (a) a translation (ΔX, ΔY) of the search fingerprint that produces a maximum number (Figure 5) of mating pairs of file and search minutiae; (c) selecting that rotation (a) and translation (ΔX, ΔY) which produces the largest (MM) of the maximum numbers of mating pairs; (d) carrying out the step of pairing mating search and file minutiae (S4,F2; S9,F14 ...) based upon the selected rotation and translation; and (e) for the selected rotation and translation, computing the individual minutiae score (S M , Table 7(e)) for each search minutiae (S4,S9 ...) that has a mating file minutiae (F2,F14 ...) based upon comparisons ( 0 2 , N M , Tables 7(b), 7(d)) of angular and spatial relations of other mating file and search minutiae (Tables 7(a), 7(c)) located in a neighbourhood of each such search minutiae.
Claim 11
Independent Claim 251 words
A method of comparing minutiae of a search fingerprint (search minutiae) with minutiae of a file fingerprint (file minutiae) to determine if the two fingerprints match one another, including the steps of pairing mating search (S1,S2...) and file (F1,F2...) minutiae, computing scores (S M ) for individual pairs of mating search and file minutiae (S4,F2; S9,F14...), and summing the computed scores (S M ) to obtain a final match score indicative of the overall resemblance of the search fingerprint to the file fingerprint, the method being characterised by: (a) prior to the pairing step, relatively rotating the search and file fingerprints through a plurality of discrete rotations (N R ); (b) determining for each rotation (a) a translation (ΔX, ΔY) of the search fingerprint that produces a maximum number (Figure 5) of mating pairs of file and search minutiae; (c) selecting that rotation (a) and translation (ΔX, ΔY) which produces the largest (MM) of the maximum numbers of mating pairs; (d) carrying out the step of pairing mating search and file minutiae (S4,F2; S9,F14 ...) based upon the selected rotation and translation; and (e) for the selected rotation and translation, computing the individual minutiae score (S M , Table 7(e)) for each search minutiae (S4,S9 ...) that has a mating file minutiae (F2,F14 ...) based upon comparisons ( 0 2 , N M , Tables 7(b), 7(d)) of angular and spatial relations of other mating file and search minutiae (Tables 7(a), 7(c)) located in a neighbourhood of each such search minutiae.
Claim 12
Dependent Claim 72 words
A method according to claim 9, wherein steps b and c comprise: for each discrete rotation constructing a histogram showing the number of mating search and file minutiae for various relative translations of search and file fingerprints; and determining the rotation and translation which most nearly brings the search minutiae into registration with the file minutiae by comparing the magnitudes of the largest adjacent blocks of entries in each of the histograms.
Claim 13
Dependent Claim 32 words
A method according to claim 9 or claim 10, further including the step of terminating the comparison if the largest of the maximum numbers of mating pairs fails to exceed a threshold.
Claim 14
Independent Claim 73 words
A method according to any of claims 9 to 11, wherein steps a to c comprise selecting pairs of file and search minutiae for which the direction values thereof differ by less than a selected matching threshold; and for each discrete rotation, relatively translating the search and file fingerprints through a number of translations at each of which the file and search minutiae of one of the selected pairs coincide with one another.
Claim 15
Independent Claim 63 words
A method according to any of claims 9 to 12, wherein the step of computing an individual score comprises the steps of computing a variance of the spatial and angular relationships between file and search minutiae of neighbouring pairs of file and search minutiae; and computing an individual minutiae score based upon the number of neighbouring pairs and the variances of such pairs.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag