Patent US6185318B1 successfully refreshed from Google Patents.
US6185318B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for matching (fingerprint) images an aligned string-based representation
Assignee: Uniloc 2017 LLC
•
Filing: 1998-02-25
•
Granted: 2001-02-06
•
Expires: 2018-02-25
Abstract
Abstract The invention is a system and method for matching a two dimensional pattern of lines, e.g. a fingerprint, by creating a one dimensional representation of one or more points (e.g., minutiae) on the lines in the patterns to be matched. The one dimensional representations are created by finding a corresponding reference point (minutiae) in each of the patterns and creating an index of other points in each of the respective patterns with respect to the reference point (minutiae). The indexes are adaptively compared taking into account the elastic distortions of the lines.
Inventors
- 👤 Anil K. Jain
- 👤 Lin Hong
- 👤 Rudolf Maarten Bolle
- 👤 Sharathchandra Umapathirao Pankanti
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:58
CPC Classifications
G; G06; G06V; G06V40/00; G06V40/10; G06V40/12; G06V40/1365
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
315 words
A system for determining a correspondence between two or more images, comprising: a computer having one or more central processing units (CPUs) and a memory; a first image stored in the memory, the first image having one or more first sets of one or more first points, one or more of the first points in each of the first sets located on a respective first curved line; one or more second images stored in the memory, the second image having one or more second sets of one or more second points, one or more of the second points in each of the second sets located on a respective second curved line; a reference point matcher, executed by the CPU, that determines a correspondence between a first reference point and a second reference point, the first reference point being one of the first points and the second reference point being one of the second points; a string representor, executed by the CPU, that represents the first image in as a first string of first tuples with a linear first order and represents the second image in as a second string of second tuples with a linear second order, each first tuple associated with one of the first points, each second tuple associated with one of the second points, the first tuples having first attributes determined by a first relationship between the first reference point and the respective first point, and the second tuples having second attributes determined by a second relationship between the second reference point and the respective second point, the first order being the same as the second order and the first relationship being the same as the second relationship; and a matcher that determines that the first and second image match using a score determined by a minimum cost of the combined incremental cost associated with each pair of first and second tuples.
Claim 2
Independent Claim
315 words
A system for determining a correspondence between two or more images, comprising: a computer having one or more central processing units (CPUs) and a memory; a first image stored in the memory, the first image having one or more first sets of one or more first points, one or more of the first points in each of the first sets located on a respective first curved line; one or more second images stored in the memory, the second image having one or more second sets of one or more second points, one or more of the second points in each of the second sets located on a respective second curved line; a reference point matcher, executed by the CPU, that determines a correspondence between a first reference point and a second reference point, the first reference point being one of the first points and the second reference point being one of the second points; a string representor, executed by the CPU, that represents the first image in as a first string of first tuples with a linear first order and represents the second image in as a second string of second tuples with a linear second order, each first tuple associated with one of the first points, each second tuple associated with one of the second points, the first tuples having first attributes determined by a first relationship between the first reference point and the respective first point, and the second tuples having second attributes determined by a second relationship between the second reference point and the respective second point, the first order being the same as the second order and the first relationship being the same as the second relationship; and a matcher that determines that the first and second image match using a score determined by a minimum cost of the combined incremental cost associated with each pair of first and second tuples.
Claim 3
Dependent Claim
28 words
A system, as in claim 1 , where the minimum cost is the sum of the incremental costs of the pairs of first tuples that match second tuples.
Claim 4
Dependent Claim
32 words
A system, as in claim 2 , where the minimum cost is further determined by adding an incremental penalty cost for each pair of first and second tuples that do not match.
Claim 5
Dependent Claim
18 words
A system, as in claim 3 , where the incremental penalty cost is greater than the incremental cost.
Claim 6
Dependent Claim
27 words
A system, as in claim 2 , where one of the first tuples matches one of the second tuples when the first and second tuples are consistent.
Claim 7
Dependent Claim
25 words
A system, as in claim 5 , where the tuples are consistent and all of respective attributes of the tuples are within an attribute tolerance.
Claim 8
Dependent Claim
18 words
A system, as in claim 6 , where the attribute tolerance varies to provide an adaptive consistency measure.
Claim 9
Dependent Claim
38 words
A system, as in claim 7 , where one or more attribute tolerances vary as determined by a difference of one or more attributes of one or more pairs of first and second tuples that were match previously.
Claim 10
Dependent Claim
24 words
A system, as in claim 2 , where a pair of first and second tuples that match are removed from consideration in future matches.
Claim 11
Dependent Claim
43 words
A system, as in claim 2 , where one of the first tuples does not match one of the second tuples when the first and second tuples are inconsistent and the inconsistent pair of first and second tuples is given a penalty cost.
Claim 12
Dependent Claim
54 words
A system, as in claim 2 , where the first tuple is chosen in the first order and the second tuple is chosen in the second order and the position of the second tuple in the second order in greater than or equal to the position of the first tuple in the first order.
References Cited (Backward Citations)
US4151512A
Cited
US4310827A
Cited
US4641349A
Cited
US4817183A
Cited
US5524161A
Cited
US5140642A
Cited
US5493621A
Cited
US5631972A
Cited
US6041133A
Cited
US6038334A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-02-06 | 2004-08-07 | 2005-02-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-02-06 | 2008-08-07 | 2009-02-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-02-06 | 2012-08-07 | 2013-02-06 | $7700.00 | Window Closed / Lapsed |