Methods and systems for characterizing cardiac signal morphology using K-fit analysis
First Claim
Patent Images
1. A method for automatically analyzing a cardiac signal comprising the steps of:
- i) providing an episode database on a computer system including at least one episode data record, wherein each episode data record includes a cardiac signal from at least one data-generating device, wherein the cardiac signal has N beats;
ii) selecting a range of possible values for K;
iii) for each value of K, performing the following steps using a computer system;
(a) for each set S of K beats, perform the following steps;
1. for each beat b not in Set S, find which member s(b) of the set S is closest to b and calculate a morphology distance between s(b) and b;
2. for each beat b, calculate a morphology distance compilation value for each set S, wherein the morphology distances are used in calculating the morphology distance compilation value;
(b) compare the morphology distance compilation values to identify which set S of K beats results in the best representation of the cardiac signal based on the morphology distance compilation value; and
(c) record the set s of K beats that results in the best representation of the cardiac signal as a beat template for the value of K and record the morphology distance compilation value for the beat template;
iv) based on the morphology distance compilation values for each value of K, determine a best value of K for the cardiac signal where K beat templates can represent all the beats in the cardiac signal; and
v) output the best value of K for the cardiac signal.
1 Assignment
0 Petitions
Accused Products
Abstract
A system and method for automatically analyzing a cardiac signal, including the step of providing an episode database on a computer storage medium including a plurality of episode data records of one or more patients. Each episode data record includes a cardiac signal from at least one data-generating device. The method also includes the step of selecting one or more of the N beats to be one or more beat templates, for at least a first cardiac signal having N beats. Another step is determining a value K for the cardiac signal using a computer system where K beat templates can represent all the N beats in the cardiac signal.
122 Citations
15 Claims
-
1. A method for automatically analyzing a cardiac signal comprising the steps of:
-
i) providing an episode database on a computer system including at least one episode data record, wherein each episode data record includes a cardiac signal from at least one data-generating device, wherein the cardiac signal has N beats; ii) selecting a range of possible values for K; iii) for each value of K, performing the following steps using a computer system; (a) for each set S of K beats, perform the following steps; 1. for each beat b not in Set S, find which member s(b) of the set S is closest to b and calculate a morphology distance between s(b) and b; 2. for each beat b, calculate a morphology distance compilation value for each set S, wherein the morphology distances are used in calculating the morphology distance compilation value; (b) compare the morphology distance compilation values to identify which set S of K beats results in the best representation of the cardiac signal based on the morphology distance compilation value; and (c) record the set s of K beats that results in the best representation of the cardiac signal as a beat template for the value of K and record the morphology distance compilation value for the beat template; iv) based on the morphology distance compilation values for each value of K, determine a best value of K for the cardiac signal where K beat templates can represent all the beats in the cardiac signal; and v) output the best value of K for the cardiac signal. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A system for automatically analyzing a cardiac signal, comprising:
-
an episode database including a plurality of episode data records of one or more patients, wherein each episode data record includes a cardiac signal having N beats from at least one data-generating device; an adjudication processor configured to; i) for each value of K in a range of possible values of K, perform the following steps; (a) for each set S of K beats in the cardiac signal, perform the following steps; 1. for each beat b not in Set S, find which member s(b) of the set S is closest to b and calculate a morphology distance between s(b) and b; 2. for each beat b, calculate a morphology distance compilation value for each set S, wherein the morphology distances are used in calculating the morphology distance compilation value; (b) compare the morphology distance compilation values to identify which set S of K beats results in the best representation of the cardiac signal based on the morphology distance compilation value; and (c) record the set s of K beats that results in the best representation of the cardiac signal as a beat template for the value of K and record the morphology distance compilation value for the beat template; and ii) based on the morphology distance compilation values for each value of K, determine a best value of K for the cardiac signal where K beat templates can represent all the beats in the cardiac signal; and an output database comprising a best value of K for the cardiac signal. - View Dependent Claims (11, 12, 13, 14, 15)
-
Specification