Multimodal fusion decision logic system for determining whether to accept a specimen
First Claim
Patent Images
1. A method of deciding whether to accept a specimen, comprising:
- provide a data set having information pieces about objects, each object having a number of modalities, the number being at least two;
determine a first probability partition array (“
Pm(i,j)”
), the Pm(i,j) being comprised of probability values for information pieces in the data set, each probability value in the Pm(i,j) corresponding to the probability of an authentic match;
determine a second probability partition array (“
Pfm(i,j)”
), the Pfm(i,j) being comprised of probability values for information pieces in the data set, each probability value in the Pfm(i,j) corresponding to the probability of a false match;
identify a first index set (“
A”
), the indices in set A being the (i,j) indices that have values in both Pfm(i,j) and Pm(i,j);
identify a no-match zone (“
Z∞
”
) that includes the indices of set A for which Pm(i,j) is equal to zero, and use Z∞
to identify a second index set (“
C”
), the indices of C being the (i,j) indices that are in A but not Z∞
;
identify a third index set (“
Cn”
), the indices of Cn being the N indices of C which have the lowest λ
values, where λ
equals
2 Assignments
0 Petitions
Accused Products
Abstract
The present invention includes a method of deciding whether a data set is acceptable for making a decision. A first probability partition array and a second probability partition array may be provided. One or both of the probability partition arrays may be a Copula model. A no-match zone may be established and used to calculate a false-acceptance-rate (“FAR”) and/or a false-rejection-rate (“FRR”) for the data set. The FAR and/or the FAR may be compared to desired rates. Based on the comparison, the data set may be either accepted or rejected. The invention may also be embodied as a computer readable memory device for executing the methods.
-
Citations
16 Claims
-
1. A method of deciding whether to accept a specimen, comprising:
-
provide a data set having information pieces about objects, each object having a number of modalities, the number being at least two; determine a first probability partition array (“
Pm(i,j)”
), the Pm(i,j) being comprised of probability values for information pieces in the data set, each probability value in the Pm(i,j) corresponding to the probability of an authentic match;determine a second probability partition array (“
Pfm(i,j)”
), the Pfm(i,j) being comprised of probability values for information pieces in the data set, each probability value in the Pfm(i,j) corresponding to the probability of a false match;identify a first index set (“
A”
), the indices in set A being the (i,j) indices that have values in both Pfm(i,j) and Pm(i,j);identify a no-match zone (“
Z∞
”
) that includes the indices of set A for which Pm(i,j) is equal to zero, and use Z∞
to identify a second index set (“
C”
), the indices of C being the (i,j) indices that are in A but not Z∞
;identify a third index set (“
Cn”
), the indices of Cn being the N indices of C which have the lowest λ
values, where λ
equals - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer readable memory device having stored thereon instructions that are executable by a computer to decide whether to accept a specimen, the instructions causing a computer to:
-
provide a data set having information pieces about objects, each object having a number of modalities, the number being at least two; determine a first probability partition array (“
Pm(i,j)”
), the Pm(i,j) being comprised of probability values for information pieces in the data set, each probability value in the Pm(i,j) corresponding to the probability of an authentic match;determine a second probability partition array (“
Pfm(i,j)”
), the Pfm(i,j) being comprised of probability values for information pieces in the data set, each probability value in the Pfm(i,j) corresponding to the probability of a false match;identify a first index set (“
A”
), the indices in set A being the (i,j) indices that have values in both Pfm(i,j) and Pm(i,j);identify a no-match zone (“
Z∞
”
) that includes the indices of set A for which Pm(i,j) is equal to zero, and use Z∞
to identify a second index set (“
C”
), the indices of C being the (i,j) indices that are in A but not Z∞
;identify a third index set (“
Cn”
), the indices of Cn being the N indices of C which have the lowest λ
values, where λ
equals - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
Specification