Abstract:
A method of automatically determining which type of treatment is most appropriate for a cardiac arrest victim, the method comprising transforming one or more time domain electrocardiogram (ECG) signals into a frequency domain representation comprising a plurality of discrete frequency bands, combining the discrete frequency bands into a plurality of analysis bands, wherein there are fewer analysis bands than discrete frequency bands, 
     determining the content of the analysis bands, and determining the type of treatment based on the content of the analysis bands.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a divisional application of and claims priority to U.S. application Ser. No. 10/844,253, filed on May 12, 2004, now U.S. Pat. No. 7,565,194, issued on Jul. 21, 2009. 
    
    
     TECHNICAL FIELD 
     This invention relates to the field of cardiac resuscitation, and in particular to devices for assisting rescuers in performing cardio-pulmonary resuscitation (CPR). 
     BACKGROUND 
     The heart relies on an organized sequence of electrical impulses in order to beat effectively. Any deviation from this normal sequence is known as “arrhythmia.” A class of devices includes signal processing software that analyzes electrocardiography (ECG) signals acquired from the victim to determine when a cardiac arrhythmia such as ventricular fibrillation (VF) or shockable ventricular tachycardia (VT) exists. These devices include automated external defibrillators (AEDs), ECG rhythm classifiers, or ventricular arrhythmia detectors. An AED is a device that literally “talks” the provider through a process of evaluating a patient for, attaching the patient to, and activating, the AED therapy. This device is capable of recognizing the two distinct cardiac waveforms: VT and VF. 
     VT is a tachydysrhythmia originating from a ventricular ectopic focus, characterized by a rate typically greater than 120 beats per minute and wide QRS complexes. VT may be monomorphic (typically regular rhythm originating from a single focus with identical QRS complexes) or polymorphic (unstable, may be irregular rhythm, with varying QRS complexes). An example rhythm for an unstable VT is illustrated in  FIG. 1A . Depending on the rate and the length of time that the VT has been sustained, a heart in the VT state may or may not produce a pulse (i.e., pulsatile movement of blood through the circulatory system). The cardiac activity still has some sense of organization (note that the “loops” are all basically the same size and shape). If there is no pulse associated with this VT rhythm, then the VT is considered to be unstable and a life threatening condition. An unstable VT can be treated with an electrical shock or defibrillation. 
     Supraventricular tachycardia (SVT) is a rapid heartbeat that begins above the hearts lower chambers (the ventricles). SVT is an abnormally fast heart rhythm that begins in one of the upper chambers of the heart (atria), a component of the heart&#39;s electrical conduction system called the atrioventricular (AV) node, or both. Although SVT is rarely life-threatening, the symptoms which include a feeling of a racing heart, fluttering or pounding in the chest or extra heartbeats (palpitations), or dizziness can be uncomfortable. 
     VF is usually an immediate life threat. VF is a pulseless arrhythmia with irregular and chaotic electrical activity and ventricular contraction in which the heart immediately loses its ability to function as a pump. VF is the primary cause of sudden cardiac death (SCD). An example rhythm for VF is illustrated in  FIG. 1B . This waveform does not have a pulse associated with it. There is no organization to this rhythm (note the irregular size and shape of the loops.) The pumping part of the heart is quivering like a bag of worms, and it is highly unlikely that this activity will move any blood. The corrective action for this rhythm is to defibrillate the heart using an electrical charge. 
     A normal heart beat wave starts at the sinoatrial node (SA node) and progresses toward the far lower corner of the left ventricle. 
     A massive electrical shock to the heart can correct the VF and unstable VT rhythms. This massive electrical shock can force all the cardiac cells in the heart to depolarize at the same time. Subsequently, all of the cardiac cells go into a short resting period. The hope is that the sinoatrial node (SA node) will recover from this shock before any of the other cells, and that the resulting rhythm will be a pulse producing rhythm if not normal sinus rhythm. 
     For AEDs, algorithms to recognize the two waveforms VT and VF are designed to perform ECG analyses at specific times during a rescue event of a patient using defibrillation and cardio-pulmonary resuscitation (CPR). The first ECG analysis is usually initiated within a few seconds following attachment of the defibrillation electrodes to the patient. Subsequent ECG analyses may or may not be initiated based upon the results of the first analysis. Typically, if the first analysis detects a shockable rhythm, the rescuer is advised to deliver a defibrillation shock. Following the shock delivery, a second analysis is automatically initiated to determine whether the defibrillation treatment was successful or not (i.e., the shockable ECG rhythm has been converted to a normal or other non-shockable rhythm). If this second analysis detects the continuing presence of a shockable arrhythmia, the AED advises the user to deliver a second defibrillation treatment. A third ECG analysis may then be initiated to determine whether the second shock was or was not effective. If a shockable rhythm persists, the rescuer is then advised to deliver a third defibrillation treatment. 
     Following the third defibrillator shock or when any of the analyses described above detects a non-shockable rhythm, treatment protocols recommended by the American Heart Association and European Resuscitation Council require the rescuer to check the patient&#39;s pulse or to evaluate the patient for signs of circulation. If no pulse or signs of circulation are present, the rescuer is trained to perform CPR on the victim for a period of one or more minutes. The CPR includes rescue breathing and chest compressions. Following this period of CPR, the AED reinitiates a series of up to three additional ECG analyses interspersed with appropriate defibrillation treatments as described above. The sequence of three ECG analyses/defibrillation shocks followed by 1-3 minutes of CPR, continues in a repetitive fashion for as long as the AED&#39;s power is turned on and the patient is connected to the AED device. Typically, the AED provides audio prompts to inform the rescuer when analyses are about to begin, what the analysis results were, and when to start and stop the delivery of CPR. 
     One limitation associated with many AEDs is that current automated ECG rhythm analysis methods cannot function with extra noise due to CPR chest compressions. Thus, conventional practice is to interrupt chest compressions while performing ECG rhythm analysis. Long interruptions of chest compressions have been shown to result in higher failure rate of resuscitation. Many studies have reported that the discontinuation of precordial compression can significantly reduce the recovery rate of spontaneous circulation and 24-hour survival rate. These studies include “Adverse effects of interrupting precordial compression during cardio-pulmonary resuscitation” by Sato et al. (Critical Care Medicine, Volume 25(5), May 1997, pp 733-736), “Adverse Outcomes of Interrupted Precordial Compression During Automated Defibrillation” by Yu et al. (Circulation, 2002), and “Predicting Outcome of Defibrillation by Spectral Characterization and Nonparametric Classification of Ventricular Fibrillation in Patients With Out-of-Hospital Cardiac Arrest” by Eftestøl et al. (Circulation, 2002). Thus, it is useful to recognize abnormal heart rhythms during chest compressions. 
     There is recent clinical evidence showing that performing chest compressions prior to defibrillation under some circumstances can be beneficial. Specifically, it is clinically beneficial to treat a patient with chest compressions prior to defibrillation if the response times of the medical emergency system result in a delay of more than four minutes such that the patient is in cardiac arrest for more than four minutes. If the response times of the medical emergency system result in a capability to treat the patient in sooner than a four minute delay, it can be better for the patient to be treated with defibrillation first. Methods have been developed to determine from the ECG waveform both whether the patient has been in cardiac arrest for longer than the 4 minutes as well as time independent measures of when the most optimal time is to shock. “Non-invasive monitoring and treatment of subjects in cardiac arrest using ECG parameters predictive of outcome” by Brown and Dzwonczyk (U.S. Pat. No. 5,683,424) describes methods to determine from the ECG waveform whether the patient has been in cardiac arrest for longer than the 4 minutes. “Method and system for predicting the immediate success of a defibrillatory shock during cardiac arrest” (U.S. Pat. No. 6,171,257 by Weil et al.) and “Ventricular Fibrillation Scaling Exponent Can Guide Timing of Defibrillation and Other Therapies” by Menegazzi et al. (2004 American Heart Association, Inc.) describe time independent measures of when the most optimal time is to shock. These algorithms use spectral analysis of the ECG to predict defibrillation shock success in some manner. Current methods utilizing spectral analysis of the ECG for chest compression artifact rejection, defibrillation success prediction, and therapeutic decision-making typically specify a set of parameters in the ECG frequency spectrum to be detected. For example, U.S. Pat. No. 5,683,424 compares a centroid or a median frequency or a peak power frequency from a calculated frequency spectrum of the ECG to thresholds to determine if a defibrillating shock is necessary. These parameters do not uniquely specify the frequency or time domain characteristics. For example, the median frequency of the ECG spectrum for almost all patients in ventricular fibrillation decreases initially then increases again after several minutes, making it difficult to use median frequency to predict how long a patient has been in cardiac arrest. Thus, the patient can have the same median frequency at widely differing durations of cardiac arrest. Using amplitudes of the frequency spectrum of the ECG can be limited because the amplitudes are dependent on both the cardiac electrical output as well as position of the ECG lead electrodes on the patient. 
     Some conventional automated ECG rhythm analysis methods detect VF and other arrhythmic heart rhythms by using spectral analysis of the ECG signals with the assumption that the difference in the power spectrum between ECGs of normal heart rhythms and abnormal rhythms is such that during the abnormal rhythm the ECG is concentrated or mainly sinusoidal in a narrow band of frequencies between 4 and 7 Hz, while in normal rhythm the ECG is a broadband signal with major harmonics up to at least 25 Hz. For example, “Comparison of four techniques for recognition of ventricular fibrillation from the surface” by Clayton et al. (ECG Medical &amp; Biological Engineering &amp; Computing 1993; 31:111-117) and “Algorithmic sequential decision-making in the frequency domain for life threatening ventricular arrhythmias and imitative artifacts: a diagnostic system” by Barro et al. (Journal of Biomedical Engineering, 1989, Volume 11) analyze the frequency domain of the ECG to check if the ECG is mainly sinusoidal in the narrow band of frequencies. One problem with these conventional methods is that CPR changes the assumption behind the methods so that VF and other dangerous rhythms cannot be typically detected during chest compressions. 
     Adaptive filters have been used in many studies to remove the artifact due to CPR chest compression from the ECG signal. These studies include “CPR Artifact Removal from Human ECG Using Optimal Multichannel Filtering “by Aase et al. (IEEE Transactions on Biomedical Engineering, Vol. 47, No. 11, November 2000), “Removal of Cardiopulmonary Resuscitation Artifacts From Human ECG Using an Efficient Matching Pursuit-Like Algorithm” by Husøy et al. (IEEE Transactions on Biomedical Engineering, Vol. 49, No. 11, November 2002), “and U.S. Pat. No. 6,390,996 by Halperin et al (2002). The adaptive filters use compression depth and thoracic impedance as reference signals to estimate the artifacts in the ECG signal. The adaptive filter&#39;s parameters are updated by calculating the inverse of a cross-correlation matrix or the auto- and cross-spectra of the signal. The artifacts could be reduced when these adaptive filters were applied. However, there is usually a significant part of the artifact left in the estimated ECG signal. Moreover, the adaptive-filter algorithm sometimes has a high computational complexity. 
     These adaptive filtering methods use the compression depth as the reference signal to remove the chest compression artifact from the ECG signals. This is based on the assumption that the chest compression artifact is correlated with the reference signal (compression depth) and independent of the desired ECG signal. This can be true for an infinitely long ECG signal but the estimated coefficients can be biased if a limited length of the ECG signal is applied. It is also possible that the reference signals (such as the compression depth) can provide only part of the information about the CPR artifact presented in the ECG signal, i.e. the noise-reduction ability of the adaptive filter is limited by its knowledge of the noise. Fitzgibbon et al. in “Determination of the noise source in the electrocardiogram during cardiopulmonary resuscitation” (Critical Care Medicine 2002 Vol. 30, No. 4) reported that the thoracic impedance variation due to ventilation or chest compression has little correlation with the artifact in ECG recording during chest compressions. Fitzgibbon et al. (2002) further suggested that the source of the noise in the signal during chest compressions is the electrode motion and related to the electrode&#39;s electrical properties, which makes the relation between the noise and the compression depth more complicated. Thus, the artifact cannot be sufficiently attenuated for satisfactory results with the conventional advisory algorithm for fibrillation detection. 
     One method for evaluating medical tests is to determine a test&#39;s ability to correctly detect disease, also known as sensitivity, and the test&#39;s ability to avoid labeling normal things as disease, also known as specificity. Ideally, a medical test has 100% sensitivity and 100% specificity. When a medical test is imperfect, sensitivity and specificity are plotted on a graph called a receiver-operator characteristics (ROC) curve. Variables in the medical test can be chosen such that the resulting point of the medical test on the ROC curve is closest to a point with 100% sensitivity and 100% specificity. 
     SUMMARY 
     In general, the invention features a method of automatically determining which type of treatment is most appropriate for a cardiac arrest victim, the method comprising transforming one or more time domain electrocardiogram (ECG) signals into a frequency domain representation comprising a plurality of discrete frequency bands, combining the discrete frequency bands into a plurality of analysis bands, wherein there are fewer analysis bands than discrete frequency bands, determining the content of the analysis bands, and determining the type of treatment based on the content of the analysis bands. 
     In preferred implementations, one or more of the following features may be incorporated. Transforming may comprise the Fourier transform. Transforming may comprise a Wavelet transform. Transforming may comprise a Radon transform. Determining the content of the analysis bands may comprise determining a plurality of values. The content and the plurality of values may be calculated at more than two points in time, and wherein the sequence of plurality of values in time may define a trajectory. The trajectory may be analyzed using estimation and prediction methods. The analysis method may involve use of a recursive filter. The recursive filter may be a Kalman filter. The analysis method may involve use of a Particle Filter. The analysis of the trajectory may be used to predict defibrillation success. The analysis of the trajectory may be used to determine whether it is appropriate to defibrillate or deliver an alternative therapy such as chest compressions, drugs such as epinephrine, constitutive nutrients such as glucose, or other electrical therapy such as pacing. A mathematical transformation may be performed on the trajectory. The transformation may be a projection of the trajectory onto a plane within the parameter space. Image mensuration algorithms may be employed to evaluate the features of the two dimensional projection of the trajectory. The content may comprise at least two parameters descriptive of the content of an analysis band from the analysis bands. Determining the content of an analysis band may comprise quantifying the energy within an analysis band. Quantifying the energy within an analysis band may comprise determining at least one number characterizing the energy of the highest peak within the band. Quantifying the energy with an analysis band may comprise determining an overall or average energy for the band. The invention further comprises analyzing the variation over time of the content of the analysis bands. The bands may be about 0.5 Hz in width. The bands may be of unequal widths such that additional resolution is provided for frequency bands that are of greater importance in the analysis. Frequencies less than 3 Hz may be subdivided into bands whose widths are larger than those in the 6-12 Hz frequency range. Each band may be composed of an aggregation of multiple spectral measurements. Characteristics of the distribution of spectral measurements within the band may include at least one of the following descriptors: mean spectral energy, spectral energy variance, median spectral energy, maximum spectral energy, or minimum spectral energy. 
     In a second aspect, the invention features a method of automatically determining which type of treatment is most appropriate for a cardiac arrest victim, the method comprising transforming one or more time domain ECG signals into a frequency domain generally containing a plurality of peaks, processing the frequency domain representation to characterize at least a plurality of the peaks, wherein characterizing a peak comprises determining a plurality of parameters characterizing the peak, and determining the type of treatment based on the parameters characterizing at least some of the peaks. 
     In preferred implementations, one or more of the following features may be incorporated. The invention may further comprise analyzing the variation over time of at least some of the plurality of parameters characterizing at least some of the plurality of peaks. The content and the plurality of values may be calculated at more than two points in time, and wherein the sequence of plurality of values in time may define a trajectory. The trajectory may be analyzed using estimation and prediction methods. The analysis method may involve use of a recursive filter. The recursive filter may be a Kalman filter. The analysis method may involve use of a Particle filter. The analysis of the trajectory may be used to predict defibrillation success. The analysis of the trajectory may be used to determine whether it is appropriate to defibrillate or deliver an alternative therapy such as chest compressions, drugs such as epinephrine, constitutive nutrients such as glucose, or other electrical therapy such as pacing. A mathematical transformation may be performed on the trajectory. The transformation may be a projection of the trajectory onto a plane within the parameter space. Image mensuration algorithms may be employed to evaluate the features of the two dimensional projection of the trajectory. Analyzing the variation over time may comprise determining variation in the frequency of a peak. Determining a plurality of parameters characterizing the peak may comprise estimating a shape of the peak. Estimating a shape of the peak may comprise using a non-linear curve fitting routine. The plurality of the peaks may comprise a largest amplitude frequency peak and peaks having a fraction of an amplitude of the largest amplitude frequency peak. The parameters may comprise a frequency of a peak, an amplitude of the peak, and a width of the peak. The parameters may comprise a depth of the peak. The parameters may comprise a variance of the peak. The parameters may comprise a first moment of the peak. The invention further comprises determining a reference frequency from the frequency domain and determining a variance of the energy of the frequency domain using the reference frequency. The invention may also further comprise determining that the victim is in a sinus arrhythmic state if the variance of the energy of the frequency representation is below a threshold. The reference frequency is one of a mean frequency, a median frequency, a center frequency, and a peak frequency. Determining the type of treatment may comprise determining that the type of treatment is to defibrillate the victim&#39;s heart if the following conditions are met: the victim is determined to be in the sinus arrhythmic state, a frequency of a largest amplitude frequency peak is less than a first threshold, and the number of peaks is less than a second threshold. Determining the type of treatment may comprise determining that the type of treatment is chest compressions to the victim if the following conditions are met: the victim is determined to be in the sinus arrhythmic state and a frequency of a largest amplitude frequency peak is greater than a first threshold and if the number of peaks is less than a second threshold. Determining the type of treatment may comprise determining that the type of treatment is monitoring the victim or drug therapy if the following conditions are met: the victim is determined to be in the sinus arrhythmic state, and the number of peaks is greater than a threshold. Determining parameters may comprise measuring a change of one or more parameters of the peaks in a range of the frequency spectrum over multiple digital time samples. Each peak may be considered to retain an identity over the multiple digital time samples if its amplitude and frequency do not change more than a threshold from one time sample to a subsequent time sample. Determining the type of treatment may comprise comparing an oscillation cycle rate of the change to a cycle rate band and if the cycle rate is in the band, determining that the type of treatment is to defibrillate the victim&#39;s heart. Determining the type of treatment may further comprise determining that a defibrillating shock to the victim&#39;s heart is suitable therapy when the oscillation is at or near a maximum. For two or more peaks the change may be a relative decrease, and wherein determining the type of treatment may comprise comparing the relative decrease to a threshold, and if the relative decrease is above the threshold, the type of treatment may be chest compressions and then defibrillation. The one or more parameters may comprise amplitudes of the peaks, the threshold may be about fifteen percent, and the multiple digital time samples may cover at least a ten second interval. For two or more peaks, the change may be a relative increase, the parameters may comprise frequency of the peaks, amplitude of the peaks, or width of the peaks, and wherein determining the type of treatment may comprise comparing the relative increase to a threshold, and if the relative increase is above the threshold, the type of treatment may be defibrillation. For two or more peaks, the change may be a decrease, and the parameters may comprise variance of the frequency of the peaks, and wherein determining the type of treatment may comprise comparing the decrease to a threshold, and if the decrease is below a threshold, the type of treatment may be defibrillation. The range of the frequency spectrum may be six to twelve Hertz. The invention may further comprise communicating the type of treatment to one of a drug infusion device, a portable chest compression device, and a ventilator. The invention may also further comprise displaying an indication of the type of treatment. Displaying an indication of the type of treatment may comprise displaying a value of an estimation of an accuracy of the type. 
     In a third aspect, the invention features a method of automatically determining which type of treatment is most appropriate for a cardiac arrest victim, the method comprising transforming one or more time domain ECG signals into a frequency domain representation, processing the frequency domain representation to characterize the content of the frequency domain representation in a band from about 6 to about 12 Hz, and determining the type of treatment based on the content in the band. 
     In preferred implementations, one or more of the following features may be incorporated. The invention may further comprise relying on a ventricular fibrillation (VF) or a ventricular tachycardia (VT) advisory algorithm to determine whether the victim is in VF or VT, and wherein determining the type of treatment may comprise determining when to deliver a shock. The content in the band may comprise a quantitative measure representative of approximately the total energy in the band. 
     In a fourth aspect, the invention features a method of automatically determining which type of treatment is appropriate for a cardiac arrest victim, the method comprising measuring at least one physiological signal, determining at least two parameters related to the at least one physiological signal, the at least two parameters forming a parameter set, repeating the measurement and calculation at more than two points in time to create a sequence of parameter sets, wherein the sequence of parameter sets defines a trajectory, and analyzing the trajectory using estimation and prediction methods that comprise the use of a recursive filter. 
     In preferred implementations, one or more of the following features may be incorporated. The recursive filter may be a Kalman filter. The analysis method may involve use of a Particle filter. The analysis of the trajectory may be used to predict defibrillation success. The analysis of the trajectory may be used to determine whether it is appropriate to defibrillate or deliver an alternative therapy such as chest compressions, drugs such as epinephrine, constitutive nutrients such as glucose, or other electrical therapy such as pacing. A mathematical transformation may be performed on the trajectory. The transformation may be a projection of the trajectory onto a plane within the parameter space. Image mensuration algorithms may be employed to evaluate the features of the two dimensional projection of the trajectory. The predicted next state of the parameter set may be used to determine the appropriate treatment. The method may be carried out by a device configured to determine an appropriate therapy for a rescuer to perform on the victim. The probability of defibrillation success associated with a plurality of alternative treatments may be shown on the display of the device. The probability of success with a plurality of treatments may be shown on the display as range of numbers. The device may be an AED that notifies the rescuer in the form of an audible or visual alarm indicating that the paramedic should stop doing compressions for a more accurate analysis of the ECG waveform. The device may be an AED that notifies the rescuer in the form of an audible or visual alarm indicating that the paramedic should alter the therapy being delivered. 
     In a fifth aspect, the invention features an AED capable of automatically determining which type of treatment is appropriate for a cardiac arrest victim, the AED comprising electrical therapy pads configured to deliver electrical therapy to patients, ECG electrodes smaller in diameter than the electrical therapy pads are integrated into the electrical therapy pads, the smaller ECG electrodes are configured to provide at least one additional electrical vector that is approximately orthogonal to the monitoring vector produced by the ECG signal from the therapy electrodes. 
     In preferred implementations, one or more of the following features may be incorporated. A vector sum of the at least one additional electrical vector and the monitoring vector may provide a trajectory over time that can be used by the AED in determining which type of treatment is appropriate. 
     These and other implementations may have one or more of the following advantages. The method uses frequency-domain analysis methods for ECG processing/advisory during chest compressions. This method allows ECG analysis without interruption of chest compression and thus significantly reduces the interruption time during chest compressions, leading to an increase in the success rate of resuscitation. 
     Some implementations allow for the more complete specification of the ECG waveform spectrum for different cardiac states in a mathematically tractable form that provides improved receiver-operator characteristics (ROC) of the detection algorithm, while reducing the performance burden on the processor. 
     Other features and advantages of the invention will be apparent from the description and drawings, and from the claims. 
    
    
     
       DESCRIPTION OF DRAWINGS 
         FIG. 1A  is a magnitude versus time plot of a ventricular tachycardia (VT) rhythm. 
         FIG. 1B  is a magnitude versus time plot of a ventricular fibrillation (VF) rhythm. 
         FIG. 2  is a diagram of one implementation including an automatic electronic defibrillator (AED) and a multiple lead electrocardiograph (ECG) device. 
         FIG. 2A  is a diagram of the AED of  FIG. 2 . 
         FIG. 3A  is an example of a frequency spectrum plot with the energy concentrated within a small frequency range. 
         FIG. 3B  is an example of a frequency spectrum plot with the energy distributed over a relatively larger frequency range. 
         FIG. 4  is an example of an ECG spectrum as a function of time. The magnitude (or energy) of the spectrum is encoded by the grayscale. A darker color corresponds to a higher magnitude. 
         FIG. 5  is an EFV score of the signal in  FIG. 4  as a function of time. 
         FIG. 6  is a flow chart of a process for detecting VF in a patient during chest compressions. 
         FIGS. 7A and 7B  are examples of an ECG spectrum at two points in time, in this case separated by 4 seconds. 
         FIG. 8  is a diagrammatic plan view of an electrical pad having both a defibrillation electrode and a smaller diameter ECG electrode integrated into the electrical pad. 
     
    
    
     DETAILED DESCRIPTION 
     There are a great many different implementations of the invention possible, too many to possibly describe herein. Some possible implementations that are presently preferred are described below. It cannot be emphasized too strongly, however, that these are descriptions of implementations of the invention, and not descriptions of the invention, which is not limited to the detailed implementations described in this section but is described in broader terms in the claims. 
     Referring to  FIG. 2 , a rescuer uses an AED  10  to automatically monitor a victim during cardiac resuscitation. The AED  10  includes a speaker  16 , a display screen  18 , an analog to digital converter  20 , a processor  22 , and a defibrillator pulse generator  24 . The analog-to-digital converter  20  is connected to a set of ECG leads attached to the victim. The ECG leads monitor the electrical rhythms of the victim&#39;s heart. The converter  20  sends the signals from the ECG leads to the processor  22 . The processor  22  monitors the victim&#39;s heart for dangerous rhythms using the ECG signals while the victim is resuscitated using chest compressions techniques. If the AED  10  detects a dangerous heart rhythm, the AED  10  generates an alarm signal. The alarm signal is noticeable to the rescuer. The AED  10  can generate a defibrillating shock to the victim when the rescuer issues a command to the AED  10 . The defibrillating shock is intended to remedy the dangerous rhythm of the victim&#39;s heart. 
     The AED  10  uses a rhythm advisory method for a) quantifying the frequency-domain features of the ECG signals; b) differentiating normal and abnormal ECG rhythms, such as VF; c) detecting the onset of abnormal ECG rhythms; and d) making decisions about the physiological states of the heart. This frequency-domain measure is reliable with or without the presence of the chest compression artifact in the ECG signals. The AED  10 , after identifying the current physiological state of the heart, can make a decision about appropriate therapeutic action for the rescuer to make and communicates the action to the rescuer using the speaker  16  and the display screen  18 . 
     This rhythm advisory method can also be incorporated in an ECG rhythm classifier or a ventricular arrhythmia detector. 
     The AED  10  may incorporate functionality for performing additional therapeutic actions such as chest compressions, ventilations, or delivery of intravenous solution containing metabolic or constitutive nutrients. Based on the results of the analysis of the rhythm advisory method, the AED  10  may automatically deliver the appropriate therapy to the patient. The AED  10  may also be configured in “advisory” mode wherein the AED  10  will prompt the caregiver after the AED  10  has made a determination of the best therapy, and acknowledgement by the caregiver/device operator, in the form of a button press or voice-detected acknowledgement, is required before therapy is delivered to the patient. 
     The AED  10  then analyzes the ECG signals to predict defibrillation success as well as to decide whether it is appropriate to defibrillate or to deliver an alternative therapy such as chest compressions, drugs such as epinephrine, constitutive nutrients such as glucose, or other electrical therapy such as pacing. 
     In some examples, one or more therapeutic delivery devices  30  automatically deliver the appropriate therapy to the patient. The therapeutic delivery devices  30  are physically separate from the defibrillator AED  10  and control of the therapeutic delivery devices  30  may be accomplished by a communications link  32 . The communications link  32  may take the form of a cable connecting the devices  10 ,  30 , but preferably the link  32  is via a wireless protocol such as Bluetooth or a wireless network protocol such as Institute of Electrical and Electronics Engineers (IEEE) 802.11. Bluetooth is a telecommunications industry specification that describes how mobile computing devices can be interconnected using a short-range wireless connection. The therapeutic delivery device  30  can be a portable chest compression device that is commercially available as the Autopulse™, provided by Revivant of Sunnyvale, Calif. In other examples, the therapeutic delivery device  30  is a drug infusion device that is commercially available as the Power Infuser™, provided by Infusion Dynamics of Plymouth Meeting, Pa., or the Colleague CX™, provided by Baxter Healthcare Corp., of Round Lake, Ill. The therapeutic delivery device  30  can be a ventilator that is commercially available as the iVent™, provided by Versamed of Pearl River, N.Y. The therapeutic delivery device  30  can also include multiple therapies such as defibrillation, chest compression, ventilation and drug infusion. 
     In other examples, control and coordination for the overall resuscitation event and the delivery of the various therapies may be accomplished by a device  34  or processing element external to the AED  10 , for instance the device  34  may download and process the ECG data from the AED  10 ; analyze the ECG signals, perform the determinations based on the analysis, and control the other therapeutic devices  30 , including the AED  10 . 
     In other examples, the AED  10  may perform all the processing of the ECG, including analyzing the ECG signals, and transmit to the control device  34  only the final determination of the appropriate therapy, whereupon the control device  34  would perform the control actions on the other linked devices  30 . The control device  34  is commercially available as the Autopulse™, provided by Revivant of Sunnyvale, Calif. 
     The chest compression artifact can be separated from the ECG signal components in the frequency domain. This makes it possible for the AED  10  to process the ECG signal without halting the processing during CPR chest compressions. The compression rate during CPR chest compressions recommended by American Heart Association (2000) is 100 per minute or 1.7 Hz and the frequency range used for quantifying the frequency-domain features of the ECG signals can be set to be higher than that (preferably but not limited to be 3 Hz and up) using a high pass frequency filter. 
     The rhythm advisory method quantifies the energy distribution of the ECG signal in the frequency domain with a quantification method. The quantification result can be used to differentiate normal and dangerous ECG rhythms with or without the presence of the chest compression artifact. In one method, the AED  10  breaks up the frequency domain of the ECG signal into analysis frequency bands. The AED  10  then analyzes the different frequency bands for energy or variation over time to determine an appropriate treatment for the victim. In the preferred embodiment, the bands are 0.5 Hz in width, though they may also be divided into unequal widths such that additional resolution is provided for frequency bands that are of greater importance in the analysis. For instance, frequencies less than 3 Hz may be subdivided into only three equally spaced bands while the range from 3-5 Hz may have 0.5 Hz bands, and the range of 6-12 Hz may have 0.25 Hz bands. Each band may be composed of an aggregation of multiple spectral measurements. For each band, characteristics of the distribution of spectral measurements within the band may include such descriptors, e.g., as mean spectral energy, spectral energy variance, median spectral energy, maximum spectral energy, minimum spectral energy. 
     In one example of the analysis frequency bands, the AED  10  generates the frequency bands based on peaks in the frequency spectrum. Thus, one frequency band corresponds to the frequency spread of a given peak in the frequency spectrum. There are common algorithms for identifying peaks in the frequency spectrum that include calculating slopes and energy at different points of the frequency spectrum. For each of these peaks, the AED  10  uses a non-linear parameter estimation algorithm or curve fitting algorithm to estimate the shape of the peak. From this spectral shape, the AED  10  calculates parameters about the peak. 
     The quantification method differentiates various spectral patterns and shapes. The AED  10  makes a decision about the physiological state of the heart and suitable therapy based on the quantification results. The quantification method of the rhythm advisory method is a combination of measures from sub-methods. Some of these sub-methods differentiate various spectral shapes, including but not limited to: (1) the number of peaks in the target frequency range, (2) the relative strength/peak value of various spectral peaks, (3) the relative bandwidth of various spectral peaks and (4) the variance of the energy distributed in a selected frequency range. One or more sub-methods can also measure change in the spectral information over time. 
     These measures can be combined in a multi-dimension space to enhance both the sensitivitiy and specificity of the decision. One or more information processing techniques can be used to quantify the combination following the computation of these measures in order to make a decision based on the combination. The information processing techniques can include but are limited to simple combining rules or math, neural networks, expert systems incorporating fuzzy or standard logic, or other artificial intelligence techniques. The additional measures can also include measurements of velocity or acceleration of chest compressions according to the techniques taught by U.S. application Ser. No. 10/704,366, Method and Apparatus for Enhancement of Chest Compressions During Chest Compressions, filed on Nov. 6, 2003, now U.S. Pat. No. 7,220,235, issued on May 22, 2007. 
     The information processing techniques include simple combining rules or math, neural networks, expert systems incorporating fuzzy or standard logic, or other artificial intelligence techniques. These techniques make a decision based on the combination of measures about the physiological state of the heart and suitable therapy. The different measures are individual indications that have varying degrees of uncertainty about the physiological state of the heart and suitable therapy. In some examples, the information processing technique is trained automatically using software techniques known to those skilled in this art and a database of ECG rhythms that include outcome data. These examples include neural networks. In other examples, the information processing technique is generated manually based on observations of ECG patterns and outcomes. These examples include simple combining rules or math, and expert systems utilizing fuzzy or standard logic. In the example of expert systems utilizing standard logic, a programmer manually generates logical rules without uncertainty, the rules specifying preconditions such as “if measure A recommends defibrillation” and “if measure B recommends defibrillation”, and if these preconditions are met, the AED  10  automatically defibrillates the patient. In the example of expert systems utilizing fuzzy logic, the rules are more “fuzzy” and the states to be combined incorporate some degree of uncertainty based on human language. For instance, the fuzzy logic rules can incorporate such input as “measure A detects a strong need for defibrillation” versus “measure A detects a weak need for defibrillation”. The fuzzy logic framework combines the different measures and outputs results such as “strong need for defibrillation” or “weak need for defibrillation”. 
     The method of making the decision about the physiological state is to choose from a group of possible states, each of which corresponds to a predetermined value range of the proposed measure. The possible states can include but are not limited to normal sinus rhythm, VF, shockable (unstable) VT, stable VT, supraventricular rhythm, and pulseless electrical activity. 
     One possible sub-method for the quantification method is the variance of the energy distributed in a selected frequency range, or variance sub-method. Two examples of energy-distribution patterns are shown in  FIGS. 3A and 3B . The frequency spectrum plots of  FIGS. 3A and 3B  are calculated using a fast Fourier transform (FFT) of a signal over time. Referring to  FIG. 3A , the energy Y 1 (f) of a frequency spectrum  50  is concentrated within a narrow frequency band and represents a pattern found in an arrhythmic state such as VF. Referring to  FIG. 3B , the energy Y 2 (f) of a frequency spectrum  52  is distributed over a wide frequency range and represents a pattern found in a non-dangerous heart rhythm or normal sinus rhythm. The variance sub-method quantifies the features of the two frequency spectra  50 ,  52  and thus the variance sub-method can differentiate between an arrhythmic state and normal sinus rhythm. 
     One example of the variance sub-method calculates the variance of the energy from a reference frequency (F ref ) of the spectrum. Possible candidates of the reference frequency include but are not limited to the mean frequency, the median frequency, the center frequency, or the peak frequency of the spectrum. 
     In this example, the variance sub-method computes the weighted distance of each frequency component from the reference frequency of the spectrum and thus quantifies the energy-distribution pattern. An example of this measure, the energy-frequency variance (EFV) can be calculated with the following mathematical equation: 
     
       
         
           
             EFV 
             = 
             
               
                 ∫ 
                 
                   
                     
                       ( 
                       
                         f 
                         - 
                         
                           F 
                           ref 
                         
                       
                       ) 
                     
                     2 
                   
                   × 
                   
                     Y 
                     ⁡ 
                     
                       ( 
                       f 
                       ) 
                     
                   
                   ⁢ 
                   
                     ⅆ 
                     f 
                   
                 
               
               
                 ∫ 
                 
                   
                     Y 
                     ⁡ 
                     
                       ( 
                       f 
                       ) 
                     
                   
                   ⁢ 
                   
                     ⅆ 
                     f 
                   
                 
               
             
           
         
       
     
     However, the variance sub-method is not limited to this mathematical equation. Measures that quantify the weighted or un-weighted distance of the frequency components from a reference frequency of the frequency spectrum can be used for this measure. 
     Referring to  FIG. 3A , energy of the spectrum  50  is concentrated within a narrow frequency range and thus the spectrum has a relatively small EFV value. Referring to  FIG. 3B , energy of the spectrum  52  is distributed over a relatively wider frequency range and the spectrum has a relatively larger EFV value. Thus, the EFV value can be used to distinguish between a normal sinus rhythm and an arrhythmic sinus rhythm (e.g., VF). 
     Referring to  FIG. 4 , a spectrum  100  of a piece of an ECG signal is a function of time. Part  102  of the signal shows a VF rhythm during chest compressions. Part  104  of the signal shows a VF rhythm without chest compressions. The VF is terminated by an electrical shock  106 , which is followed by a period of normal sinus rhythm (NSR). During this NSR period, part  108  has no chest compressions while part  110  has chest compressions. Chest compression artifacts that are characterized by strong low-frequency (below 3 Hz) components can be observed in the first 15 seconds (part  102 ) and the last 10 seconds (part  110 ) of this time-frequency plot  100 . During the time periods  102  and  104  that are associated with VF (i.e. before the electrical shock  106 ), the energy distribution Y(f) above 4 Hz is clearly concentrated in a small frequency range, with or without the presence of the chest compression artifact. During the time periods  108  and  110  of NSR (i.e. after the electrical shock  106 ), the energy distribution Y(f) above 4 Hz has a pattern that the energy is distributed over a wide frequency range, with or without the presence of the chest compression artifact. 
     Referring to  FIG. 5 , an EFV score  152  is calculated from the signal  100  (shown in  FIG. 4 ). A threshold  154  can be used to distinguish an arrhythmic rhythm from a normal sinus rhythm. Thus, during the first 50 seconds (parts  102  and  104  having VF rhythm) of the signal  100 , the EFV score  152  is below the threshold  154 . 
     Referring to  FIG. 6 , a variance sub-method  200  is implemented in the software and/or hardware of the AED  10 . The ECG data acquired by the front-end analog to digital converter  10  of the AED  10  is processed in a segment-by-segment manner. The number of segments to be processed before a decision is made is predetermined (e.g., 9 segments). 
     The length of a segment is preferably 2 seconds and each segment preferably has a 1-second overlap with both the segment before and after itself, for the desired frequency and time-domain resolution. 
     The segment-counter is set ( 202 ) to be zero when the processing starts and the first segment of the signal is acquired ( 204 ). A high-pass filter with a desired cutoff frequency (preferably but not limited to be 0.5 Hz) is then applied ( 206 ) to remove the baseline drift. The frequency-domain representation of the filtered signal is acquired via a fast fourier transform (FFT) ( 208 ). The spectral shape is quantified ( 210 ) using a preferred method. In an example, the EFV score is calculated based on this frequency-domain representation and the frequency range for the EFV calculation is selected such that the low-frequency part where the chest compression artifact dominates is excluded. 
     The segment counter is increased ( 212 ) by one after the quantification of the spectral shape. If ( 214 ) all of the predetermined number of segments have been processed, the quantification results are processed ( 216 ) to get a final score (including but not limited to the mean value of the EFV scores), otherwise the next segment of ECG signal is processed. In some implementations, the final score is an average of the scores from the segments. 
     An estimate of the physiological state of the heart can be made based on the final EFV score. If ( 218 ) the final score is below a predetermined threshold, an arrhythmic rhythm is estimated ( 220 ). Using the variance sub-method, the AED  10  compares a threshold to the final EFV score to determine if the victim is in an arrhythmic state. Otherwise the processed signal is estimated to be normal. In one example, a preset threshold of 6 is used. In other examples, other preset thresholds can be used. 
     An arrhythmic sinus rhythm can be detected using the variance sub-method. These arrhythmic sinus rhythms can be different types of rhythms with different appropriate therapies. It may be difficult to distinguish between arrhythmic rhythms that are shockable rhythms and unshockable rhythms using only the variance sub-method. For example, VTs that are shockable (rates exceeding 120-150 beats per minute [BPM]) may not be distinguishable from non-shockable VTs (&lt;120 BPM) solely with the measure from the variance sub-method. Thus, the quantification method preferably enhances the variance sub-method with at least one other spectral measurement in determining the appropriate therapy for detected sinus rhythms. The quantification method may also make decisions based on changes in the spectral parameters over time. Multiple measures may be thought of as forming a matrix, but actual implementations need not employ matrices. 
     In some implementations, the AED  10  may combine the frequency of the largest amplitude spectral peak (LASP) in the frequency spectrum with the measure from the variance sub-method to create a 1×2 matrix. In some implementations, AED  10  may additionally calculate the number of spectral peaks in the frequency representation of the ECG signal with amplitudes of at least 25% of the LASP using conventional methods known to those skilled in the art of signal processing and spectral analysis and include this measurement in the vector. A frequency of the LASP (FLASP) of less than 2 Hz and the number of peaks (NOP) less than 3 indicates that it is a shockable VT or VF, while a FLASP of greater than 2 Hz and an NOP of less than 3 indicates a non-shockable VT. Non-shockable supraventricular rhythms can have a NOP greater than 3. 
     In other implementations, the AED  10  can combine information from the variance sub-method and the FLASP and NOP measure, using information processing techniques described previously, to estimate the physiological state of the heart and suitable therapy. A combination of the EFV under a threshold and FLASP&lt;2 Hz and NOP&lt;3 can indicate a shockable VT or VF for which appropriate therapy can be defibrillation. A combination of the EFV under a threshold and FLASP&gt;2 Hz and NOP&lt;3 can indicate a non-shockable VT for which appropriate therapy can be normal CPR. A combination of the EFV under a threshold and NOP&gt;3 can indicate a supraventricular rhythm for which appropriate therapy can be simply monitoring the patient or drug therapy. 
     A descriptor matrix may take the form of a [n×m] dimensional matrix, where n=the number of peaks and m=the number of parameters used to describe the spectral shape. In one implementation with m=6, the six parameters are the following: 1) the frequency of the particular peak (FP); 2) the amplitude of that peak (AP); 3) the width of the peak (PW); 4) the depth of the peak (DP); 5) the variance of that peak (VP); and 6) the first moment of that peak (FM). Peak number (PN) is a digit providing an identifier for each individual peak. For instance, initially the AED  10  detects 5 peaks, each PN numbered sequentially with frequencies at 1, 2, 3, 4, and 5 Hz. Four seconds later in time, however, the AED  10  detects a peak at a new frequency of 4.5 Hz and the peak is assigned a PN of 6. 
     The description matrix, which may be termed a spectral shape matrix (SSM), may include two header values, NOP and a boolean value, Gaussian peak (GP), which indicates that for spectral shapes that have a single peak (NOP=1) and GP=true, that the spectral shape may be described by a parameter subset of only FP, AP, and VP. The SSM may preferably take the form: 
     
       
         
           
             
               
                 
                   
                     FP 
                     1 
                   
                 
                 
                   
                     AP 
                     1 
                   
                 
                 
                   
                     PW 
                     1 
                   
                 
                 
                   
                     VP 
                     1 
                   
                 
                 
                   
                     FM 
                     1 
                   
                 
               
               
                 
                   
                     FP 
                     2 
                   
                 
                 
                   
                     AP 
                     2 
                   
                 
                 
                   
                     PW 
                     2 
                   
                 
                 
                   
                     VP 
                     2 
                   
                 
                 
                   
                     FM 
                     2 
                   
                 
               
               
                 
                   
                     FP 
                     3 
                   
                 
                 
                   
                     AP 
                     3 
                   
                 
                 
                   
                     PW 
                     3 
                   
                 
                 
                   
                     VP 
                     3 
                   
                 
                 
                   
                     FM 
                     3 
                   
                 
               
               
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
               
               
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
                 
                   ⋯ 
                 
               
               
                 
                   
                     FP 
                     n 
                   
                 
                 
                   
                     AP 
                     n 
                   
                 
                 
                   
                     PW 
                     n 
                   
                 
                 
                   
                     VP 
                     n 
                   
                 
                 
                   
                     FM 
                     n 
                   
                 
               
             
               
           
         
       
     
     Since fibrillation is a chaotic rhythm, the FP frequencies may vary at a rate faster than the time window of the short-time Fourier transform. For instance, if the time window for computing the Fourier transform to generate a frequency spectrum is set for 4 seconds, the FPs for adjacent time windows (and corresponding frequency spectrums) will appear to jump from one frequency to the next. If, however, the AED  10  applies a standard short time Fourier transform to the signal while at the same time increasing the rate at which a Fourier transform is performed on the incoming data, the time window will be reduced and thus there will be a loss in the spectral resolution of the Fourier transform. Thus, in one example, the AED  10  simultaneously performs multiple Fourier transforms on the ECG data with each subsequent transform initiated 400 milliseconds after initiation of the previous transform and a time window of 4 seconds, resulting in the AED performing 10 simultaneous transforms of data in a time window of 4 seconds. Thus, the data for each transform has some overlap with data for adjacent transforms. In such a manner, the AED  10  maintains both spectral and time resolution. 
     The AED  10  may calculate additional header values that describe generic aspects of the ECG spectrum. These additional header values may include, for instance, the amplitude spectrum area (AMSA) as described in U.S. Pat. No. 5,957,856 or the variance measure, as described previously. These values, along with NOP and GP, can be thought of as forming a vector on which matrix operations and transformations may be performed independently of, or combined with, the matrix formed by the parameters for the individual peaks. 
     The AED  10  can then perform matrix operations and transformations known to those skilled in the art on the SSM. The AED  10  can also calculate the SSM at regular intervals in time, to generate a [n×m×p] dimensional matrix, where p is the number of samples in the time interval of interest. Each SSM may be thought of as a point in [n, m]-space that then forms a trajectory in the [n, m, p]-space. The AED  10  then analyzes this trajectory to predict defibrillation success as well as to decide whether it is appropriate to defibrillate or deliver an alternative therapy such as chest compressions, drugs such as epinephrine, constitutive nutrients such as glucose, or other electrical therapy such as pacing. 
     The AED  10  may identify one or more peaks in the frequency spectrum. For each of these identified peaks, the AED  10  identifies a frequency band corresponding to the peak. The AED  10  may determine the peak model parameters, e.g. FP, AP, and PW, iteratively by a nonlinear parameter estimation or curve fitting routine for each peak&#39;s frequency band. For example, the AED  10  may use the Marquardt-Levenberg algorithm to minimize the error in the nonlinear parameter estimation or Chi-square, χ 2 , where χ 2  is expressed as follows. 
                 χ   2     ⁡     (   p   )       =       1     N   -   P       ⁢       ∑   i     ⁢         [         M   ⁡     (   i   )       -     S   ⁡     (     i   ;   p     )             M   ⁡     (   i   )           ]     2     .               
For this expression, there are N recorded energy values, M(i) are the recorded energy values, and S(i; p) is the synthesized model curve energy values, sampled at points i in dependence on p varying parameter values. The term enclosed in brackets corresponds to the normalized residuals R(i), which provide a weighted measure of the difference between the fit curve and the data at each measured frequency value M(i).
 
     The AED  10  uses either the height-normalized Lorentzian function, L(E), or the Gaussian function, G(E) to model an energy function for each of the spectral peaks where E is a frequency. In the case of L(E): 
               L   ⁡     (   E   )       =         {     1   +       [       E   -     E   0       β     ]     2       }       -   1       .           
In the case of G(E):
 
               G   ⁡     (   E   )       =     exp   ⁢     {       -   ln     ⁢           ⁢     2   ·       [       (     E   -     E   0       )     β     ]     2         }             
Both functions L(E), G(E) are completely characterized by the peak parameters β, corresponding to ½ the peak width at half-maximum peak amplitude and E 0 , the peak position or FP. The AED  10  can model skew of the peak by combining the Gaussian G(E) and Lorentzian L(E), with β replaced by the term β+α(E−E 0 ). The AED  10  can also add in a factor h to allow for varying peak heights. The result is function ƒ(E). The AED  10  calculates ƒ(E) as follows.
 
     
       
         
           
             
               f 
               ⁡ 
               
                 ( 
                 E 
                 ) 
               
             
             = 
             
               
                 h 
                 · 
                 
                   
                     { 
                     
                       1 
                       + 
                       
                         
                           M 
                           [ 
                           
                             
                               E 
                               - 
                               
                                 E 
                                 0 
                               
                             
                             
                               β 
                               + 
                               
                                 α 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     E 
                                     - 
                                     
                                       E 
                                       0 
                                     
                                   
                                   ) 
                                 
                               
                             
                           
                           ] 
                         
                         2 
                       
                     
                     } 
                   
                   
                     - 
                     1 
                   
                 
                 · 
                 exp 
               
               ⁢ 
               
                 { 
                 
                   
                     
                       ( 
                       
                         1 
                         - 
                         M 
                       
                       ) 
                     
                     · 
                     ln 
                   
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     2 
                     · 
                     
                       
                         [ 
                         
                           
                             E 
                             - 
                             
                               E 
                               0 
                             
                           
                           
                             β 
                             + 
                             
                               α 
                               ⁡ 
                               
                                 ( 
                                 
                                   E 
                                   - 
                                   
                                     E 
                                     0 
                                   
                                 
                                 ) 
                               
                             
                           
                         
                         ] 
                       
                       2 
                     
                   
                 
                 } 
               
             
           
         
       
     
     Some of the advantages of this product-type peak shape model ƒ(E) are the availability of analytical presentations of the partial derivatives of ƒ(E) with respect to the parameters, which are needed in the Marquardt-Levenberg algorithm to establish the Jacobi matrix, the analytical value of β, and a faster convergence of the iterative estimation process. The depth of each peak is estimated either by incorporating a baseline curve into the Marquardt-Levenberg algorithm, or by simply determining the two minimum points of the spectrum for a region around the estimated peak. Thus, using techniques known to one skilled in this art, the AED  10  can compute the spectral shape parameters of the peak: FP, AP, PW, DP, VP, and FM from the function ƒ(E). 
     If the AED  10  finds a peak in the immediately subsequent time interval for which the AP and FP value does not vary by more than preferably 10%, then that second peak is considered to have the same peak number, PN, indicating that it is the same peak with a shift in frequency and amplitude. In such a fashion, the AED  10  can develop trajectories for the parameters for each particular peak as well as for the overall descriptor matrix. The AED  10  can add a new peak at any time during the event, in which case the AED  10  gives the new peak a new PN value. If the AED  10  determines that a peak is extinguished, the PN number is maintained in memory of the AED  10 . In the processing of candidates for new peaks, the sub-method reviews all extinguished peaks to first determine if the new peak is actually an extinguished peak, in which case the candidate is not given a new PN, and instead is given the PN number of the extinguished peak. 
     Prior to a successful shock of a heart in a dangerous rhythm, one or more parameters AP, DP, VP, FP, PW of peaks in the 6-12 Hz range of the frequency spectrum can oscillate with a cycle rate in the range of 0.1-1 Hz. Thus, detection of this oscillation through multiple time windows and frequency spectrums can be incorporated into the information processing technique as an additional sub-method that can recommend defibrillating the heart. Furthermore, the sub-method can recommend timing the defibrillating shock when the peaks are at a maximum energy in the 0.1-1 Hz cycle. For example, the sub-method can recommend timing the delivery of the defibrillation shock to occur during the 100 millisecond Fourier transform cycle when the APs in the 6-12 Hz region are at a maximum. When the particular AP-maximum cycle has be found, the AED  10  waits to deliver the defibrillation shock until the AED  10  detects the peak of the waveform after it has been band pass-filtered with a center frequency of 7 Hz. This sub-method synchronizes the shock with the elements of the ECG waveform that are most related to the normal sinus QRS. 
     The parameters FP, AP, and PW of peaks in the 6-12 Hz region may also undergo oscillations indicating a change in the state of the heart as shown in  FIGS. 7A and 7B , which depict the spectrum as measured at two points in time, separated by an interval of 4 seconds. For a heart that has been in fibrillation for a period of time, the ECG undergoes a gradual degradation in the values of the parameters FP, AP, and PW of peaks in the 6-12 Hz region of the frequency spectrum. As described previously, suitable therapy for a heart that has been in fibrillation for a period time is to do chest compressions and then defibrillate. This degradation is measured over at least a 8-10 second interval. This is an additional sub-method for the information processing technique. For example, if the AED  10  detects the APs of at least two peaks in the 6-12 Hz region of the frequency spectrum decreasing by at least 15% over a 10 second interval, the sub-method recommends chest compressions and then defibrillation. 
     If the circulation and metabolic substrate of the heart improve to the point that the heart is more likely to be able to recover from a defibrillation shock, changes in the parameters FP, AP, and PW of peaks in the 6-12 Hz region of the frequency spectrum will provide precursors to changes in the ECG that might be seen in the time domain of the ECG signal, such as an increase in the amplitude of the ventricular fibrillation ECG (often termed “coarsening” by medical practitioners). If the AED  10  detects an increase in the parameters FP, AP, DP, VP or PW of peaks in the 6-12 Hz region of the frequency spectrum, for instance as shown in  FIG. 7B , a sub-method will recommend ceasing chest compressions or other current therapy and then defibrillation. 
     The peak frequencies, FP, for the peaks in the 6-12 Hz region of the frequency spectrum can vary over time less when the condition of the heart is improving and thus the heart can handle the shock of defibrillation. This may be due to the presence in the myocardial activations of more normal activity at low levels manifesting in harmonics of the sinus rhythm fundamental frequency. This variation in the peak frequencies may be measured as the ratio of the average change in frequency in the region of 6-12 Hz with that of the FPs in the frequency range of 3-6 Hz or measured as an absolute change for FPs in the range of 6-12 Hz. This sub-method, upon detecting the variation in the peak frequencies, recommends defibrillation to the information processing technique. 
     It is also possible for a sub-method to project the [n×m×p] trajectory of the SSM matrix onto a plane within the [n×m]-space and then analyze the form taken by the projection of the trajectory in the plane to determine the appropriate time to shock or the optimal treatment. The projection may include up to (n+m) variables of different weightings, though it preferably is a projection that is primarily along the VP axis of the [n×m]-space. In the plane projection, image mensuration algorithms are employed to evaluate the features of the two dimensional projection of the trajectory. The following are some of the preferred mensuration classes for which measurements are made by means known to those skilled in the art: area, centroid, circularity, clustering, compactness, maximum axis, minimum axis, and perimeter. For instance, the minimum axis may be determined as follows. The minimum axis of an object is formally defined as the axis of maximum inertia (dispersion) passing through the centroid. One method to calculate the minimum axis is to compute the eigenvalues and eigenvectors of the scatter matrix comprised of the coordinate points of the object. The eigenvector corresponding to the smallest eigenvalue is the minimum axis. Another method is to fit an ellipse to the object perimeter. 
     The projection may be calculated for a specific duration of time, for instance 10 seconds, resulting in a series of 2-dimensional objects that are representations of the trajectory in time—so-called projection “snap-shots”. It then becomes possible to analyze trends in the time series of values in the mensuration classes for changes indicative of improving physiological conditions. For instance, an increased amplitude in VP oscillation during VF is indicative of an improving physiological state. In this case, the AED  10  would then provide feedback to the caregiver to continue performing the rescue operation as they have with an audible prompt such as, “Keep up the good work. The patient&#39;s condition is improving.” Other such mensuration classes that are of value to track over time are the maximum axis angle, the perimeter and compactness. 
     Methods such as the Kalman filter may be used for the estimation and prediction of the trajectory. The Kalman filter estimates a process by using a form of feedback control: the filter estimates the process state at some time and then obtains feedback in the form of (noisy) measurements. As such, the equations for the Kalman filter fall into two groups: time update equations and measurement update equations. The time update equations are responsible for projecting forward (in time) the current state and error covariance estimates to obtain the a priori estimates for the next time step. The measurement update equations are responsible for the feedback—i.e. for incorporating a new measurement into the a priori estimate to obtain an improved a posteriori estimate. The time update equations can also be thought of as predictor equations, while the measurement update equations can be thought of as corrector equations. Indeed the final estimation algorithm resembles that of a predictor-corrector algorithm for solving numerical problems. 
     Discrete Kalman filter time update equations:
 
{circumflex over (χ)} k   −   =A{circumflex over (χ)}   k−1   +Bu   k−1  
 
 P   k   −   =AP   k−1   A   T   +Q  
 
     Discrete Kalman filter measurement update equations:
 
 K   k   =P   k   −   H   T ( HP   k   −   H   T   +R ) −1  
 
{circumflex over (χ)} k ={circumflex over (χ)} k   −   +K   k ( z   k   −H{circumflex over (χ)}   k   − )
 
 P   k =(1 −K   k   H ) P   k   − 
 
     The first task during the measurement update is to compute the Kalman gain, K k , The next step is to actually measure the process to obtain, and then to generate an a posteriori state estimate by incorporating the measurement, z k . The final step is to obtain an a posteriori error covariance estimate, P k . After each time and measurement update pair, the process is repeated with the previous a posteriori estimates used to project or predict the new a priori estimates. This recursive nature is one of the very appealing features of the Kalman filter—it makes practical implementations much more feasible than (for example) an implementation of a Wiener filter which is designed to operate on all of the data directly for each estimate. The Kalman filter instead recursively conditions the current estimate on all of the past measurements. The equation,
 
{circumflex over (χ)} k ={circumflex over (χ)} k   −   +K   k ( z   k   −H{circumflex over (χ)}   k   − )
 
is termed the predictor equation.
 
     One of the primary limitations of the Kalman filter is that it only models a linear system with Gaussian distribution, not often encountered in the physiological setting. The best known algorithm to solve the problem of non-Gaussian, nonlinear filtering is the extended Kalman filter (EKF). This filter is based upon the principle of linearizing the measurements and evolution models using Taylor series expansions. The series approximations in the EKF algorithm can, however, lead to poor representations of the nonlinear functions and probability distributions of interest. As a result, this filter can diverge. Based on the hypothesis that it is easier to approximate a Gaussian distribution than it is to approximate arbitrary nonlinear functions other researchers have developed a filter termed the unscented Kalman filter (UKF). It has been shown that the UKF leads to more accurate results than the EKF and that in particular it generates much better estimates of the covariance of the states (the EKF often seems to underestimate this quantity). The UKF has, however, the limitation that it does not apply to general non-Gaussian distributions as is often the case with the ECG spectral distributions. Sequential Monte Carlo methods, also known as particle filters overcome this limitation and allow for a complete representation of the posterior distribution of the states, so that any statistical estimates, such as the mean, modes, kurtosis and variance, can be easily computed. Particle Filters can therefore, deal with any nonlinearities or distributions. Particle filters rely on importance sampling and, as a result, require the design of proposal distributions that can approximate the posterior distribution reasonably well. In general, it is hard to design such proposals. The most common strategy is to sample from the probabilistic model of the states evolution (transition prior). This strategy can, however, fail if the new measurements appear in the tail of the prior or if the likelihood is too peaked in comparison to the prior. 
     In the preferred implementation, a estimator/predictor trajectory tracking technique known as the unscented Particle Filter (UPF) as developed by Merwe, Doucet, Freitasz and Wan. 
     Pseudocode for the UPF is as follows: 
     Unscented Particle Filter: 
     Initialization: t=0. 
     For i=1, . . . N, draw states (particles) x 0   (i)  from the prior p(x 0 ) and set, 
     
       
         
           
             
               
                 x 
                 ~ 
               
               0 
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               E 
               ⁡ 
               
                 [ 
                 
                   x 
                   0 
                   
                     ( 
                     i 
                     ) 
                   
                 
                 ] 
               
             
           
         
       
       
         
           
             
               P 
               0 
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               E 
               ⁡ 
               
                 [ 
                 
                   
                     ( 
                     
                       
                         x 
                         0 
                         
                           ( 
                           i 
                           ) 
                         
                       
                       - 
                       
                         
                           x 
                           ~ 
                         
                         0 
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ) 
                   
                   ⁢ 
                   
                     
                       ( 
                       
                         
                           x 
                           0 
                           
                             ( 
                             i 
                             ) 
                           
                         
                         - 
                         
                           
                             x 
                             ~ 
                           
                           0 
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                       ) 
                     
                     T 
                   
                 
                 ] 
               
             
           
         
       
       
         
           
             
               
                 x 
                 ~ 
               
               0 
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 E 
                 ⁡ 
                 
                   [ 
                   
                     x 
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       a 
                     
                   
                   ] 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         
                           
                             ( 
                             
                               
                                 x 
                                 ~ 
                               
                               0 
                               
                                 ( 
                                 i 
                                 ) 
                               
                             
                             ) 
                           
                           T 
                         
                       
                       
                         0 
                       
                       
                         0 
                       
                     
                   
                   ] 
                 
                 T 
               
             
           
         
       
       
         
           
             
               P 
               0 
               
                 
                   ( 
                   i 
                   ) 
                 
                 ⁢ 
                 a 
               
             
             = 
             
               
                 E 
                 ⁡ 
                 
                   [ 
                   
                     
                       ( 
                       
                         
                           x 
                           0 
                           
                             
                               ( 
                               i 
                               ) 
                             
                             ⁢ 
                             a 
                           
                         
                         - 
                         
                           
                             x 
                             ~ 
                           
                           0 
                           
                             
                               ( 
                               i 
                               ) 
                             
                             ⁢ 
                             a 
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       
                         ( 
                         
                           
                             x 
                             0 
                             
                               
                                 ( 
                                 i 
                                 ) 
                               
                               ⁢ 
                               a 
                             
                           
                           - 
                           
                             
                               x 
                               ~ 
                             
                             0 
                             
                               
                                 ( 
                                 i 
                                 ) 
                               
                               ⁢ 
                               a 
                             
                           
                         
                         ) 
                       
                       T 
                     
                   
                   ] 
                 
               
               = 
               
                 [ 
                 
                   
                     
                       
                         P 
                         0 
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       0 
                     
                     
                       Q 
                     
                     
                       0 
                     
                   
                   
                     
                       0 
                     
                     
                       0 
                     
                     
                       R 
                     
                   
                 
                 ] 
               
             
           
         
       
       
         
           
             
               
                 For 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 t 
               
               = 
               1 
             
             , 
             2 
             , 
             … 
             ⁢ 
             
                 
             
             , 
           
         
       
         
         
           
             a) Importance sampling step:
           For i=1, . . . N: Update particles with the UKF:   Calculate sigma points:   
         
           
         
       
    
     
       
         
           
             
               χ 
               
                 i 
                 - 
                 1 
               
               
                 
                   ( 
                   i 
                   ) 
                 
                 ⁢ 
                 a 
               
             
             = 
             
               [ 
               
                 
                   
                     
                       x 
                       ~ 
                     
                     
                       i 
                       - 
                       1 
                     
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       a 
                     
                   
                   ⁢ 
                   
                     
                       x 
                       ~ 
                     
                     
                       i 
                       - 
                       1 
                     
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       a 
                     
                   
                 
                 ± 
                 
                   
                     
                       ( 
                       
                         
                           n 
                           a 
                         
                         + 
                         λ 
                       
                       ) 
                     
                     ⁢ 
                     
                       P 
                       
                         i 
                         - 
                         1 
                       
                       
                         
                           ( 
                           i 
                           ) 
                         
                         ⁢ 
                         a 
                       
                     
                   
                 
               
               ] 
             
           
         
       
         
         
           
             
               
                 Predict future particle (time update) 
               
             
           
         
       
    
     
       
         
           
             
               χ 
               
                 i 
                 | 
                 
                   t 
                   - 
                   1 
                 
               
               
                 
                   ( 
                   i 
                   ) 
                 
                 ⁢ 
                 x 
               
             
             = 
             
               f 
               ⁡ 
               
                 ( 
                 
                   
                     χ 
                     
                       i 
                       - 
                       1 
                     
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       x 
                     
                   
                   , 
                   
                     χ 
                     
                       i 
                       - 
                       1 
                     
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       x 
                     
                   
                 
                 ) 
               
             
           
         
       
       
         
           
             
               x 
               
                 i 
                 | 
                 
                   i 
                   - 
                   1 
                 
               
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   0 
                 
                 
                   2 
                   ⁢ 
                   
                     n 
                     a 
                   
                 
               
               ⁢ 
               
                 
                   W 
                   j 
                   
                     ( 
                     a 
                     ) 
                   
                 
                 ⁢ 
                 
                   χ 
                   
                     j 
                     , 
                     
                       i 
                       | 
                       
                         i 
                         - 
                         1 
                       
                     
                   
                   
                     
                       ( 
                       i 
                       ) 
                     
                     ⁢ 
                     x 
                   
                 
               
             
           
         
       
       
         
           
             
               P 
               
                 i 
                 | 
                 
                   i 
                   - 
                   1 
                 
               
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   0 
                 
                 
                   2 
                   ⁢ 
                   
                     n 
                     a 
                   
                 
               
               ⁢ 
               
                 
                   
                     
                       W 
                       j 
                       
                         ( 
                         a 
                         ) 
                       
                     
                     ⁡ 
                     
                       [ 
                       
                         
                           χ 
                           
                             j 
                             , 
                             
                               i 
                               | 
                               
                                 i 
                                 - 
                                 1 
                               
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                         - 
                         
                           
                             x 
                             ~ 
                           
                           
                             i 
                             | 
                             
                               i 
                               - 
                               1 
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                       ] 
                     
                   
                   ⁡ 
                   
                     [ 
                     
                       
                         χ 
                         
                           j 
                           , 
                           
                             i 
                             | 
                             
                               i 
                               - 
                               1 
                             
                           
                         
                         
                           
                             ( 
                             i 
                             ) 
                           
                           ⁢ 
                           x 
                         
                       
                       - 
                       
                         
                           x 
                           ~ 
                         
                         
                           i 
                           | 
                           
                             i 
                             - 
                             1 
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ] 
                   
                 
                 T 
               
             
           
         
       
       
         
           
             
               y 
               
                 i 
                 | 
                 
                   i 
                   - 
                   1 
                 
               
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               h 
               ⁡ 
               
                 ( 
                 
                   
                     χ 
                     
                       i 
                       | 
                       
                         i 
                         - 
                         1 
                       
                     
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       n 
                     
                   
                   , 
                   
                     χ 
                     
                       i 
                       - 
                       1 
                     
                     
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       n 
                     
                   
                 
                 ) 
               
             
           
         
       
       
         
           
             
               
                 y 
                 ~ 
               
               
                 i 
                 | 
                 
                   i 
                   - 
                   1 
                 
               
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   0 
                 
                 
                   2 
                   ⁢ 
                   
                     n 
                     a 
                   
                 
               
               ⁢ 
               
                 
                   W 
                   j 
                   
                     ( 
                     n 
                     ) 
                   
                 
                 ⁢ 
                 
                   y 
                   
                     j 
                     , 
                     
                       i 
                       | 
                       
                         i 
                         - 
                         1 
                       
                     
                   
                   
                     ( 
                     i 
                     ) 
                   
                 
               
             
           
         
       
         
         
           
             
               
                 Incorporate new observation (measurement update) 
               
             
           
         
       
    
     
       
         
           
             
               P 
               
                 
                   
                     y 
                     ~ 
                   
                   i 
                 
                 ⁢ 
                 
                   
                     y 
                     ~ 
                   
                   i 
                 
               
             
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   0 
                 
                 
                   2 
                   ⁢ 
                   
                     n 
                     a 
                   
                 
               
               ⁢ 
               
                 
                   
                     
                       W 
                       j 
                       
                         ( 
                         a 
                         ) 
                       
                     
                     ⁡ 
                     
                       [ 
                       
                         
                           y 
                           
                             j 
                             , 
                             
                               i 
                               | 
                               
                                 i 
                                 - 
                                 1 
                               
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                         - 
                         
                           
                             y 
                             ~ 
                           
                           
                             i 
                             | 
                             
                               i 
                               - 
                               1 
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                       ] 
                     
                   
                   ⁡ 
                   
                     [ 
                     
                       
                         y 
                         
                           j 
                           , 
                           
                             i 
                             | 
                             
                               i 
                               - 
                               1 
                             
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                       - 
                       
                         
                           y 
                           ~ 
                         
                         
                           i 
                           | 
                           
                             i 
                             - 
                             1 
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ] 
                   
                 
                 T 
               
             
           
         
       
       
         
           
             
               P 
               
                 
                   x 
                   i 
                 
                 ⁢ 
                 
                   y 
                   i 
                 
               
             
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   0 
                 
                 
                   2 
                   ⁢ 
                   
                     n 
                     a 
                   
                 
               
               ⁢ 
               
                 
                   
                     
                       W 
                       j 
                       
                         ( 
                         a 
                         ) 
                       
                     
                     ⁡ 
                     
                       [ 
                       
                         
                           χ 
                           
                             j 
                             , 
                             
                               i 
                               | 
                               
                                 i 
                                 - 
                                 1 
                               
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                         - 
                         
                           
                             x 
                             ~ 
                           
                           
                             i 
                             | 
                             
                               i 
                               - 
                               1 
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                       ] 
                     
                   
                   ⁡ 
                   
                     [ 
                     
                       
                         y 
                         
                           j 
                           , 
                           
                             i 
                             | 
                             
                               i 
                               - 
                               1 
                             
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                       - 
                       
                         
                           y 
                           ~ 
                         
                         
                           i 
                           | 
                           
                             i 
                             - 
                             1 
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ] 
                   
                 
                 T 
               
             
           
         
       
       
         
           
             
               
                 K 
                 i 
               
               = 
               
                 P 
                 
                   
                     x 
                     i 
                   
                   ⁢ 
                   
                     y 
                     i 
                   
                 
               
             
             , 
             
               P 
               
                 
                   
                     y 
                     ~ 
                   
                   i 
                 
                 ⁢ 
                 
                   
                     y 
                     ~ 
                   
                   i 
                 
               
               
                 - 
                 1 
               
             
           
         
       
       
         
           
             
               x 
               i 
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 
                   x 
                   ~ 
                 
                 
                   i 
                   | 
                   
                     i 
                     - 
                     1 
                   
                 
                 
                   ( 
                   i 
                   ) 
                 
               
               + 
               
                 
                   K 
                   i 
                 
                 ( 
                 
                   
                     y 
                     i 
                   
                   - 
                   
                     
                       y 
                       ~ 
                     
                     
                       i 
                       | 
                       
                         i 
                         - 
                         1 
                       
                     
                     
                       ( 
                       i 
                       ) 
                     
                   
                 
                 ) 
               
             
           
         
       
       
         
           
             
               
                 P 
                 ^ 
               
               i 
               
                 ( 
                 i 
                 ) 
               
             
             = 
             
               
                 
                   P 
                   
                     i 
                     | 
                     
                       i 
                       - 
                       1 
                     
                   
                   
                     ( 
                     i 
                     ) 
                   
                 
                 - 
                 
                   
                     K 
                     i 
                   
                   ⁢ 
                   
                     P 
                     
                       
                         
                           y 
                           ~ 
                         
                         i 
                       
                       ⁢ 
                       
                         
                           y 
                           ~ 
                         
                         i 
                       
                     
                   
                   ⁢ 
                   
                     K 
                     i 
                     T 
                   
                 
                 ⁢ 
                 
                   
 
                 
                 - 
                 
                   Sample 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     
                       x 
                       i 
                       
                         ( 
                         i 
                         ) 
                       
                     
                     ~ 
                     
                       q 
                       ⁡ 
                       
                         ( 
                         
                           
                             
                               x 
                               i 
                               
                                 ( 
                                 i 
                                 ) 
                               
                             
                             | 
                             
                               x 
                               
                                 0 
                                 = 
                                 
                                   i 
                                   - 
                                   1 
                                 
                               
                               
                                 ( 
                                 i 
                                 ) 
                               
                             
                           
                           , 
                           , 
                           
                             y 
                             
                               1 
                               : 
                               i 
                             
                           
                         
                         ) 
                       
                     
                   
                 
               
               = 
               
                 
                   
                     N 
                     ( 
                     
                       
                         x 
                         
                           ( 
                           i 
                           ) 
                         
                       
                       , 
                       
                         P 
                         i 
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ) 
                   
                   ⁢ 
                   
                     
 
                   
                   - 
                   
                     Set 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       
                         x 
                         ^ 
                       
                       
                         0 
                         : 
                         i 
                       
                       
                         ( 
                         i 
                         ) 
                       
                     
                   
                 
                 ⁢ 
                 
                   = 
                   △ 
                 
                 ⁢ 
                 
                   
                     ( 
                     
                       
                         x 
                         
                           0 
                           : 
                           
                             i 
                             - 
                             1 
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                       , 
                       
                         
                           x 
                           ^ 
                         
                         i 
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ) 
                   
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   and 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     
                       
                         P 
                         ^ 
                       
                       
                         0 
                         = 
                         1 
                       
                       
                         ( 
                         i 
                         ) 
                       
                     
                     ⁡ 
                     
                       ( 
                       
                         
                           P 
                           
                             0 
                             = 
                             
                               i 
                               - 
                               1 
                             
                           
                           
                             ( 
                             i 
                             ) 
                           
                         
                         , 
                         
                           
                             P 
                             ^ 
                           
                           i 
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
         
         
           
             
               
                 For i=1, . . . N, evaluate the importance weights up to a normalizing constant: 
               
             
           
         
       
    
     
       
         
           
             
               w 
               t 
               
                 ( 
                 i 
                 ) 
               
             
             ∝ 
             
               
                 
                   p 
                   ⁡ 
                   
                     ( 
                     
                       
                         y 
                         t 
                       
                       ⁢ 
                       
                         | 
                       
                       ⁢ 
                       
                         
                           x 
                           ^ 
                         
                         t 
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ) 
                   
                 
                 ⁢ 
                 
                   p 
                   ⁡ 
                   
                     ( 
                     
                       
                         
                           x 
                           ^ 
                         
                         t 
                         
                           ( 
                           i 
                           ) 
                         
                       
                       ⁢ 
                       
                         | 
                       
                       ⁢ 
                       
                         x 
                         
                           t 
                           - 
                           1 
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ) 
                   
                 
               
               
                 q 
                 ⁡ 
                 
                   ( 
                   
                     
                       
                         
                           x 
                           ^ 
                         
                         t 
                         
                           ( 
                           i 
                           ) 
                         
                       
                       ⁢ 
                       
                         | 
                       
                       ⁢ 
                       
                         x 
                         
                           0 
                           : 
                           
                             t 
                             - 
                             1 
                           
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     , 
                     
                       y 
                       
                         1 
                         : 
                         t 
                       
                     
                   
                   ) 
                 
               
             
           
         
       
         
         
           
             
               
                 For i=1, . . . N, normalize the importance weights. 
               
             
             b) Selection Step
           Multiply/Suppress particles,   
         
           
         
       
    
     
       
         
           
             ( 
             
               
                 
                   x 
                   ^ 
                 
                 
                   0 
                   : 
                   i 
                 
                 
                   ( 
                   i 
                   ) 
                 
               
               , 
               
                 
                   P 
                   ^ 
                 
                 
                   0 
                   : 
                   i 
                 
                 
                   ( 
                   i 
                   ) 
                 
               
             
             ) 
           
         
       
         
         
           
             
               
                 with high/low importance weights,
 
{tilde under (w)} k   (i)  
 
                 respectively, to obtain N random particles. 
               
             
             c) Output: The output of the algorithm is a set of samples that can be used to approximate the posterior distribution as follows: 
           
         
       
    
     
       
         
           
             
               
                 p 
                 ⁡ 
                 
                   ( 
                   
                     
                       x 
                       
                         0 
                         : 
                         t 
                       
                     
                     ⁢ 
                     
                       | 
                     
                     ⁢ 
                     
                       y 
                       
                         1 
                         : 
                         t 
                       
                     
                   
                   ) 
                 
               
               ≈ 
               
                 
                   p 
                   ^ 
                 
                 ⁡ 
                 
                   ( 
                   
                     
                       x 
                       
                         0 
                         : 
                         t 
                       
                     
                     ⁢ 
                     
                       | 
                     
                     ⁢ 
                     
                       y 
                       
                         1 
                         : 
                         t 
                       
                     
                   
                   ) 
                 
               
             
             = 
             
               
                 1 
                 N 
               
               ⁢ 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   N 
                 
                 ⁢ 
                 
                   
                     δ 
                     
                       ( 
                       
                         x 
                         
                           0 
                           : 
                           t 
                         
                         
                           ( 
                           i 
                           ) 
                         
                       
                       ) 
                     
                   
                   ⁡ 
                   
                     ( 
                     
                       dx 
                       
                         0 
                         : 
                         t 
                       
                     
                     ) 
                   
                 
               
             
           
         
       
         
         
           
             
               
                 Resulting in the estimate of, 
               
             
           
         
       
    
               E   ⁡     (       g   t     ⁡     (     x     0   :   t       )       )       =       ∫         g   t     ⁡     (     x     0   :   t       )       ⁢           ⁢     p   ⁡     (       x     0   :   t       ⁢     |     ⁢     y     1   :   t         )       ⁢     ⅆ     x     0   :   t             ≈       1   N     ⁢       ∑     i   =   1     N     ⁢       g   t     ⁡     (     x     0   :   t       (   i   )       )                   
for some function of interest, g t , for instance the marginal conditional mean or the marginal conditional covariance or other moment.
 
     In one implementation the prediction matrix may be used to anticipate the optimal therapeutic intervention. Rather than wait for the characteristics of the parameters or trajectory to achieve a certain condition, the algorithm will base its output on the predicted future state of the patient using the tracking and prediction algorithms mentioned above. 
     Transform methods other than the Fourier method may be employed, for instance the Laplace, Hilbert, Radon, and Hankel transforms, as well as time frequency transforms such as the Gabor short time Fourier transform and the Wavelet transform. 
     Other data besides ECG data may be included as part of the description matrix and incorporated into the analysis algorithm, for instance pulse oximetry, capnography, respiration, impedance cardiography and blood pressure measurements. At least some of the data may remain in the time domain without any Fourier or other transform method being performed on it. Pulse oximetry, impedance cardiography, and blood pressure measurements may be used to augment the ECG to determine if a pulse is present. Capnography may be used to determine the overall effectiveness of cardiopulmonary resuscitation. 
     Large (˜5″ in diameter), self-adhesive electrical pads  98  are typically used to deliver defibrillation therapy to patients via defibrillation electrodes  100  ( FIG. 8 ). The pads also provide ECG monitoring through the same conductive surfaces of the defibrillation electrodes. In one implementation, additional small (˜0.5″ diameter) ECG electrodes  102  are integrated into the large pads that provide simultaneous monitoring of at least one additional electrical vector that is approximately orthogonal to the monitoring vector produced by the large defib/monitoring electrodes. A second matrix is then formed, identical in structure to the original SSM, but based on the orthogonal leads. The AED  10  can then perform techniques such as cross correlation on the two matrices to verify state changes. 
     In one embodiment, the two small ECG electrodes and large pads are configured such that there at least two mutually orthogonal ECG leads are generated. The vector sum of these leads generates a trajectory over time. The same methods for trajectory analysis described above may be used to analyze this trajectory as well. 
     As described previously, the AED  10  combines these sub-methods to determine appropriate therapy for the rescuer to perform on the victim. If uncertainty is included in the combination, the probability of defibrillation success is shown on the display of the device as a number between zero and one hundred, allowing the trained medical person such as a paramedic to make his own decision as to whether to shock the patient. In an implementation where the variance sub-method is used, the AED  10  may be configured such that the VF detection algorithm employing spectral variance may provide notification in the form of an audible or visual alarm indication that the paramedic should stop doing compressions for a more accurate analysis of the ECG waveform. In a more automated implementation, if the AED  10  determines that defibrillation has a low probability of success, the AED  10  may prompt the rescuer to perform CPR. During the course of CPR, the AED  10  may analyze the ECG continuously and prompt the rescuer to cease doing CPR when the AED  10  determines that the myocardium will be receptive to defibrillation. Following the defibrillation, the AED  10  may prompt the rescuer to deliver uninterrupted chest compressions, and the AED  10  may again monitor the underlying ECG waveform during compressions for the appropriate time to deliver the defibrillation therapy. As a result of the spectral analysis, the AED  10  may also determine that neither defibrillation nor CPR is appropriate, but rather drug and metabolic therapy such as epinephrine and glucose is appropriate, in which case the AED  10  will prompt the rescuer to deliver the appropriate therapy. 
     Many other implementations of the invention other than those described above are within the invention, which is defined by the following claims.