Biometric subject verification based on electrocardiographic signals
First Claim
1. A method of authenticating or declining to authenticate an asserted identity of a candidate person (c-p), the method comprising:
- (i) initializing a count index c (c(initial)=0);
(ii) providing or receiving a sequence of N reference heart electrical action cycles, numbered n=1, . . . , N, of a known reference person, and forming a graph v(t;
n) representing each provided heart cycle for the reference person;
(iii) randomly choosing K heart cycle graphs, numbered k=1, 2, . . . , K (3≦
K≦
N) of the provided reference heart cycles, comparing each chosen heart cycle graph v(t;
k) with each of the other chosen heart cycle graphs, and identifying a pair of graphs, v(t;
k1) and v(t;
k2), for which ρ
1(k1;
k2) is a maximum value, where ρ
1 is a first numerical-valued, graph comparison metric that compares two heart cycle graphs, v(t;
k′
) and v(t;
k″
), and provides a first numerical metric value ρ
1(k′
;
k″
) that is a measure of how closely the two graphs resemble each other;
(iv) forming a composite heart cycle graph, denoted v(t;
k12), using graph values associated with the graphs v(t;
k1) and v(t;
k2);
(v) determining when at least a first selected fraction f1 (0.5≦
f1<
1) of the N heart cycle graphs resemble the composite graph, according to a first condition ρ
1(k12;
n)−
(thr1)=D1, with D1 being always non-negative or always non-positive, where (thr1) is a selected first metric threshold value;
(vi) when at least the selected fraction f1 of the N heart cycle graphs resemble each other according to the first condition, creating or providing a reference heart cycle graph v(t;
ref)=v(t;
k12);
for the reference person;
(vii) when at least the fraction f1 of the N heart cycle graphs do not resemble each other, incrementing the count index (c→
c+1) to provide an incremented count index;
(viii) when the incremented count index c is not greater than a selected maximum index value c(max), returning to step (iii) and repeating steps (iii)-(viii) at least once; and
(ix) when the incremented count index satisfies c>
c(max), interpreting this condition as indicating that it is not possible to create a reference heart cycle graph for the reference person.
2 Assignments
0 Petitions
Accused Products
Abstract
A method of authenticating or declining to authenticate an asserted identity of a candidate-person. In an enrollment phase, a reference PQRST heart action graph is provided or constructed from information obtained from a plurality of graphs that resemble each other for a known reference person, using a first graph comparison metric. In a verification phase, a candidate-person asserts his/her identity and presents a plurality of his/her heart cycle graphs. If a sufficient number of the candidate-person'"'"'s measured graphs resemble each other, a representative composite graph is constructed from the candidate-person'"'"'s graphs and is compared with a composite reference graph, for the person whose identity is asserted, using a second graph comparison metric. When the second metric value lies in a selected range, the candidate-person'"'"'s assertion of identity is accepted.
-
Citations
24 Claims
-
1. A method of authenticating or declining to authenticate an asserted identity of a candidate person (c-p), the method comprising:
-
(i) initializing a count index c (c(initial)=0); (ii) providing or receiving a sequence of N reference heart electrical action cycles, numbered n=1, . . . , N, of a known reference person, and forming a graph v(t;
n) representing each provided heart cycle for the reference person;(iii) randomly choosing K heart cycle graphs, numbered k=1, 2, . . . , K (3≦
K≦
N) of the provided reference heart cycles, comparing each chosen heart cycle graph v(t;
k) with each of the other chosen heart cycle graphs, and identifying a pair of graphs, v(t;
k1) and v(t;
k2), for which ρ
1(k1;
k2) is a maximum value, where ρ
1 is a first numerical-valued, graph comparison metric that compares two heart cycle graphs, v(t;
k′
) and v(t;
k″
), and provides a first numerical metric value ρ
1(k′
;
k″
) that is a measure of how closely the two graphs resemble each other;(iv) forming a composite heart cycle graph, denoted v(t;
k12), using graph values associated with the graphs v(t;
k1) and v(t;
k2);(v) determining when at least a first selected fraction f1 (0.5≦
f1<
1) of the N heart cycle graphs resemble the composite graph, according to a first condition ρ
1(k12;
n)−
(thr1)=D1, with D1 being always non-negative or always non-positive, where (thr1) is a selected first metric threshold value;(vi) when at least the selected fraction f1 of the N heart cycle graphs resemble each other according to the first condition, creating or providing a reference heart cycle graph v(t;
ref)=v(t;
k12);
for the reference person;(vii) when at least the fraction f1 of the N heart cycle graphs do not resemble each other, incrementing the count index (c→
c+1) to provide an incremented count index;(viii) when the incremented count index c is not greater than a selected maximum index value c(max), returning to step (iii) and repeating steps (iii)-(viii) at least once; and (ix) when the incremented count index satisfies c>
c(max), interpreting this condition as indicating that it is not possible to create a reference heart cycle graph for the reference person. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
24. A method of authenticating or declining to authenticate an asserted identity of a candidate-person, the method comprising:
-
(i) initiating a count index c′
(c′
(initial)=0);(ii) receiving an assertion, by a candidate-person (c-p), that the candidate-person is identical with a specified reference person; (iii) providing a sequence of N′
heart electrical action cycles of the candidate-person, and forming a c-p heart cycle graph representing each provided c-p heart cycle;(iv) randomly choosing K′
graphs, numbered k′
=1, 2, . . . , K′
(3≦
K′
≦
N) of the provided c-p heart cycles, and comparing each chosen c-p heart cycle graph with each of the other chosen c-p heart cycle graphs;(v) determining whether a majority K′
M of the K′
c-p heart cycle graphs resemble each other, according to a second selected numerical-valued, graph comparison metric ρ
2 that compares two heart cycle graphs, k′
=k″ and
k′
=k″
′
, and provides a second graph comparison metric value ρ
2(k″
;
k″
′
) for the comparison;(vi) when the majority K′
M of the K′
c-p heart cycle graphs resemble each other, providing a representative c-p heart cycle graph representing the majority K′
M of the chosen c-p heart cycle graphs;(vii) providing a reference heart cycle graph that corresponds to the identity asserted by the candidate-person; (viii) comparing the representative c-p heart cycle graph with the reference heart cycle graph, using the second graph comparison metric ρ
2(rep;
ref), applied to the representative heart cycle graph and to the reference heart cycle graph;(ix) when the value ρ
2(rep;
ref) provided by the second metric ρ
2 satisfies ρ
2(rep;
ref)−
ρ
2(thr2)=D2, where ρ
2(thr2) is a second selected threshold value and D2 is a real number that is always non-negative or that is always non-positive, interpreting this condition as indicating that the candidate-person is likely to be the reference person;(x) when the value provided by the second metric ρ
2c does not satisfy the condition ρ
2(rep;
ref)−
ρ
2(thr2)=D2, with D2 always non-negative or D2 always non-positive, interpreting this condition as indicating that the candidate-person is not likely to be the reference person;(xi) when the majority K′
M of the N′
c-p heart cycle graphs do not resemble each other, incrementing the count index c′
(c′
→
c′
+1);(xii) when the incremented count index c′
is no greater than a selected maximum index value c′
(max), returning to step (iv); and(xiii) when the incremented count index c′
satisfies c′
>
c′
(max), interpreting this condition as indicating that it is not possible to create a representative heart cycle graph for the candidate-person.
-
Specification