Functional analysis of neurophysiological data
09826914 · 2017-11-28
Assignee
Inventors
- Goded Shahaf (Haifa, IL)
- Amir B. Geva (Tel-Aviv, IL)
- Tomer Carmeli (Kiryat-Tivon, IL)
- Noga Pinchuk (Zikhron-Yaakov, IL)
- Israel Tauber (RaAnana, IL)
- Amit Reches (Binyamina, IL)
- Guy Ben-Bassat (Kibbutz Beit Zera, IL)
- Ayelet Kanter (Yokneam Ilit, IL)
- Urit Gordon (Kiryat-Tivon, IL)
Cpc classification
International classification
Abstract
A method for functional analysis of neurophysiological data by decomposing neurophysiological data and EEG signal to form a plurality of signal features. The signal features may then optionally be analyzed to determined one or more patterns.
Claims
1. A method of determining a brain activity pattern, the method comprising: using an EEG or brain imaging tool for obtaining neurophysiological data from a subject, while or after said subject is performing a task; using a data processor communicating with said EEG or brain imaging tool for: decomposing the data into a plurality of waveforms; identifying within said waveforms three-dimensional data patterns according to latency, amplitude and frequency of peaks of said waveforms; and determining brain activity patterns based on said data patterns; and displaying a graphic presentation of said activity patterns, said graphic presentation presenting brain regions that are active while or after said subject is performing said task.
2. The method according to claim 1, further comprising decomposing the data into a plurality of peaks.
3. The method according to claim 1, wherein the data are decomposed to a plurality of overlapping sets of waveforms.
4. The method according to claim 1, further comprising comparing said data patterns to a previously determined pattern.
5. The method according to claim 1, further comprising searching through a database of previously determined data patterns and selecting from said database a pattern closest to at least one of said identified data patterns.
6. The method according to claim 1, further comprising obtaining neurophysiological data also from at least one additional subject for a particular behavioral process, and associating said brain activity patterns with said behavioral process.
7. The method according to claim 1, wherein said neurophysiological data comprise data pertaining to a spontaneous brain activity.
8. The method according to claim 1, further comprising clustering said waveforms according to at least one of said latency, said amplitude and said frequency of peaks of said waveforms, to provide a plurality of clusters.
9. The method according to claim 1, further comprising determining a causality relation among data pattern components, and utilizing said relation to determine an activity network among said data patterns.
10. The method according to claim 9, further comprising determining a brain network activity (BNA) correlation to said activity network.
11. The method according to claim 10, wherein said determination of said BNA correlation comprises determining synchronization, or lack thereof, between a plurality of areas of the brain.
12. The method according to claim 10, wherein said identifying said data patterns comprises identifying source localizations for said BNA.
13. The method according to claim 12, further comprising comparing said data patterns to a previously determined pattern and correcting said source localizations based on said comparison.
14. The method according to claim 1, wherein said neurophysiological data comprises EEG signals.
15. The method according to claim 1, wherein said decomposing the data is effected by a wavelet transform.
16. The method according to claim 1, wherein said task is a conceptual task.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1) The above and further advantages of the present invention may be better understood by referring to the following description in conjunction with the accompanying drawings in which:
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19) It will be appreciated that for simplicity and clarity of illustration, elements shown in the drawings have not necessarily been drawn accurately or to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity or several physical components may be included in one functional block or element. Further, where considered appropriate, reference numerals may be repeated among the drawings to indicate corresponding or analogous elements. Moreover, some of the blocks depicted in the drawings may be combined into a single function.
DETAILED DESCRIPTION
(20) In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be understood by those of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and structures may not have been described in detail so as not to obscure the present invention.
(21) The method of the present invention features decomposing neurophysiological data to form a plurality of signal features. As described herein as a non-limiting, illustrative example only, the method of the present invention is described with regard to EEG data.
(22) EEG data is preferably collected in response to a stimulus or stimuli, such that signals are obtained from the subject before and after the application of the stimulus or stimuli. The stimulus or stimuli may optionally comprise any type of task and/or action, including conceptual tasks and/or actions (the latter may optionally be used with any subject but are preferred when the subject is suffering from some type of physical and/or cognitive deficit that may prevent actual execution of a task and/or action, as for example may be seen in response to various brain injuries such as stroke). The EEG data is then decomposed to form a plurality of signal features, which relate to the brain activity or activities generating the signal(s).
(23) Decomposition of EEG data preferably includes waveform analysis. Conventional waveform analysis is performed by examining the pattern of peaks; however, this method is flawed, because the true generator (i.e., brain and/or external neural location which produced the wave) is not known. According to preferred embodiments, the method of the present invention uses wavelet analysis and bandpass/bandwidth filtering to locate underlying aspects of the wave, such that the wave is decomposed to a plurality of overlapping sets of signal peaks which together make up the waveform. The filters themselves may optionally be overlapping. Even if the bandpass cutoff is not defined correctly, the preferred examination of data from a plurality of subjects results in identification only of repetitive peaks that make up the waveform. Such analysis may optionally be performed after the subject has been subjected to a stimulus or stimuli; if no such stimulus/stimuli are provided, then optionally a predetermined template may be provided and applied to the signals as described herein.
(24) These methods overcome drawbacks of the background art for decomposition of EEG data, which include poor characterization of the elementary waveforms which span the sampled recording. A discrete set of such elementary waveforms, which is both orthogonal and well established in neurophysiology, is not attainable. Furthermore, according to background art methods, the waveforms are not characterized in a sufficiently effective discrete manner with sufficiently simple identifiers through which complex repetitions over subjects could be identified.
(25) The use of multiple trials (i.e., repeated testing a single subject) preferably overcomes these drawbacks of the background art, although such multiple trials are not required in all instances.
(26) Next, the decomposition of the EEG data preferably continues through extraction of waveform essences. Once the correct set of one or more bandpass filters is selected, if the EEG signal peak is symmetric, only the time required for the peak to be reached (“time to peak”) and its height/amplitude are needed for further analysis. For non-symmetric peaks, an additional one or more bandpass filters are required to find symmetric peaks. These are waveform essences, and feature three vectors (time, amplitude and the identity of the bandpass filter itself) for each electrode. These three vectors are used to select or form the signal features, and/or are the signal features themselves.
(27) The signal features are preferably arranged as a time series, showing how the output of each electrode changes over time. Such a change over time is also preferably analyzed as part of the signal feature analysis, described in greater detail below.
(28) The signal features may then optionally be analyzed to determine one or more patterns, which may then in turn optionally be combined to form more comprehensive patterns.
(29) The patterns may optionally be identified through a raster plot, featuring results from a plurality of subjects, for example for a particular electrode or combination of electrodes, with the application of a particular bandpass and/or bandwidth filter. For example, the bandpass could optionally feature a threshold cut-off. Other methods for pattern identification include but are not limited to clustering, use of a template and/or application of one or more heuristic methods.
(30) Once the one or more patterns have been determined, preferably localization for the EEG signals is determined. Such localization is preferably determined according to a likelihood method.
(31) The principles and operation of methods according to the present invention may be better understood with reference to the drawings and accompanying descriptions.
(32) Before explaining at least one embodiment of the present invention in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of the components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments or of being practiced or carried out in various ways. Also, it is to be understood that the phraseology and terminology employed herein are for the purpose of description and should not be regarded as limiting.
(33) Reference is now made to
(34) In stage 1, EEG data is obtained as is known in the art. For obtaining such data, a subject has an array of electrodes placed on his or her head. The electrodes may optionally feature nanostructures such as carbon nanotubes (or other such suitable material(s)), or any type of MEMS (Micro-Electro-Mechanical Systems) electrodes as is known in the art, for contacting or being inserted into the scalp, for a more sensitive reading. Non-contact electrodes may also optionally be used. Each electrode is connected to one input of a differential amplifier (one amplifier per pair of electrodes); a common system reference electrode is connected to the other input of each differential amplifier. These amplifiers amplify the voltage between the active electrode and the reference. For the purpose of the present invention, the EEG signal is assumed to be collected through digital EEG, such that the amplified signal passes through an analog-to-digital converter. Different sampling rates are possible for the converter. As is known in the art, the correct (or at least a suitable) sampling rate and voltage amplification should be selected according to the task. For example, for a rapidly performed task, then preferably a quick sampling rate and high amplification are selected. Also the number and spacing of electrodes are selected as appropriate for the task.
(35) The electrical communication between the electrodes and the amplifier may optionally be performed through wires, but can also be wireless. The placement of the electrodes on the scalp may optionally be determined according to known methods. For example, a 10-20 EEG system may optionally be used, with activity recording from multiple locations, with a reference electrode and a ground. In some embodiments, eye movements (EOG) and muscle movements, and/or subthreshold activity (myopotential measurements instead of actual movements), are recorded as well.
(36) Optionally and preferably, the subject is presented with a stimulus or a set of stimuli, and activity is recorded during a response to the stimulus or stimuli. As noted above, the stimulus or stimuli are optionally simple (for example provision of a single audible sound) or complex (a cognitively demanding task). Also the stimulus or stimuli may optionally require performance of an actual action and/or task or alternatively may be conceptual in nature.
(37) In alternative embodiments, the subject is not presented with particular stimuli and responses, and activity is recorded during “spontaneous activity” or during particular activities. Many such protocols of stimuli, stimuli-responses, action-related and “spontaneous” activity are known in the art, and may include any stimulus-response neuropsychological tests such as the Stoop task, the Wisconsin card sorting test, etc; tests may include stimulus-only based tests such as mismatch negativity, BERA (brain-stem-evoked response audiometry), etc; they may include response-only based tests, such as saccade analysis, MRP (movement related potentials), N-back memory tasks and other working memory tasks, the “serial seven” test (counting back from 100 in jumps of seven), and Posner attention tasks etc; and they may optionally include “spontaneous” activity.
(38) Additionally or alternatively, the subject is tested in a non-laboratory or “natural” environment. Also additionally or alternatively, the subject is ambulatory during testing. The type(s) of tests performed may optionally comprise “spontaneous activity”, particular stimuli and responses, particular actions and/or tasks, or a combination thereof.
(39) The EEG digitized signals are optionally filtered before decomposition. Non-limiting examples of suitable filters include but are not limited to a high pass filter, a low pass filter and a “notch” filter, to account for the effect of power lines. Preferably, no filters are required to eliminate “noise” because multiple repetitions are averaged, such that true “noise” is eliminated as it is random. However, such filters may optionally be used and are preferably used for single trials in a single subject.
(40) In some embodiments, only single trials are used. In some embodiments, continuous input (i.e. a continuous stimulus or stimuli) may be used. For continuous input, optionally data may be acquired as a continuous stream where signal properties and/or event codes are used to identify stimulus onset.
(41) In stage 2, the EEG data is decomposed to form a plurality of signal features. The elementary events for the time-series could be filtered waveforms, wavelets, markers of wave amplitudes, etc.
(42) In stage 3, the signal features are analyzed to form one or more patterns. Such an analysis may optionally include arranging the signal features as a time-series for each subject, although preferably this process is performed only for signal features obtained as the result of provision of a stimulus or stimuli to the subject.
(43) In stage 4, the patterns are analyzed to determine source localization. It should be noted that in this embodiment the focus upon regions which repetitively participate in patterns over many subjects in research groups enables correction of inaccurate source localizations. For example, if an activity is “smeared” in one subject from region A to a neighboring region B, but consistently occurs in region A on many subjects of the research group, only region A will occur in a pattern.
(44) Optionally improved source localization and analysis of spatiotemporal patterns are performed, by posing constraints regarding possible signaling in particular areas according to other types of data, such as data obtained through other types of brain imaging and so forth.
(45) Reference is now made to
(46) First, one or more conditions (such as thresholds) for waveforms obtained from the electrodes (stage 203). In one embodiment, a binary type of threshold is used, wherein peak values above the threshold are included and values below the threshold are excluded. In another embodiment, a gradual scale may be included. As stated, not only peaks, but also wavelets, or other discrete identifiable elements for each electrode for the particular subject could be utilized. In one embodiment, waveforms which are of varying frequencies are separated out, and peaks are identified (stage 205) for each frequency at each electrode for each subject. This stage is repeated for all electrodes per subject.
(47) Next in stage 207, a raster plot for the full set of electrodes showing peaks over time. An example of a raster plot is depicted in
(48) The patterns involve the timed activation of sets of electrodes, with temporal, spatial and strength tolerance. This is based upon counting the number of times a particular signal strength is obtained at a particular time period, pairs of such events, and so on to larger and larger groups of such events. Thus, a simple counting method is used to determine a pattern wherein patterns of activation of a set of electrodes, each with its strength/temporal/spatial characteristics that are repetitive among subjects of a certain research group, are identified—all within their dynamic tolerances. It should be readily apparent that the greater the number of inputs (i.e., the number of experimental subjects or trials per subject used), the more robust the pattern analysis will be. Those patterns are later used for comparison, as will be described further hereinbelow. The identified patterns are then sent to source localizer 20 for source localization.
(49) Reference is now made to
(50) In stage 2, wavelet analysis is preferably used to separate superpositioned activity. Also any other wave characteristic could be used instead of peaks, such as wave envelope shape, etc. Other types of analyses may also optionally be used, such as application of a template (such as an expected form of a sinus wave) to the signals for example.
(51) In stage 3, decomposition of the EEG data preferably continues through extraction of waveform essences. Once the correct set of one or more bandpass filters is selected, if the EEG signal peak is symmetric, only the time required for the peak to be reached (“time to peak”) and its height/amplitude may optionally be used. For non-symmetric peaks, an additional one or more bandpass filters are required to find symmetric peaks. These are waveform essences, and feature three vectors (time, amplitude and the identity of the bandpass filter itself) for each electrode. These three vectors are used to select or form the signal features, and/or are the signal features themselves.
(52) In stage 4, the signal features are preferably arranged as a time series, showing how the output of each electrode changes over time. Such a change over time is also preferably analyzed as part of the signal feature analysis, described in greater detail below.
(53)
(54)
(55)
(56) These results collectively form a time series. The time series includes different subjects, trials (epochs) and stimulus types (here left vs. right) as identifiers. The values for the time series are electrode number, frequency, time and amplitude (direction is given by +/−, strength by number of such signs). Such data may also optionally be plotted as a three dimensional chart for each epoch, patient and electrode, with regard to amplitude, frequency and latency (time).
(57)
(58) As shown, in stage 1, a plurality of the previously described time series is provided. In stage 2, at least one comparison parameter is optionally and preferably adjusted. The comparison parameter determines the tolerance for a difference between two time series, which would still permit the two (or more) time series to be determined to be a match. The tolerance may optionally be provided in one or more of time, frequency and/or amplitude. Tolerance for timing is preferably continuous, while timing for amplitude is preferably based on the division of amplitude values to discrete ranges.
(59) In stage 3, a plurality of time series is preferably compared according to the comparison parameter. Optionally such comparison could include grouping the time series according to various parameters, including but not limited to one or more of statistical significance, group prevalence, pattern size in terms of participating elements, and so forth.
(60) A non-limiting illustrative method for determining the statistical relevance of a plurality of patterns may optionally be performed as described herein, with regard to a combinatorial test for evaluation of significance of the number of discriminatory patterns. The example for this test relates to an experiment in which two groups are being compared.
(61) Let the discriminatory level be defined as the difference in the number of individuals positive for a certain pattern between the two groups. Let ‘d’ denote this number. Let the number of individuals tested be ‘n1’ for the first group and ‘n2’ for the second group. Let ‘Sum’ denote the number of individuals (from both groups) for which a certain pattern was positive. Suppose, that d≧7 is chosen, for an experiment in which n1=n2=10.
(62) The combinatorial number of possible bit vectors for which d≧7 is possible for this experiment is calculated. In this case the number is 2702. {The calculation sums the values of (n1 over A)*(n2 over B)*2—which stands for all the permutation in which A individuals are positive from n1, and B from n2. In addition—this value is multiplied by 2 from symmetrical reasons—i.e. it does not matter whether group A has 7 positive signals and group B has 0 or vice versa. In case it is important (e.g. a comparisons of Experimental or Treatment vs. Control groups) this value should not be multiplied by 2}.
(63) Let Ω denote the space of bit vectors options for which ‘Sum’ can produce results of d>=7. In this specific case Ω={7≦Sum≦13}. Now, the expected frequency of bit vectors for which d≧7 out of the space Ω is estimated. Let this frequency be denoted as P7. Accordingly p7=N({d≧7})/N(Ω).
(64) Let ‘k’ denote the actual number of patterns for which {7≦Sum≦13}. Let ‘Xk’ be the number of actual patterns for which d≧7. The distribution of Xk is assumed to be binomial: Xk˜Bin(k, p7). The p value is measured as Pr(Xk≧bin(k, p7)). This test will produce the cumulative probability of getting a number between 0 and Xk, whereas we need the cumulative probability of getting Xk or more. Hence the p value will be 1−(probability given by the test). The test has certain assumptions. For example, all the possible patterns are assumed to have been given by the algorithm without filtering. Also it is assumed that there is independence between patterns and bit vector division between the two groups under the null distribution.
(65) In stage 4, optionally one or more patterns are eliminated (such an elimination process could optionally also be performed between stages 1 and 2 for example, and/or before stage 3, for example). Non-limiting examples of patterns which are preferably include patterns that distinguish between research groups and/or combinations of patterns which complement one another.
(66) In stage 5, causality among pattern components is optionally and preferably analyzed. For example, optionally a statistical analysis is performed to determine whether the pattern components are likely to be linked in some manner. Automatic evaluation of group thresholds for time, frequency and amplitude is performed by searching for patterns, which occur in some members of the experimental groups, in the data of the other members. For example, if some members of a group exhibit a particular pattern, then preferably data from other members of the group is re-examined in order to determine whether in fact such a pattern exists, even in a more muted form.
(67) Optionally such searching may be performed by placing the portions of patterns (for example source localizations) in a tree and then searching the tree for the best differentiator as cluster criterion.
(68)
(69)
(70)
(71) In stage 2, the minimum and maximum (min max) points are calculated. In stage 3, all min max points that are over a threshold are saved. The threshold preferably depends on the standard deviation.
(72) In stage 4, each point is characterized based on the voltage range where it falls. For example, the simplest characterization is binary such that there are two voltage groups, positive or negative.
(73) In stage 5, preferably a characteristic/representative temporary template that contains the electrode and that has the maximum value of all the electrodes for each sample point is located. Such a temporary template may then optionally be used to characterize the data from a single trial.
(74)
(75) The expressions are ordered and presented by their ability to explain the variance of the entire set of expressions. This is modeled by the similarity index (SI). The similarity index is computed for a specific set of clusters (or single cluster) over the entire set of expressions. For each cluster, a representative expression is found, and the worst distance of that expression to the expressions within its cluster is computed. The representative or typical expression is preferably defined for a cluster of the entire set of expressions. The expression with the shortest distance (the minimal sum of distances) to the rest of the cluster is defined as the representative or typical expression.
(76) From all the worst distances of the clusters in the set, a single average distance is computed. This is the average distance. The similarity index is defined as one minus this distance. This index can vary between 0 (complete identity) and 1 (maximal distance). There is a tradeoff between the number of expressions in a subset of the entire set and the SI. Preferably, the user is able to choose where to draw this line, according to the user's specific needs.
(77) As shown with regard to
(78) For each such group, the collapsed pattern is computed in stage two. The collapsed pattern is the common denominator of all the patterns in the group of bitvector-identical patterns. In order to form this pattern, initially all patterns in the group are transformed from relative to absolute: In a pattern, only the anchor appears in absolute time. The rest of the regions appear in a time relative to the anchor. Each relative time segment is transformed to an absolute time segment in the following manner. Suppose the anchor's time segment is [t1 t2] and the region's time segment is [d1 d2]. The ‘absolute’ time segment of the region will therefore be [t1+d1 t2+d2]. After this conversion, the absolute-time patterns are then collapsed into a single pattern, such that for each region that appears in any pattern, the common time denominator is computed (the time segment which will include all times of appearance of this region in all patterns). The collapsed pattern is preferably the pattern which is composed of all these regions and time segments.
(79) In stage 3, for N expressions, an <N×N> distance matrix between expressions is calculated. The distance between two expressions is preferably calculated as follows: remove all identical minterms from the two expressions. On the minterms that remain, for all possible permutations of minterms, find the sum of distances between the corresponding collapsed patterns. The minimal sum of all possible sums of the permutations normalized by the number of minterms in the longer expression is the distance between the expressions.
(80) The distance between two collapsed patterns is preferably calculated as follows. Assume there are two patterns, A and B. Because the distance function is directional, it computes the distance from the long pattern (assume A) to the short pattern. For each region in A, the function searches for the identical region in B. If found, the function computes the overlap index—the absolute overlapping time divided by the time the region operated in the long pattern. This is a number between zero and one. This number is added to the overall distance between two patterns. The same process is repeated for every region in the long pattern. The total sum is normalized by the total number of unique regions in both patterns. Again, a number between zero and one is achieved. Zero would mean no overlap and one would mean complete identity. Therefore, to achieve a distance function, the final number is 1 minus the number we have reached. This is the distance between two patterns.
(81) In stage 4, a hierarchical clustering is generated according to the distances calculated above. In stage 5, the hierarchical clustering is preferably analyzed according to a similarity index (SI) calculation, which is more preferably performed as follows. First, create a cluster set of k clusters (starting from one and incrementing until k equals the number of expressions). The criterion for generation the clusters is the distance. Next, for each cluster formed, find the expression with the shortest average distance to the rest of the expressions in the cluster. This expression is defined as the typical or representative expression of the cluster. For the set of clusters and their corresponding typical expressions, calculate the similarity index (described above).
(82) In stage 6, the results are preferably output. Various output displays are possible, as shown for example in
(83) Of course non-graphic representations are also possible, for example by presenting a data set with the sets of expressions sorted by size. For each set, all expressions are presented. For each expression, all patterns are presented. For each pattern, the collapsed pattern and the best pattern in the BV group are presented. The best pattern is preferably defined over a group of bitvector-identical patterns. It is the longest pattern (region-wise) with the minimal sum of time segments (and therefore can be seen as the most specific).
(84) As previously described, EEG is optionally and preferably filtered before further analysis is performed. Such filtering may also optionally include temporal filtering and discretization, as described in greater detail below.
(85) Briefly, each electrode in each single epoch is filtered into overlapping frequency bands in order to separate the EEG activity into basic well known brain processes. In the example shown in
(86) It has been previously demonstrated that the activity measured and the data obtained from individual electrodes may vary significantly between individuals; furthermore, measurements may also vary between electrodes for a single individual. Optionally and preferably, another type of filtering or signal adjustment therefore includes one or more adjustments to overcome this type of variation. Therefore the activity in each electrode is z-score normalized to standardize across subjects.
(87) In the next stage all the local positive and negative peaks of all the filtered signals are found and their latency and amplitude are saved. The activity of a single electrode (e.g. O1 below) for a single epoch in a given frequency band can be then reduced into the times and sizes of the amplitudes of the various waveforms. The activity presented is evoked by face stimulus. The time and amplitude of two waveform peaks are presented in orange (top) and green (bottom) in
(88) Events can then be described per each electrode and each subject in a 3D space of frequency, latency and amplitude. For example, such results for two subjects are presented in
(89) EEG signals are then preferably analyzed to determine the relationship between functional events. As previously described, after filtering, clustering is preferably used to determine the relationship between such events. The above time-amplitude-frequency space can be clustered into synchronized events and the relationship between thus combined events can be found. One way to do this is by defined a parametrically moving window over relative time between subjects (and possibly epochs) to scan the delta between pairs of electrode activities to gain repetitive patterns of relative timing. There is preferably some tolerance around the limits of both moving windows to enable the joining or union of similar patterns.
(90) For the purpose of description and without wishing to be limited in any way, the below example centers around combination of events as pairs; however it is also possible to combine events in larger groups (triples, quads, quints and so forth) for larger network relationships.
(91) Turning now to the drawing, as shown in
(92) After finding such pairs of synchronized events, preferably one or more pairs are combined into trios etc. by merging pairs that share an overlapping event, optionally until no larger event networks can be found. For example, event times of 4 electrodes P7 (blue), P8 (green), in frequency range 17-23 Hz and O1 (orange), O2 (yellow), in frequency range 5-8 Hz after face stimulus for 9 different subjects. There is variability with regard to precise time delta between pairs of events.
(93) After finding the activated network for each task in the previous stage, the timing of each event in each network is extracted from the raw ERP's of each subject. The raw activities of all electrodes at those times are then utilized for standard source localization (LORETA, described previously). The voxels activities are summarized over Talairach-defined Brodmann areas, although it should be noted that any other type of functional or neuropsychological area division or categorization could optionally be used. The activity of each region is normalized with z-score so as to overcome inter-subject structural differences which cause different electrode readings between subjects due to different conductivity. The z-scores of activity for each region in each subject are ordered and the rank of at the activity timing is computed. A uniform rank threshold is computed. If sufficient subjects show activity above this threshold, the region is preferably considered significantly active for this network activity. Regardless of the exact cortical region categorization that is used, the output of this stage is a set of cortical regions (for example and without limitation, Brodmann areas) with the greatest likelihood to form a functional network involved in a given task.
(94) Furthermore, it is also possible to use the Talairach Distance to estimate the location of the subset of electrodes that would be expected to provide the most useful information regarding a particular pattern, determined as described above. The coordinates of the N regions in the target network activity pattern are marked by Ti(x,y,z), i=1, . . . , N, and the coordinates of the M regions in the observed network activity pattern are marked by Oj(x,y,z), j=1, . . . , M.
(95) For each Oj(x,y,z), j=1, . . . , M, the distance is computed to the nearest Ti(x,y,z), i=1, . . . , N, and mark it by Dj.
(96) The Talairach Distance is then computed by Eq. 1:
(97)
(98) Based on application of spatio-temporal pattern recognition methods to the EEG electrodes data as described herein, or any other method, one can find a reduced set of electrodes that are sufficient for separating between different normal or abnormal responses to a specific set of stimuli. The electrodes can be directed in the optimal way for the specific task being performed by the subject.
(99) Optionally and preferably, the above localization may be adjusted according to a weighting parameter. This weighting parameter determines the extent to which preference is given to activity near the electrode. Such preference may optionally be made due the possibility that activity in two or more neighboring areas, may actually be occurring underneath the external tissue. If the parameter is given a weight of zero, then the resultant localization is identical to that obtained through LORETA.
(100)
(101) The above processes support analysis by single trials. For such an analysis to be performed, first a plurality of single trials is performed on different individuals, preferably a large number of such individuals (for example and without limitation, hundreds, thousands and so forth), rather than performing multiple trials on a single individual (and then repeating for a plurality of individuals). Statistical strength is obtained by performing single trials with multiple individuals, as each such trial is therefore not related to any other trial; also, it is not necessary to compare two groups in order to obtain statistical strength, even though the Z-score is much lower in single trials because of a greater amount of noise. Single trials also provide additional detection sensitivity as averaging may result in loss of the actual signal, as the brain activity or activities may not be identical between trials in a single person. Therefore, single trials may also provide more data than multiple trials performed on a single subject.
(102) Once a pattern has been determined by performing such single trials on multiple individuals, it is possible to analyze a single trial from a single individual according to the pattern of signals obtained from multiple electrodes with specific timing, which is then compared to the previously obtained pattern.
(103) Although the invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall within the spirit and broad scope of the appended claims. All publications, patents and patent applications mentioned in this specification are herein incorporated in their entirety by reference into the specification, to the same extent as if each individual publication, patent or patent application was specifically and individually indicated to be incorporated herein by reference. In addition, citation or identification of any reference in this application shall not be construed as an admission that such reference is available as prior art to the present invention.
(104) While certain features of the present invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents may occur to those of ordinary skill in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the present invention.