Fingerprint matching by estimation of a maximum clique
US5933516A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Oct 28, 1997 |
| Grant date | Aug 3, 1999 |
| Priority date | — |
| Expiry date | Oct 28, 2017 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06V40/1371
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A base pair of minutia is selected in the latent fingerprint under consideration and each tenprint or reference fingerprint. For each selected base pair, those sets of minutia pairs are selected which satisfy apriori constraints including angle, distance and ridge counts, to generate a first set of minutia which support the fingerprint correspondence. A second set of the supporting minutia pairs is generated from the first set, which doesn't contain pairs which are inconsistent with the base pair/bias angle. A third set is established using "dynamic programming" to determine the largest topologically self-consistent subset of the second set. The minutia pairings are counted in the third set, to thereby establish a merit of the base pair. For each of the minutia of the latent fingerprint, a correspondence group is generated, of a predetermined number of minutia of the tenprint which have the greatest merit. The group is searched for a maximal clique in which every latent-tenprint minutia pair is consistent with every other minutia pair in the clique. A cardinality, equal to the number of latent-tenprint minutia pairs in the maximal clique, is stored. The steps are repeated, to gener…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.