Matcher
First Claim
1. A matcher improvement for matching a set of Search identification points against a set of File identification points employing a difference table, comprising:
- first memory means for storing a set of Search identification points as a set of binary value signals,second memory means for storing a set of File identification points as a set of binary value signals,multiple comparator means, each of said comparator means being coupled to a predetermined subset of said Search identification points and to a corresponding predetermined subset of said File identification points, each of said multiple comparative means having;
(i) differencing means to provide a first difference table and a first proximity value for each entry on said difference table,(ii) constant adjustament means to provide a difference plane translation of that entry in said difference table which has the highest proximity value to the origin of the difference plane represented by said difference table, all of the entries in said difference table being translated by the same amount,(iii) differential adjustment means to differentially adjust each entry in said difference table as a function of the distance between the Search point of the entry being adjusted and the Search point of the entry having the highest proximity value,(iv) means to provide a final set of proximity values based on the difference table provided by said constant and said differential adjustment means, and(v) means to provide at least one figure of merit based on said final set of proximity values for the Search subset involved, andmeans to combine said figures of merit from each of said subsets to provide at least one overall figure of merit indicating the degree of match between said set of Search points and said set of File points.
3 Assignments
0 Petitions
Accused Products
Abstract
A set of Search identification points derived from an optical scan of a finger are compared against File identification points for the same finger. A multiple comparator divides the finger image into multiple segments. The Search and File points from each segment are compared separately. A difference table (D.T.) provides a proximity value Q for each search point. The D.T. is purged of all entries representing multiple Search points. The purge keeps those entries having the highest Q value. The purged D.T. with recalculated Q values is the basis for correcting the position of each Search point on the image plane to compensate for shift in finger position and for the variable distortion and changes that come about in a finger over time and upon successive applications of the finger to input scan. The corrected Search points are compared against the File points to establish a new D.T. A proximity value Q for each entry on this D.T. is calculated and a proximity value Q for the entire table is calculated. These proximity values in view of the number of entries on the difference table are used to verify identification in a scoring routine.
-
Citations
19 Claims
-
1. A matcher improvement for matching a set of Search identification points against a set of File identification points employing a difference table, comprising:
-
first memory means for storing a set of Search identification points as a set of binary value signals, second memory means for storing a set of File identification points as a set of binary value signals, multiple comparator means, each of said comparator means being coupled to a predetermined subset of said Search identification points and to a corresponding predetermined subset of said File identification points, each of said multiple comparative means having; (i) differencing means to provide a first difference table and a first proximity value for each entry on said difference table, (ii) constant adjustament means to provide a difference plane translation of that entry in said difference table which has the highest proximity value to the origin of the difference plane represented by said difference table, all of the entries in said difference table being translated by the same amount, (iii) differential adjustment means to differentially adjust each entry in said difference table as a function of the distance between the Search point of the entry being adjusted and the Search point of the entry having the highest proximity value, (iv) means to provide a final set of proximity values based on the difference table provided by said constant and said differential adjustment means, and (v) means to provide at least one figure of merit based on said final set of proximity values for the Search subset involved, and means to combine said figures of merit from each of said subsets to provide at least one overall figure of merit indicating the degree of match between said set of Search points and said set of File points. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. The machine method of automatically matching a set of File identification points against a set of Search identification points employing a difference table, comprising:
-
storing a set of Search identification points, as a set of binary value signals, in a first memory means, storing a set of File identification points, as a set of binary value signals, in a second memory means, segmenting said set of Search points and said set of File points into predetermined corresponding subsets, for each of said corresponding Search and File subsets, comparing the individual Search and File points, said step of comparing, including; (i) providing a first difference table for the corresponding set of Search and File points, said difference table having a first proximity value for each entry therein, (ii) shifting the entry on said difference table having the highest proximity value to the origin of the difference plane represented by said difference table, and shifting all of the other entries on said difference table by the same amount, and (iii) then differentially adjusting each of said entries on said difference table as a function of the distance between the Search point of the entry being adjusted and the Search point of the entry having the highest proximity value, (iv) providing a final set of proximity values for the difference table provided by said steps of shifting and differentially adjusting, and (v) providing at least one figure of merit based on said final set of proximity values for the Search subset involved, and combining said figures of merit from each of said Search subsets to provide at least one overall figure of merit indicating the degree of match between said set of Search points and said set of File points. - View Dependent Claims (15, 16, 17, 18, 19)
-
Specification