LOCATING AN EPILEPTOGENIC ZONE FOR SURGICAL PLANNING

Abstract

A machine-implemented method, computing device, and at least one non-transitory computer-readable medium are provided. A dynamical network model is parameterized by state transition matrices based on monitored interictal brain data. A node influence-to network score for each respective node is calculated indicating how influential the respective node is. An influenced-by score is calculated for the each respective node indicating an amount by which the respective node is influenced by the nodes. A score is calculated for the each respective node based on a sink index, a source influence index, and a sink connectivity index. Nodes that are in the epileptogenic zone are determined based on the calculated score for each of the nodes. An indication of the nodes in the epileptogenic zone is provided.

Claims

1. A machine-implemented method for identifying for treatment an epileptogenic zone in a brain of a person diagnosed with epilepsy, the machine-implemented method comprising: parameterizing, by a computing device, a dynamical network model by a plurality of state transition matrices based on a plurality of neural state vectors formed from interictal data generated by monitoring each node of a plurality of nodes of the brain during each of a plurality of consecutive predefined time windows, each of the plurality of nodes corresponding to a respective area of the brain being monitored; calculating, by the computing device for each of a plurality of state transition matrices, a corresponding node influence-to network score and a corresponding node influenced-by network score for each node of the plurality of nodes, the corresponding node influence-to network score indicating how influential the respective node is regarding the each of the plurality of nodes and the node influenced-by score indicating an amount by which the respective node is influenced by the plurality of nodes; calculating, by the computing device for the each state transition matrix, a sink index, a source influence index for the each respective node, and a sink connectivity index for the each respective node, the sink index for the each respective node indicating how far the each respective node is from an ideal sink when one of rows and columns of a two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the node influence-to network score and another of the rows and the columns of the two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the node influenced-by network score, the source influence index for the each respective node being based on a sum of an influence of the plurality of nodes on a respective node weighted by a source index of the node, and the sink connectivity index of the each respective node being based on a sum of an influence of the plurality of nodes weighted by a sink index of the each node; calculating, by the computing device, a score for the each respective node based on the source influence index, the sink index, and the sink connectivity index for the respective node; determining, by the computing device, nodes of the plurality of nodes that are in the epileptogenic zone based on the calculated score for each of the plurality of nodes; and providing an indication of the nodes determined to be in the epileptogenic zone for clinicians to plan a surgical treatment involving the epileptogenic zone.

2. The machine-implemented method of claim 1, wherein a first plurality of nodes are determined to be in the epileptogenic zone when a corresponding average score over the plurality of state transition matrices of each node of the first plurality of nodes is greater than a predefined percentage of corresponding average scores of the plurality of nodes.

3. The machine-implemented method of claim 1, further comprising: training, by the computing device, a predictive model to estimate a probability of a successful outcome based on training data regarding each respective patient of a plurality of patients, the training data including first nodes labeled as being in a seizure onset zone, a clinically annotated epileptogenic zone including the first nodes, and second nodes not included in the clinically annotated epileptogenic zone, wherein successful outcomes are defined as a patient being seizure free after more than 12 months post-op, and failed outcomes are defined as the patient having a seizure recurrence at more than 12 months post-op; and determining, by the computing device, a probability of success based on the trained predictive model, using an average sink index of nodes of the plurality of nodes determined to be in the epileptogenic zone, an average sink index of all nodes outside of the epileptogenic zone, an average source influence index of the nodes determined to be in the epileptogenic zone, and an average source influence index of the nodes determined to be outside of the epileptogenic zone.

4. The machine-implemented method of claim 3, wherein: the predictive model is a logistic regression model, and the training of the logistic regression model is based on $\log \left(\frac{p_s}{1-p_s}\right)={}_0+{}_1\left({\mathrm{sink}}_{EZ}-{\mathrm{sink}}_{nonEZ}\right)+{}_2\left(sr{c}_{EZ}-sr{c}_{nonEZ}\right)+{}_3\left(con{n}_{EZ}-\mathrm{con}{n}_{nonEZ}\right),$ where p.sub.s is the probability of success, sink.sub.EZ is the average sink index over the nodes in the clinically annotated epileptogenic zone, sink.sub.nonEZ is the average sink index over the nodes outside of the clinically annotated epileptogenic zone, src.sub.EZ is the average source influence index over the nodes in the clinically annotated epileptogenic zone, srC.sub.nonEZ is the average source influence index over the nodes outside of the clinically annotated epileptogenic zone, conn.sub.EZ is an average sink connectivity index over the nodes in the clinically annotated epileptogenic zone, conn.sub.nonEZ is the average sink connectivity index over the nodes outside of the clinically annotated epileptogenic zone.

5. The machine-implemented method of claim 3, wherein when the determined probability of success is greater than a threshold value, a successful outcome is predicted.

6. The machine-implemented method of claim 1, wherein the interictal data is generated based on invasive monitoring of the brain for a time period from between 30 seconds to 60 minutes.

7. The machine-implemented method of claim 1, further comprising: generating, by the computing device, a heat map for the plurality of nodes, the generating comprising: for each respective state transition matrix corresponding to a respective predefined time window: calculating, by the computing device, a respective score for the each respective node, the respective score being calculated by multiplying, based on the respective state transition matrix, a source influence index for the respective node, a sink index for the respective node, and a sink connectivity index for the respective node to produce the respective scores for the respective nodes during the respective time windows, assigning a respective color to the each respective node in the each respective time window based on a corresponding range of values that includes the respective score for the each respective node in the corresponding time window, and generating and presenting the heat map including one of rows and columns representing each of the respective nodes and another of the rows and columns representing respective predefined time windows arranged in chronological order, intersections of rows with columns forming cells, each of the cells representing a specific respective node during a specific respective predefined time window, each of the cells displaying the color assigned to the specific respective node for the specific respective time window represented by the each of the cells.

8. A computing device for aiding a clinician to diagnose a patient as having epilepsy, the computing device comprising: at least one processor; and a memory connected to the at least one processor, wherein: the at least one processor is configured to: parameterize a dynamical network model by a plurality of state transition matrices based on a plurality of neural state vectors formed from interictal data generated by non-invasively monitoring each node of a plurality of nodes of the brain during each of a plurality of consecutive predefined time windows, each of the plurality of nodes corresponding to a respective area of the brain being monitored; calculate, for each of the plurality of state transition matrices, a node influence-to network score and a node influenced-by network score, respectively, for each respective node of the plurality of nodes, the node influence-to network score indicating how influential the respective node is regarding the each of the plurality of nodes, and the node influenced-by network score indicating an amount by which a respective node is influenced by the plurality of nodes; for each respective state transition matrix corresponding to a respective predefined time window: calculate a score for the each respective node, the respective score being calculated as a function, based on the respective state transition matrix, a source influence index for the respective node, a sink index for the respective node, and a sink connectivity index for the respective node to produce the respective score for the each respective node for the respective predefined time window, the sink index for the each respective node indicating how far the each respective node is from an ideal sink when one of rows and columns of a two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the node influence-to network score and another of the rows and the columns of the two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the node influenced-by network score, the source influence index for the each respective node being based on a sum of an influence of the plurality of nodes on a respective node weighted by a source index of each node, and the sink connectivity index of the each respective node being based on a sum of an influence of the plurality of nodes weighted by a sink index of each node; calculate a mean score for each of the plurality of nodes based on the calculated score for each of the plurality of nodes over the each respective state transition matrix; and normalize the mean score for the each of the plurality of nodes; and count a number of nodes having mean scores greater than $\frac{1}{N},$ where the N is a total number of nodes, wherein: when the count of the number of nodes is greater than a predefined percentage of the total number of nodes, epilepsy is indicated, and when the count of the number of nodes is less than or equal to the predefined percentage of the total number of nodes, a healthy brain is indicated.

9. The computing device of claim 8, wherein the at least one processor is further configured to: assign a respective color to the each respective node in the each respective time window based on a corresponding range of values that includes the respective score for the each respective node in the each respective time window, and generate and present a heat map including one of rows and columns representing each of the respective nodes and another of the rows and columns representing respective predefined time windows arranged in chronological order, intersections of rows with columns forming cells, each of the cells representing a specific respective node during a specific respective predefined time window, each of the cells displaying the color assigned to the specific respective node for the specific respective time window represented by the each of the cells.

10. The computing device of claim 8, wherein the at least one processor is further configured to: receive the interictal data generated from a scalp electroencephalogram of the patient.

11. The computing device of claim 8, wherein the at least one processor is further configured to: receive the interictal data generated from a non-invasive magnetoencephalogram of a brain of the patient.

12. At least one non-transitory computer-readable storage medium having computer instructions stored thereon for identifying an epileptogenic zone in a brain of a person diagnosed with epilepsy, when executed by at least one processor of a computing device, the computing device is configured to perform: parameterizing a dynamical network model by a plurality of state transition matrices based on a plurality of neural state vectors formed from interictal data generated by invasive monitoring of each node of a plurality of nodes of the brain during each of a plurality of consecutive predefined time windows, each of the plurality of nodes corresponding to a respective probe implanted in a respective area of the brain; calculating, based on the each respective state transition matrix, a sink index for each of the plurality of nodes, a source influence index for the each of the plurality of nodes, and a sink connectivity index for the each of the plurality of nodes, the sink index for the each respective node indicating how far the each respective node is from an ideal sink when one of rows and columns of a two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the influence-to score and another of the rows and the columns of the two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the influenced-by score, the source influence index for each respective node being based on a sum of an influence of the plurality of nodes on a respective node weighted by a source index of each node, and the sink connectivity index of the each respective node being based on a sum of an influence of the plurality of nodes on the each respective node weighted by a sink index of each node; calculating a score for the each respective node based on an average of the source influence index, an average of the sink index, and an average of the sink connectivity index for the respective node over the plurality of state transition matrices; and determining nodes of the plurality of nodes that are in the epileptogenic zone based on the calculated score for the each respective node of the plurality of nodes; and providing an indication of the determined nodes in the epileptogenic zone for clinicians to plan a surgical treatment involving the epileptogenic zone.

13. The at least one non-transitory computer-readable storage medium of claim 12, wherein the calculating of the score for the each respective node further comprises: calculating a function (e.g., the product) of the average of the sink index, the average of the source influence index, and the average of the sink connectivity index for the each respective node to produce the score for the each respective node.

14. The at least one non-transitory computer-readable storage medium of claim 12, wherein the interictal data is generated from 30 seconds to 60 minutes of the invasive monitoring.

15. The at least one non-transitory computer-readable medium of claim 12, wherein a first plurality of nodes are determined to be in the epileptogenic zone when a corresponding score of each node of the first plurality of nodes is greater than a threshold value.

16. The at least one non-transitory computer-readable medium of claim 12, wherein a first plurality of nodes are determined to be outside of the epileptogenic zone when a corresponding score of each node of the first plurality of nodes is less than a threshold value.

17. The at least one non-transitory computer-readable medium of claim 12, wherein when executed by the at least one processor of the computing device, the computing device is configured to perform: training a predictive model to estimate a probability of a successful outcome based on training data regarding each respective patient of a plurality of patients, the training data including a first plurality of nodes labeled as being in a clinically annotated epileptogenic zone, and a second plurality of nodes indicated as being outside of the clinically annotated epileptogenic zone, wherein successful outcomes are defined as a patient being seizure free after more than 12 months post-op, and failed outcomes are defined as the patient having a seizure recurrence at more than 12 months post-op; and determining a probability of success based on the trained predictive model, using an average sink index of nodes of the plurality of nodes determined to be in the epileptogenic zone, an average sink index of nodes of the plurality of nodes determined to be outside of the epileptogenic zone, an average source influence index of the nodes of the plurality of nodes determined to be in the epileptogenic zone, an average source influence index of the nodes of the plurality of nodes determined to be outside of the epileptogenic zone, an average sink connectivity index of the nodes of the plurality of nodes determined to be in the epileptogenic zone, and an average sink connectivity index of the nodes of the plurality of nodes determined to be outside of the epileptogenic zone.

18. The non-transitory computer-readable medium of claim 12, wherein the interictal data is generated based on the invasive monitoring of the brain for less than 60 minutes.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0015] FIG. 1 illustrates an example environment in which various embodiments may operate.

[0016] FIG. 2 is an example diagram of a processing device that may implement a server or a computing device in the example environment shown by FIG. 1.

[0017] FIG. 3 illustrates an example workflow that includes monitoring nodes (i.e. channels of electrodes) placed in different areas of a brain of a patient to generate interictal iEEG data that includes multiple neural state vectors (one neural state vector per node for each respective predefined time window), from which dynamical network models (DNMs) may be derived.

[0018] FIG. 4 shows an example of 4 nodes in an N node iEEG network, one of which is a source node that influences other nodes and another of which is determined to be a sink node that is highly influenced by the source node.

[0019] FIG. 5 shows an example two-dimensional representation of the nodes in an N node iEEG network in which columns are ranked according to an influence of nodes on each respective node and rows are ranked according to an influence of nodes on respective nodes.

[0020] FIG. 6 is a flowchart of an example process for determining nodes that are in an epileptogenic zone based on influential relationships among the nodes.

[0021] FIG. 7 is a flowchart of an example process for training a model to estimate a probability of a successful surgical outcome based on influential relationships among the nodes.

[0022] FIG. 8 shows a flowchart of an example process for generating a heat map indicating, by colors, ranges of scores for respective nodes based on influential relationships among nodes in an iEEG network over multiple consecutive time windows.

DETAILED DESCRIPTION OF THE INVENTION

Definition of Terms

[0023] Node Influence-To-Network Score: A node influence-to-network score may be calculated for each of the nodes in a state transition matrix. For example, in embodiments in which each column of a state transition matrix, A, has values representing an influence of a respective node in an interictal intracranial EEG (iEEG) network on the remaining network nodes, and each row of the A matrix has values representing an amount of which a respective node is influenced by the remaining nodes in the iEEG network, the node influence-to-network score of node i can be calculated for each state transition matrix of an N-node network according to .sub.j=1.sup.N A.sub.ji.

[0024] Node Influenced-By-Network Score: A node influenced-by-network score may be calculated for each of the nodes in a state transition matrix. For example, in embodiments in which each column of a state transition matrix, A, has values representing an influence of a respective node on each remaining node in an interictal intracranial EEG (iEEG) network, and each row of the A matrix has values representing an amount of which a respective node is influenced by the remaining nodes in the iEEG network, the node influenced-by network score of node i can be calculated for each state transition matrix of an N-node network according to .sub.j=1.sup.N A.sub.ji.

[0025] Sink Index: A sink index for each respective node indicates how far the each respective node is from an ideal sink when one of rows and columns of a two-dimensional representation of the nodes is arranged according to a rank of the each respective node with respect to a node influence-to-network score and another of the rows and columns of the two-dimensional representation of the nodes is arranged according to a rank of the each respective node with respect to the node influence-by-network score. The sink index of node, or channel, i may be calculated according to

[00002]${\mathrm{sink}}_i=\sqrt{2}-.Math.\left(r_i,c_i\right)-\left(1,\frac{1}{N}\right).Math.$

where (r.sub.i, c.sub.i) corresponds to a row and column rank of a node, or channel, i. A value of the row rank and the column rank for an ideal sink is

[00003]$\left(1,\frac{1}{N}\right).$

See FIG. 5.

[0026] Source Index: a source index for each respective node indicates how far the each respective node is from an ideal source when one of rows and columns of a two-dimensional representation of the nodes is arranged according to a rank of the each respective node with respect to the node influence-to-network score and another of the rows and columns of the two-dimensional representation of the plurality of nodes is arranged according to a rank of the each respective node with respect to the node influenced-by-network score. The source index may be calculated according to

[00004]${\mathrm{source}}_i=\sqrt{2}-.Math.\left(r_i,c_i\right)-\left(\frac{1}{N},1\right).Math.$

where the ideal source index has a row and column rank of

[00005]$\left(\frac{1}{N},1\right).$

See FIG. 5.

[0027] Source Influence Index: a source influence index quantifies how much sources influence a node, or channel, i. The source influence index may be calculated according to

infl.sub.i.sup.w=.sub.j=1.sup.N abs(A.sub.ij)source.sub.j.sup.w

where w is a time window. A high source influence suggests that node, or channel, i received strong influences from sources in the interictal dynamical network model (DNM).

[0028] Sink Connectivity Index: A sink connectivity index quantifies a strength of connections from top sinks to node, or channel, i. The sink connectivity index may be calculated according to

conn.sub.i.sup.w=.sub.j=1.sup.N abs(A.sub.ij)sink.sub.j.sup.w

where w refers to a time window.

DESCRIPTION OF EMBODIMENTS

[0029] In various embodiments, a predictive power of dynamical network models (DNMs) leverage iEEG data collected to assist in localizing an EZ. DNMs are generative models that capture how every channel or node interacts with every other channel or node dynamically. A DNM based on interictal iEEG data takes the form of a linear time-varying (LTV) DNM that mathematically describes how each observed region of a brain, i.e., an iEEG contact signal or node, interacts with other regions during spontaneous neural activity. The LTV DNM may be constructed by concatenating a sequence of linear time-invariant (LTI) DNMs derived in predefined equal consecutive time windows of the iEEG data. In one embodiment, the predefined equal consecutive time windows are 500 millisecond windows in a form of:

x(t+1)=Ax(t)

where x(t).sup.n1 is denoted as a neural state vector, A.sup.nn is a state transition matrix, and n is a number of channels or nodes.

[0030] FIG. 1 shows an example environment 100 in which various embodiments may operate. Invasive or non-invasive monitoring of interictal data of a brain of a patient 102 diagnosed with epilepsy may be recorded to a server 104. The monitoring may be performed via iEEG, or any other method of recording electrical signals or magnetic fields in the brain. Server 104 may include a single server or multiple servers configured as a server farm. A computing device 106 may receive the recorded interictal data from server 104 via a network 108 and may analyze the interictal data to determine nodes that are sources and other nodes that are sinks, as well as nodes that are determined to be in an EZ. Network 108 may include a direct wired or wireless connection between server 104 and computing device 106 in some embodiments. In other embodiments, network 108 may include a single network or a network of networks such as, for example, a packet switching network, a local area network, a wide area network, an Internet, as well as other types of networks. Server 104 and computing device 106 may have a wired or wireless connection to network 108.

[0031] FIG. 2 illustrates an example computing system 200 that may implement any of server 104 and/or computing device 106. Computing system 200 is shown in a form of a general-purpose computing device. Components of computing system 200 may include, but are not limited to, one or more processing units 216, a system memory 228, and a bus 218 that couples various system components including system memory 228 to one or more processing units 216.

[0032] Bus 218 represents any one or more of several bus structure types, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. Such architectures may include, but not be limited to, Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnects (PCI) bus.

[0033] Computing system 200 may include various non-transitory computer system readable media, which may be any available non-transitory media accessible by computing system 200. The computer system readable media may include volatile and non-volatile non-transitory media as well as removable and non-removable non-transitory media.

[0034] System memory 228 may include non-transitory volatile memory, such as random access memory (RAM) 230 and cache memory 234. System memory 228 also may include non-transitory non-volatile memory including, but not limited to, read-only memory (ROM) 232 and storage system 236. Storage system 236 may be provided for reading from and writing to a non-removable, non-volatile magnetic medium, which may include a hard drive or a Secure Digital (SD) card. In addition, a magnetic disk drive, not shown, may be provided for reading from and writing to a removable, non-volatile magnetic disk such as, for example, a floppy disk, and an optical disk drive for reading from or writing to a removable non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media. Each memory device may be connected to bus 218 by at least one data media interface. System memory 228 further may include instructions for processing unit(s) 216 to configure computing system 200 to perform functions of embodiments of the invention. For example, system memory 228 also may include, but not be limited to, processor instructions for an operating system, at least one application program, other program modules, program data, and an implementation of a networking environment.

[0035] Computing system 200 may communicate with one or more external devices 214 including, but not limited to, one or more displays, a keyboard, a pointing device, a speaker, at least one device that enables a user to interact with computing system 200, and any devices including, but not limited to, a network card, a modem, etc. that enable computing system 200 to communicate with one or more other computing devices. The communication can occur via Input/Output (I/O) interfaces 222. Computing system 200 can communicate with one or more networks including, but not limited to, a local area network (LAN), a general wide area network (WAN), a packet-switched data network (PSDN) and/or a public network such as, for example, the Internet, via network adapter 220. As depicted, network adapter 220 communicates with the other components of computer system 200 via bus 218.

[0036] It should be understood that, although not shown, other hardware and/or software components could be used in conjunction with computer system 200. Examples, include, but are not limited to, microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.

[0037] FIG. 3 shows an example workflow of various embodiments. The workflow includes a computing device receiving recorded results of monitoring nodes (i.e. channel contacts) 300, which include multiple neural state vectors 310, shown in FIG. 3 as rows of values for each node (nodes x.sub.1 to x.sub.8 in an 8-node network) during a sequence of n multiple equal consecutive predetermined time windows, t.sub.i to t.sub.n. The equal consecutive predetermined time windows may each be 500 milliseconds, one second, or another suitable length of time. The neural state vector for each of the nodes in each equal predetermined time window may be parameterized as multiple state transition matrices shown in a form of respective A matrices 320, which estimate a DNM. The DNM is generative and can simulate iEEG time-series data over time.

[0038] In at least some embodiments, each column of an A matrix has values representing an influence of each respective node in the iEEG network on the remaining nodes, and each row of the A matrix has values representing an amount by which each respective node is influenced by the remaining nodes in the iEEG network. For example, with respect to an 8-node network with reference to A matrices 320, A.sub.11 is a value representing an influence of node x.sub.1 on itself, A.sub.12 is a value representing an influence of node x.sub.2 on node x.sub.1, . . . , and node A.sub.18 is a value representing an influence of node x.sub.8 on node x.sub.1. With respect to columns of an A matrix, A.sub.18 is a value representing how much node x.sub.1 is influenced by node x.sub.8, A.sub.28 is a value representing how much node x.sub.2 is influenced by node x.sub.8 . . . , and A.sub.88 is a value representing how much node x.sub.8 is influenced by itself.

[0039] In other embodiments, each column of an A matrix has values representing an influence of a respective node on each node in the iEEG network, and each row of the A matrix has values representing an influence of each node in the iEEG network on a respective node.

[0040] In the various embodiments, an LTV DNM parameterized from recorded interictal iEEG may be used to identify two groups of nodes in the iEEG network. The two groups of nodes are nodes that are continuously inhibiting neighboring nodes (denoted as source nodes) and the nodes that are being inhibited by the source nodes (denoted as sink nodes).

[0041] FIG. 4 shows four nodes of an n-node network. Node 3 is a source node because it is highly influential on all nodes, specifically node 2. On the other hand, node 2 is a sink node because it is highly influenced by other nodes, including node 3 in the network, and does not necessarily influence any other node.

[0042] FIG. 5 is a two-dimensional representation of nodes in which a position of each respective node aligned with a vertical axis indicates a ranking of the respective node regarding its node influence-to-network score, and a position of each respective node aligned with a horizontal axis indicates a ranking of the respective node regarding the node influence-by-network score. Thus, a first star in an upper left portion of FIG. 5 indicates a position of an ideal source node, a source node having a high ranking with respect to its influence on other nodes and a low ranking with respect to being influenced by the other nodes, and a second star in a lower right portion FIG. 5 indicates a position of an ideal sink node, a sink node having a high ranking with respect being influenced by other nodes and a low ranking with respect to influencing other nodes. In this example two-dimensional representation, source nodes tend to be positioned in an upper left portion and sink nodes tend to be positioned in a lower right portion of the two-dimensional representation. As shown in FIG. 5, an ideal sink node has a lowest ranking with respect to its influence on other nodes and has a highest ranking with respect to being influenced by other nodes. An ideal source node has a highest ranking with respect to its influence to other nodes and has a lowest ranking with respect to being influenced by other nodes.

[0043] In other embodiments, a position of each respective node aligned with a vertical axis indicates a ranking of the respective node regarding being influenced by other nodes, and a position of each respective node aligned with a horizontal axis indicates a ranking of the respective node regarding its influence on the other nodes.

[0044] FIG. 6 is a flowchart of a process that may be executed by computing device 106 in various embodiments. The process may begin by accessing or obtaining interictal iEEG data recorded by multiple contacts or nodes implanted in a brain of a patient (act 602). For each consecutive equal time window, an LTV DNM may be parameterized from neural state transition vectors derived from the iEEG data for each node during each consecutive equal time window (act 604), thereby forming A matrices (i.e. state transition matrices).

[0045] A node influence-to network score and a node influenced-by-network score may be calculated for each of the nodes in each state transition matrix (act 606). For example, in embodiments in which each column of a state transition matrix, A, has values representing an influence of a respective node in the iEEG network on the remaining nodes, and each row of the A matrix has values representing an amount by which a respective node is influenced by the remaining nodes in the iEEG network, the node influence-to network score of node i can be calculated for each state transition matrix of an N-node network according to .sub.j=1.sup.N A.sub.ji and the node influenced-by network score of node i can be calculated for each state transition matrix according to .sub.j=1.sup.N A.sub.ij.

[0046] Next, a two-dimensional representation of the nodes, as previously discussed with respect to FIG. 5, may be created for the each respective state transition matrix (act 608) and a sink index may be calculated for each of the nodes with respect to the each respective state transition matrix (act 610). The sink index may capture how close a node is to a position of an ideal sink node on the two-dimensional representation of the nodes. The larger the sink index is for a node, the more likely the node is a sink node. In various embodiments, the sink index of node i for the each respective state transition matrix may be calculated according to,

[00006]${\mathrm{sink}}_i=\sqrt{2}-.Math.\left(r_i,c_i\right)-\left(1,\frac{1}{N}\right).Math.$

where sink.sub.i represents the sink index of node i, (r.sub.i, c.sub.i) is a row and column position of node i in the two-dimensional representation, and

[00007]$\left(1,\frac{1}{N}\right)$

is a row and column position of an ideal sink node in the two-dimensional representation of an N-node network. The sink index is equivalent to a Euclidean distance of a position of node i from an ideal sink node in the two-dimensional representation, subtracted from the maximum possible distance from the ideal sink in the two-dimensional representation.

[0047] Similar to the sink index, the source index captures how close a channel is to the ideal source

[00008]$\left(r=\frac{1}{N}\mathrm{and}c=1\right).$

The source index may be calculated as:

[00009]$\begin{array}{cc}{\mathrm{source}}_i=\sqrt{2}-.Math.\left(r_i,{cr}_i\right)-\left(\frac{1}{N},1\right).Math.& \left(1\right)\end{array}$

The larger the source index, the more likely channel i is a source.

[0048] Next, a source influence index may be calculated for each of the nodes for the each respective state transition matrix (act 612). The source influence index captures a sum of an influence of all nodes in a network on a respective node weighted by a source index of each node. The higher a value of the source influence index is for a respective node, the more influence source nodes have on the respective node. For example, the source influence index of node i for a respective state transition matrix may be calculated according to infl.sub.i.sup.w=.sub.j=1.sup.N abs (A.sub.ij)*source.sub.j.sup.w, where source.sub.i is the source influence index of node i.

[0049] A sink connectivity index may be calculated for each of the nodes for the each respective state transition matrix (act 614). The sink connectivity index of node i for a respective state transition matrix of a time window, w, may be calculated according to

conn.sub.i.sup.w=.sub.j=1.sup.N abs(A.sub.ij)*sink.sub.j.sup.w

where conn.sub.i represents the sink connectivity index of node i in time window w and sink.sub.j.sup.w represents the sink index of node j in time window w.

[0050] Scores for each of the nodes may be calculated based on an average value of the each respective node's source influence index, sink connectivity index, and sink index over the state transition matrices (act 616). In some embodiments, a source-sink index score for node i may be calculated as a function (e.g., the product) of node i's average source influence index, average sink connectivity index, and average sink index. Which of the nodes are included in an EZ then may be determined based on the scores of the nodes (act 618). For example, nodes having a score greater than a high score threshold value may be determined to be located in the EZ. In some embodiments, the high score threshold value may be set such that nodes having a score greater than a top predefined percentage may be determined to be located in the EZ. In various embodiments, the high score threshold value may be set to, for example, a top 5%, a top 10%, a percentage value between 5% and 10%, or another percentage.

[0051] Computing device 106 may then provide an indication of which nodes are located in the EZ (act 620). The indication may be presented on a display screen, may be printed in a report, may be announced in a computer generated voice over a speaker, or may be provided in some other manner.

[0052] In various embodiments, a model may be trained to predict a probability of a successful outcome, p.sub.s. FIG. 7 is a flowchart illustrating an example process for training and using such a model to predict a probability of a successful outcome. The process may begin with a computing device such as, for example, computing device 106, receiving labeled and annotated training data related to multiple patients (act 702). The training data may include clinically annotated and/or labeled iEEG data for each of the patients. For each of the patients, nodes may be labeled as being in a seizure onset zone (SOZ), an early propagation zone (EPZ), or as other. Nodes labeled as being in the SOZ demonstrate earliest electrophysiological changes during an ictal (seizure) event and generally precede a clinical onset of seizures. Nodes labeled as being in the EPZ are involved at a time of earliest clinical (semiological) manifestations during an ictal event. A clinically annotated EZ is an anatomical area to be treated (resected or ablated) in order to permanently extinguish epileptiform activity. The clinically annotated EZ is defined as a combination of the SOZ and the EPZ. Successful outcomes are defined as being seizure free or nearly seizure free at more than 12 months post-op.

[0053] A predictive model (e.g., a logistic regression model) may be constructed to estimate a probability of a successful surgical outcome, p.sub.s (act 704). In some embodiments, p.sub.s may be estimated as a function of the sink index and the source influence index as follows based on a training data set for a number of patients:

[00010]$\log \left(\frac{p_s}{1-p_s}\right)={}_0+{}_1\left({\mathrm{sink}}_{EZ}-{\mathrm{sink}}_{nonEZ}\right)+{}_2\left(sr{c}_{EZ}-sr{c}_{nonEZ}\right),$

where p.sub.s is a probability of a successful outcome, .sub.0, .sub.1 and .sub.2 are constants, sink.sub.EZ is an average sink index over all nodes located in the clinically annotated EZ, sink.sub.nonEZ is the average sink index over all nodes located outside of the clinically annotated EZ, src.sub.EZ is an average source influence index over all of the nodes located in the clinically annotated EZ, and src.sub.nonEZ is an average source influence index for all of the nodes located outside of the clinically annotated EZ. The above logistic regression model may be solved by determining a maximum likelihood estimation.

[0054] In some other embodiments, the predictive model (e.g., logistic regression model) may be constructed to estimate a probability of a successful surgical outcome, p.sub.s, as a function of the sink index, the source influence index, and the sink connectivity index as

follows based on a training data set for a number of patients according to: log

[00011]$\log \left(\frac{p_s}{1-p_s}\right)={}_0+{}_1\left({\mathrm{sink}}_{EZ}-{\mathrm{sink}}_{nonEZ}\right)+{}_2\left(sr{c}_{EZ}-sr{c}_{nonEZ}\right)+{}_3\left(con{n}_{EZ}-con{n}_{nonEZ}\right),$

where .sub.3 is
a constant, conn.sub.EZ is an average sink connectivity index for all of the nodes located in the clinically annotated EZ, and conn.sub.nonEZ is an average sink connectivity index for all of the nodes located outside of the clinically annotated EZ.

[0055] After training the model, the probability of success, p.sub.s, may be estimated from iEEG data according to either of the abovementioned logistic regression models, where sink.sub.EZ is an average sink index of all nodes determined to be in the EZ, sink.sub.nonEZ is an average sink index of all of the nodes determined to be outside of the EZ, src.sub.EZ is an average source influence index for all of the nodes determined to be in the EZ, src.sub.nonEZ is an average source influence index for all of the nodes determined to be outside of the EZ, conn.sub.EZ is an average sink connectivity index for all of the nodes determined to be in the EZ, and conn.sub.nonEZ is an average sink connectivity index for all of the nodes determined to be outside of the EZ.

[0056] In some embodiments, a heat map may be generated and presented. The heat map may represent each node as a respective row and each predetermined consecutive time window as a column. A cell at an intersection of a row and a column, corresponds to a particular node (based on the row) at a particular time window (based on the column). As previously mentioned, a score may be calculated for each node in each respective time period. A color may be assigned to each cell based on a particular range of scores which includes a score for a corresponding node and time window. FIG. 8 is a flowchart of an example process that may execute on computing device 106 for generating and presenting a heat map.

[0057] The process of FIG. 8 may begin by processing a first state transition matrix corresponding to a first predefined time window (act 802). A respective score may be calculated for each respective node of the respective time window (act 804). For example, a node influence-to score and an influenced-by score may be calculated for each of the nodes based on a state transition matrix corresponding to the respective time window. Based on the node influence-to network and node influenced-by network scores, a sink index score, a source influence index score, and a sink connectivity index score may be calculated for each respective node. In some embodiments, a source-sink index score may be calculated as a function (e.g., by multiplying) the sink index, the source influence index and the sink connectivity index. A color corresponding to a respective time window score may be assigned to each cell based on a corresponding range of scores in which each score is included (806).

[0058] After all nodes are assigned colors for a time window, a determination may be made regarding whether the last time window was processed (act 808). If the last time window was not processed, then acts 804-808 again may be performed to calculate time window scores in a next time window and assign colors corresponding to the time window scores.

[0059] If, during act 808, the last time window was processed, then a heat map is generated and presented (act 810). The heat map may be presented in any of a number of ways including, but not limited to, presented on a display screen, printed, generated as a file, and sent as an attachment to an email.

[0060] Embodiments may determine whether a patient has epilepsy based on non-invasive monitoring of each node of a brain of the patient during each consecutive predefined time window to produce interictal data. Each of the nodes corresponds to a respective area of the brain being monitored. The noninvasive monitoring may include, but not be limited to, a scalp EEG, functional magnetic resonance imaging (FMRI), a magnetoencephalogram, or other non-invasive methods. A DNM may be parameterized by multiple state transition matrices based on multiple neural state vectors formed from the interictal data generated by the noninvasive monitoring during each consecutive predefined time window. As previously described, the computing device may calculate for each respective state transition matrix, a node influence-to network score for each respective node indicating how influential the respective node is regarding each of the nodes in an interictal network. Based on the each respective state transition matrix, the computing device may calculate a node influenced-by network score for the each respective node indicating an amount by which the respective node is influenced by the nodes of the interictal network during a corresponding time window.

[0061] The computing device may calculate a respective mean score for the each respective node based on the multiple state transition matrices. The respective mean score may be calculated as a function (e.g., by multiplying), based on the multiple state transition matrices, an average source influence index for the respective node, an average sink index for the respective node, and an average sink connectivity index for the respective node to produce the respective scores for the each respective node. The computing device then may normalize all mean scores such that a sum of all mean scores is equal to one. Next, the computing device may count a number of nodes having mean scores greater than

[00012]$\frac{1}{N},$

where N is a total number of nodes. If the count is greater than a predefined percentage (e.g., 30%) of N, then a diagnosis of epilepsy is indicated. A healthy brain is indicated when the count is less than or equal to the predefined percentage of N. The computing device may present an indication of whether the brain is diagnosed as an epileptic brain or a healthy brain. The indication may be displayed on a display screen, printed in a report, sent via an email, or may be provided via another method.

[0062] In the embodiments that generate and display a heat map, a distribution of colors in the heat map may be indicative of whether the brain is a healthy brain or an epileptic brain.

[0063] An average surgical success rate is approximately 50% via standard of care. Prediction based on a probability of a successful surgical outcome, p.sub.s, was accurate at about 734.7% of the time when applied to a dataset of 65 patients (28 successes and 37 failures). Typically, successful outcomes had top source nodes pointing to top sink nodes, and sink nodes had high connectivity. In contrast, failed outcomes had top source nodes pointing to both top sink nodes and other non-sink nodes, and the sink nodes had high connectivity with each other as well as with the other non-sink nodes that the top source nodes influence.

[0064] Various embodiments provided a number of advantages over standard of care methods. The advantages include a much shorter length of time for invasive intracranial monitoring of activity in different areas of a brain, thereby reducing a risk of infection and decreasing a length of a hospital stay. Further, by monitoring brain activity between seizures, more consistent objective results are provided. In addition, more precise and more focal and limited surgical resections are provided by new information from what currently was largely ignored iEEG data. Finally, the various embodiments enable caregivers to better interpret their EEG recordings.

[0065] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms a, an and the are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms comprises, comprising, includes, including, has, have, having, with and the like, when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

[0066] The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiments were chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.

[0067] The descriptions of the various embodiments of the present invention have been presented for purposes of illustration but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or improvement over conventional technologies, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

[0068] Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer-readable storage devices having instructions stored therein for carrying out functions according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. Each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

[0069] Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer-readable storage devices having instructions stored therein for carrying out functions according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. Each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

[0070] Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer-readable storage devices having instructions stored therein for carrying out functions according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. Each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

[0071] The various functions of the computer or other processing systems may be distributed in any manner among any number of software and/or hardware modules or units, processing or computer systems and/or circuitry, where the computer or processing systems may be disposed locally or remotely of each other and communicate via any suitable communications medium (e.g., LAN, WAN, Intranet, Internet, hardwire, modem connection, wireless, etc.). For example, the functions of the present invention embodiments may be distributed in any manner among the various end-user/client and server systems, and/or any other intermediary processing devices. The software and/or algorithms described above and illustrated in the flowcharts may be modified in any manner that accomplishes the functions described herein. In addition, the functions in the flowcharts or description may be performed in any order that accomplishes a desired operation.

[0072] In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.