Patent US5613014A successfully refreshed from Google Patents.
US5613014A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fingerprint matching system
Assignee: Lockheed Martin Corp
•
Filing: 1994-10-12
•
Granted: 1997-03-18
•
Expires: 2014-10-12
Abstract
Abstract An image comparison arrangement uses an electronic computer to compare digitized fingerprint minutia maps of fingerprints of an unknown fingerprint set with corresponding maps of reference fingerprint sets which are stored in memory, in order to identify unknown fingerprints or to match fingerprints. The matching is performed by converting all the fingerprints to attributed relation graphs (ARGs) including nodes and branches, to which attributes are appended. For each fingerprint pair being compared, a distance matrix is generated, the elements of which are the similarities of stars. The highest-ranking star pair is selected as the starting point of a comparison tree, by which attempts are made to fill a match core with elements representing the matching stars. The comparison is of the various attributes of the nodes and branches of each star. Once the maximum consistent number of stars has been matched in each fingerprint set, the next reference fingerprint is compared with the unknown fingerprint, until all relevant reference fingerprints have been compared. The number of elements in the match core indicates the degree of match of the unknown to each reference fingerprint.
Inventors
- 👤 Mohamed A. Eshera
- 👤 Russell E. Sanders
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 16:06
CPC Classifications
G; G06; G06V; G06V40/00; G06V40/10; G06V40/12; G06V40/1347; G06V40/1353; G06V40/1365; G06V40/1371
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
402 words
A method for matching a set of unidentified fingerprints, which set includes at least one unidentified fingerprint, with a plurality of sets of reference fingerprints from a fingerprint file, said method comprising the steps of: generating an attributed relational graph (ARG) including (a) nodes and node attributes and (b) branches between said nodes, and branch attributes, from an extracted digital minutia map of said set of unidentified fingerprints, to thereby implicitly generate stars centered at each of said nodes; generating a distance matrix between (a) the stars in said ARG of one of said fingerprints of said set of unknown fingerprints and (b) the stars of the ARG of one of the fingerprints in one of said sets of reference fingerprints, said distance matrix including a matrix element associated with each pair of stars; sorting said elements of said distance matrix for each fingerprint pair, according to the value of said elements, to form a sorted distance matrix which establishes an order of star pair matches; generating a match core of consistent sets of star pairs from said distance matrix and said ARG in an order established by said sorted distance matrix; wherein said step of generating a match core includes the steps of: selecting a star pair associated with a highest element of said sorted distance matrix, to define a first element of a match core; deleting from said distance matrix that element associated with said first element of said match core, to generate a reduced distance matrix; selecting, from among candidate pairs of stars centered on neighbor nodes of the center nodes of said star pair in said first element of said match core, that candidate star pair which is both (a) consistent with said match core, and (b) among all said candidate star pairs which are consistent with said match core, associated with a highest distance matrix element in said reduced distance matrix, to thereby generate a second element for said match core; adding said second element to said match core as a further element; deleting from said reduced distance matrix that one of said elements of said distance matrix associated with said candidate star pair added to said match core, to form a further reduced distance matrix; repeating said steps of selecting that further star pair, adding, and deleting from said reduced distance matrix, at least until no more candidate star pairs consistent with the match core remain.
Claim 2
Independent Claim
402 words
A method for matching a set of unidentified fingerprints, which set includes at least one unidentified fingerprint, with a plurality of sets of reference fingerprints from a fingerprint file, said method comprising the steps of: generating an attributed relational graph (ARG) including (a) nodes and node attributes and (b) branches between said nodes, and branch attributes, from an extracted digital minutia map of said set of unidentified fingerprints, to thereby implicitly generate stars centered at each of said nodes; generating a distance matrix between (a) the stars in said ARG of one of said fingerprints of said set of unknown fingerprints and (b) the stars of the ARG of one of the fingerprints in one of said sets of reference fingerprints, said distance matrix including a matrix element associated with each pair of stars; sorting said elements of said distance matrix for each fingerprint pair, according to the value of said elements, to form a sorted distance matrix which establishes an order of star pair matches; generating a match core of consistent sets of star pairs from said distance matrix and said ARG in an order established by said sorted distance matrix; wherein said step of generating a match core includes the steps of: selecting a star pair associated with a highest element of said sorted distance matrix, to define a first element of a match core; deleting from said distance matrix that element associated with said first element of said match core, to generate a reduced distance matrix; selecting, from among candidate pairs of stars centered on neighbor nodes of the center nodes of said star pair in said first element of said match core, that candidate star pair which is both (a) consistent with said match core, and (b) among all said candidate star pairs which are consistent with said match core, associated with a highest distance matrix element in said reduced distance matrix, to thereby generate a second element for said match core; adding said second element to said match core as a further element; deleting from said reduced distance matrix that one of said elements of said distance matrix associated with said candidate star pair added to said match core, to form a further reduced distance matrix; repeating said steps of selecting that further star pair, adding, and deleting from said reduced distance matrix, at least until no more candidate star pairs consistent with the match core remain.
Claim 3
Dependent Claim
39 words
A method according to claim 1, wherein said step of repeating until no more star pairs consistent with the match core remain includes the step of deeming a particular number of elements in said match core to be inconsistent.
Claim 4
Dependent Claim
214 words
A method according to claim 1, further comprising the steps of; if the number of elements in said match core is less than a particular number, and no star pair consistent with said match core remains, deleting the most recently added element from said match core, whereby another element becomes the last element added to said match core; selecting, from among candidate pairs of stars centered on neighbor nodes of the center nodes of any star which is associated with an element of said match core, that candidate star pair which is both (a) consistent with said match core, and (b) among all said candidate star pairs which are consistent with said match core, associated with a highest distance matrix element in said reduced distance matrix, to thereby generate a next element for said match core; adding said next element to said match core; and deleting from said reduced distance matrix that one of said elements of said distance matrix associated with said candidate star pair added as said next element to said match core, to form a yet further reduced distance matrix; repeating said steps of selecting that further star pair, adding, and deleting from said reduced distance matrix, at least until no more candidate star pairs consistent with the match core remain.
Claim 5
Independent Claim
407 words
A method for matching a set of unidentified fingerprints, which set includes at least one unidentified fingerprint, with a plurality of sets of reference fingerprints from a fingerprint file, said method comprising the steps of: generating an attributed relational graph (ARG) including (a) nodes and node attributes and (b) branches between said nodes, and branch attributes, from an extracted digital minutia map of said set of unidentified fingerprints, to thereby implicitly generate stars centered at each of said nodes; generating a distance matrix between (a) the stars in said ARG of one of said fingerprints of said set of unknown fingerprints and (b) the stars of the ARG of one of the fingerprints in one of said sets of reference fingerprints, said distance matrix including a matrix element associated with each pair of stars; and generating a match core of consistent sets of star pairs from said distance matrix and said ARG; wherein said step of generating a match core further comprises the steps of: sorting said elements of said distance matrix for each fingerprint pair, according to the value of said elements, to establish an order of star pair matches; and in an order established by said sorted distance matrix, performing the further steps of: (a) selecting a star pair associated with a highest distance matrix element, to define a first element of a match core; (b) deleting from said distance matrix that element associated with said first element of said match core, to generate a reduced distance matrix; (c) selecting, from among candidate pairs of stars centered on neighbor nodes of the center nodes of said star pair in said first element of said match core, that candidate star pair which is both (i) consistent with said match core, and (ii) among all said candidate star pairs which are consistent with said match core, associated with a highest distance matrix element in said reduced distance matrix, to thereby generate a second element for said match core; (d) adding said second element to said match core as a further element; (e) deleting from said reduced distance matrix that one of said elements of said distance matrix associated with said candidate star pair added to said match core, to form a further reduced distance matrix; (f) repeating said steps of selecting that further star pair, adding, and deleting from said reduced distance matrix, at least until no more candidate star pairs consistent with the match core remain.
Claim 6
Independent Claim
407 words
A method for matching a set of unidentified fingerprints, which set includes at least one unidentified fingerprint, with a plurality of sets of reference fingerprints from a fingerprint file, said method comprising the steps of: generating an attributed relational graph (ARG) including (a) nodes and node attributes and (b) branches between said nodes, and branch attributes, from an extracted digital minutia map of said set of unidentified fingerprints, to thereby implicitly generate stars centered at each of said nodes; generating a distance matrix between (a) the stars in said ARG of one of said fingerprints of said set of unknown fingerprints and (b) the stars of the ARG of one of the fingerprints in one of said sets of reference fingerprints, said distance matrix including a matrix element associated with each pair of stars; and generating a match core of consistent sets of star pairs from said distance matrix and said ARG; wherein said step of generating a match core further comprises the steps of: sorting said elements of said distance matrix for each fingerprint pair, according to the value of said elements, to establish an order of star pair matches; and in an order established by said sorted distance matrix, performing the further steps of: (a) selecting a star pair associated with a highest distance matrix element, to define a first element of a match core; (b) deleting from said distance matrix that element associated with said first element of said match core, to generate a reduced distance matrix; (c) selecting, from among candidate pairs of stars centered on neighbor nodes of the center nodes of said star pair in said first element of said match core, that candidate star pair which is both (i) consistent with said match core, and (ii) among all said candidate star pairs which are consistent with said match core, associated with a highest distance matrix element in said reduced distance matrix, to thereby generate a second element for said match core; (d) adding said second element to said match core as a further element; (e) deleting from said reduced distance matrix that one of said elements of said distance matrix associated with said candidate star pair added to said match core, to form a further reduced distance matrix; (f) repeating said steps of selecting that further star pair, adding, and deleting from said reduced distance matrix, at least until no more candidate star pairs consistent with the match core remain.
References Cited (Backward Citations)
US3611290A
Cited
US4135147A
Cited
US4310827A
Cited
EP0050842A2
Cited
US4944021A
Cited
US4817183A
Cited
US4947442A
Cited
US4936680A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-03-17 | 2000-09-16 | 2001-03-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-03-17 | 2004-09-16 | 2005-03-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-03-17 | 2008-09-16 | 2009-03-18 | $7700.00 | Window Closed / Lapsed |