Certainty based Reduced Sparse Solution for Dense Array EEG Source Localization
Teja Mannepalli, Aurobinda Routray

TL;DR
This paper introduces a two-stage EEG source localization method that reduces the solution space to the most certain sources, improving accuracy in localizing brain activity from dense array EEG data.
Contribution
A novel two-stage approach that identifies the most certain sources and their neighbors, reducing ill-posedness and enhancing localization accuracy in dense array EEG.
Findings
Validated on real 256-channel EEG data
Improved localization accuracy over existing methods
Reduced solution space enhances robustness
Abstract
The EEG source localization is an ill-posed problem. It involves estimation of the sources which outnumbers the number of measurements. For a given measurement at given time all sources are not active which makes the problem as sparse inversion problem. This paper presents a new approach for dense array EEG source localization. This paper aims at reducing the solution space to only most certain sources and thereby reducing the problem of ill-posedness. This employs a two-stage method where the first stage finds the most certain sources that are likely to produce the observed EEG by using a statistical measure of sources, the second stage solves the inverse problem by restricting the solution space to only most certain sources and their neighbors. This reduces the solution space for other source localization methods hence improvise their accuracy in localizing the active neurological…
| E.I | S-I | S-II | |||
| Act | FOCUSS | C-FOCUSS | FOCUSS | C-FOCUSS | |
| 0 | 0 | 0 | 0 | 0 | |
| 0 | 0 | 0 | 0.1 | 0 | |
| 2.6 | 3.7 | 2.6 | 4.0 | 2.6 | |
| E.I | S-I | S-II | S-III | S-IV | S-V | ||||||
| Act | FOCUSS | C-FOCUSS | FOCUSS | C-FOCUSS | FOCUSS | C-FOCUSS | FOCUSS | C-FOCUSS | FOCUSS | C-FOCUSS | |
| 0 | 11.15 | 0 | X | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |
| 0 | 0.6 | 0 | 1 | 0 | 0.3 | 0 | 0.4 | 0 | 0.9 | 0 | |
| 4.4 | 8.6 | 4.4 | - | 4.4 | 5.2 | 4.4 | 6.0 | 4.4 | 73.4 | 4.4 | |
| E.I | TC-I(17 dB) | TC-II(13 dB) | ||||||||||||
| S-I | S-II | S-I | S-II | S-III | S-IV | S-V | ||||||||
| C-sLOR | sLOR | C-sLOR | sLOR | C-sLOR | sLOR | C-sLOR | sLOR | C-sLOR | sLOR | C-sLOR | sLOR | C-sLOR | sLOR | |
| (0) | 0 | 15.77 | 11.15 | 0 | 11.15 | 19.32 | 24.9 | 19.32 | 11.15 | 31.55 | 22.3 | 24.97 | 24.9 | 24.97 |
| (0) | 0.6 | 0.9 | 0.4 | 0.9 | 0.66 | 0.9 | 0.9 | 0.9 | 0.75 | 0.9 | 0.8 | 0.9 | 0.5 | 0.9 |
| 0.6(0.8) | 26.1 | 0.01 | 34.7 | 1.4(4.4) | 50.1 | 6.0 | 48.0 | 2.0 | 32.6 | 2.0 | 55.0 | 5.3 | 39.5 | |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlind Source Separation Techniques · Sparse and Compressive Sensing Techniques · Neural dynamics and brain function
Certainty based reduced sparse solution for dense array EEG source localization
Teja Mannepalli, Aurobinda Routray
Abstract
The EEG source localization is an ill-posed problem. It involves estimation of the sources which outnumbers the number of measurements. For a given measurement at given time all sources are not active which makes the problem as sparse inversion problem. This paper presents a new approach for dense array EEG source localization. This paper aims at reducing the solution space to only most certain sources and thereby reducing the problem of ill-posedness. This employs a two-stage method where the first stage finds the most certain sources that are likely to produce the observed EEG by using a statistical measure of sources, the second stage solves the inverse problem by restricting the solution space to only most certain sources and their neighbors. This reduces the solution space for other source localization methods hence improvise their accuracy in localizing the active neurological sources in the brain. This method has been validated and applied to real 256 channel data and the results were analyzed.
Index Terms:
EEG source localization, electromagnetic brain imaging, inverse problem, sparse signal reconstruction.
I Introduction
The study of active neurological sources in the brain is essential to know about various physiological, cognitive aspects and also brain abnormalities such as focus, seizures, tumors and epilepsy[1] [2]. The estimation of these active sources is termed as source localization. This involves solving the forward problem and also the inverse problem. The forward problem is finding the lead field matrix that represents the behavior of electrical activity in the sources. There are two common ways of solving this, dipole fitting model or distributed source model. In dipole fitting models[3], one or few number of dipoles are assumed to represent the sources, their orientation, location, and magnitudes are found out. This is formulated as a non-linear least squares problem which requires prior estimation of the number of sources. In distributed source model [4] [5], the brain is 3D tessellated into voxels (small cubes) and each voxel is considered as having a source with three dipole moments along x, y and z (or only one dipole moment [6]). The problem reduces to a linear one with only magnitudes of the dipole moment(s) of sources as unknown.
The inverse problem involves finding the sources that are responsible for the generation of EEG. This whole problem can be formulated as a linear, instantaneous model:
[TABLE]
is the measurement vector of size at a time instant, is the number of electrodes, is the lead field matrix of size generated by solving the forward problem, is the number of grids or voxels (each grid is assumed having a source of dipole moment either along x,y and z making it or only perpendicular to cortical sheet, thus [6]), is the unknown current density vector of size (or), is some unknown noise.
The essence of inverse problem is finding the unknown with known and given . One way of solving the inverse problem is:
[TABLE]
is the cost function. This is a minimization problem under the equality constraint. The solution for this is:
[TABLE]
.
The minimum norm estimate (MNE) solves the above by assigning as identity matrix. The weighted minimum norm estimate(WMNE) solves by weighing , is the column of to compensate the deep sources.
Low Resolution impedance Tomography (LORETA) [5] solves by assigning , is discrete spatial laplacian operator. This incorporates the assumption that each source is synchronized with it’s neighboring one.
Focal under-determined system solver (FOCUSS) [7],[8] is a powerful and intelligent method that works on iterative convergence of the solution by itself aiming a sparse one. However, this algorithm is unstable in the presence of noise and may provide a scattered and non-clustered solution missing the gradient in it thus making hard to interpret.
[TABLE]
is weight based on the previously obtained solution of . Eq. (3) can also be presented as an unconstrained minimization problem:
[TABLE]
where is the regularization parameter. is loss function and is regularization term.
standardized low resolution impedance tomography (sLORETA)[9] uses euclidean norm () on both loss function and regularization (zero-order tikhonov-philips regularization). [10]. The exact inverse solution is given by:
[TABLE]
This can explain the measurement vector under the presence of noise with gradient due to norm regularization in it despite producing a non-sparse and blurred solution. The norm works well even when the data is highly correlated but is much sensitive to outliers. On the other hand, the norm [11] is less sensitive to outliers hence can be more robust to noise [12]. The norm also provides a sparse solution which norm cannot. However, norm may not provide a good estimate when the data is highly correlated. Due to all this, the mixed norms ( or ) can be used [13] [14] [15] [16] on regularizing the solution and also on loss function to utilize the advantages provided by both and norms. The and norms can be applied only on matrices, so is considered instead of to extract the block row structure norm can provide[14]. is the time course of EEG. norm sparse solution [17] in uses norm as the constraint to regularize which also provides a sparse solution like norm.
This inverse problem can be formulated in bayesian theorem for probability [18]. The anatomical and physiological constraints can be incorporated into the prior distribution of the source. This finds the probability of the sources being active rather than finding the active ones.
The EEG data can be considered a stationary signal for some of time depending on the kind of experiment being conducted [1]. dMAP-EM [19], STOUT [20], [21] (particle filter), [22] (kalman filter) take advantage of this temporal coherence in the EEG channels to solve the problem. In [23], a structured sparsity prior[24] is used to incorporate the sparse nature of every source. In [25] an norm is used to regularize the solution space and bernouli-laplacian prior is employed to incorporate sparse nature of the sources. In [26], the source space’s resolution is iterative updated using the regularized solution calculated in every iteration for that space. In [27] a hierarchal modeling in the brain is employed. The EEG data can be considered as a tensor (an dimensional array) by considering channels, time and frequency as three dimensions.[28] [29].
The ill-posedness () of this problem is making it difficult to find the active sources accurately as many number of solutions will be possible. The brain is tessellated as a voxels using a 3D grid. Each voxel is modeled by a source with dipole moment of some magnitude and orientation. A fixed location is modeled as a source either with three dipoles moments along x,y and z or only one dipole with moment along z that is perpendicular to the cortical surface instead of three[6] thereby reducing the number of unknowns. Also, as the system is under determined, the solution space has to be constrained based on anatomical and physiological aspects of the brain [6] [10]. More review on EEG source localization algorithms is presented in [30], [18], [31].
The method presented here utilizes sparse nature of the active sources which makes each of the source’s signature in evident and aims at reducing the solution space only those most certain sources that might be active.
II Methodology
The potential distribution of any source has only one prominent global maximum or minimum three-dimensionally (referred to as ’peak’) on the scalp. As the sources which might be active will be few, every peak of the active sources will be prominently evident in . This can be observed from Fig.1. Two sources located at [-35.4 53.8 31.6] mm (this source’s distribution is peaked at electrode) and [-57.7 -1.9 31.6] mm (peaked at electrode) are excited separately, This is shown in 1(a) and 1(b). The simultaneous activation of both the sources is shown in Fig. 1(c) where the source distributions are distinctly evident and peaked at both and electrode. Form the information of this peaks and in , the sources which has these and as their peaks and has the same/similar distributions as that in might be the most certain sources that are active.
The method presented here utilizes the information provided by peaks in to find the most certain sources that have generated the peaks observed in . This method has a preliminary stage that has to be done only at the beginning, stage-I reduces the solution space to most certain sources and stage-II solves the inverse problem by restricting the solution space to those most certain sources.
Stage-0:This is the preliminary stage. This starts with finding the nearest neighbors(neighboring regions) of every electrode. The neighboring ones of electrode located at are , where . The nearest neighbors are found out by setting such that every electrode has one level of surrounding electrodes. As the electrodes lie on spherical surface, geodesic distance between neighboring ones is calculated.
The peak index for all sources are found out. The electrode is called a ’peak index’ if it has the maximum(or minimum) power in its neighboring region. A source will have only one peak index. It can be either global maximum or minimum. Every source will have an electrode as it’s peak. A source will have only one peak, but can have many peaks as many sources might be active.
Stage-I: The peak indexes in are found out. If an electrode is a peak in , the sources with peak index at the same electrode can be possible sources which might be active. The certainties of these possible sources are found by comparing the hat (The peak index’s electrode and its neighboring electrodes are collectively termed as hat) of and using a statistical index (this measures the similarity between them). This index is defined as:
[TABLE]
for , is the number of neighbors for an electrode lying in its neighboring region. scale factor, at , the peak index electrode. This also can be reformulated using an norm to make the index more robust to noise.
[TABLE]
The primary possible sources are the above ones with more certainty values and all possible sources with less certainties will be removed.
Under activation of many sources, each source’s distribution may be interfered with other, hence the neighbors of above determined most certain sources are also be considered as most certain sources. The secondary possible sources are neighbors (with one inter-point grid distance or two) of these more certain primary possible sources. The secondary possible sources are assigned the same values as their primary possible sources. If a source lies both in primary and secondary possible sources, the maximum value of certainty among them will be assigned to it. Only these primary and secondary possible sources are used in stage-II.
Stage-II: The solution space is reduced. The cost function minimized is:
[TABLE]
where of size is the lead field matrix restricts the solution space to only the more certain sources () found in stage-I. The initial estimate to the above problem is which contains certainties of the prior sources. To solve the above cost function any source localization algorithm like FOCUSS, sLORETA etc can be used.
III Simulations and validation
III-A Simulated data tests
The head model is generated by three-concentric spherical head model[32]. The head model contains three layers brain, skull and scalp. Their radii are 80, 85 and 92 mm and their conductivities are 0.33, 0.0042, and 0.33 . The electrodes are aligned to CTF coordinate system. The number of EEG channels are 256. The channel locations are based on 10-10 equivalent system for hydrocel geodesic sensor nets. The grid assumed is a regular 3D grid of inter grid-point distance of 11.2 mm. The total number of grid points are 1535 (). The size of is (). The lead field matrix is generated by three concentric spherical model. FOCUSS and sLORETA are implemented using [7] and [9] where is found using cross validation error method. The initial estimate of FOCUSS is all the sources. This is because if FOCUSS is initialized with an incomplete solution which missed out a source, It is very unlikely to retrieve that source. The maximum number of iterations for FOCUSS is 100 and the iteration is stopped when the difference between successive errors . In Stage II, in absence of noise FOCUSS is used, while in presence of noise sLORETA is used.
The evaluation indexes [17] used here are localization error (), source energy error () and notional blurring index ().
The , and are chosen to evaluate the localization error, with what power is the source localized with and how much blurred the solution is. In all the figures, the pink dots shows the active/predicted sources with some moment and all sources i,e the solution space (or also can be predicted ones as inactive sources with zero moment) are shown in white dots. The active sources taken are shown as pink dots in pink circles (two in Fig. 2 and five Fig. 3). refer to evaluation indexes in table I, II and III. The ideal evaluation indexes that have to be achieved are mentioned in the second column for tables I and II whereas for table III, the same are mentioned under the first column in braces.
In all the test cases presented, ideal value that has to be reached by is [math] implying that any method with this has localized the source with zero error. The ideal value by is [math] implying that all energy with which the source is simulated is completely retrieved by that method. The ideal value to be achieved by is mentioned in the tables accordingly. An ideal value of implies that the source is localized finely without any blurring.
Test Case-I: 6 active grid points are considered in 2 groups(focally extended sources). The group of three are near to each other with one grid-point distance. The source moments for all the sources are (1.1,1.2,1.3) along x,y and z directions. The sources chosen are from left surface top with coordinates [53.87 -24.22 31.56], [53.87-24.22 42.71] and [53.8671 -23.06 31.56] (labeled as S-I in table I and III) and right surface bottom with coordinates [-13.06 65.02 31.56], [-13.06 65.02 42.71] and [-13.06 53.86 42.71](labeled as S-II). The evaluation indexes mentioned in Table I and III are the best ones of all the three in each group. All distances mentioned in [] are in mm.
In Stage-I, Eq.8 is used to find the . The solution space is reduced to 201 certain sources out of 4605 among which the active source(s) may lie (The pink ones in Fig. 2). The lead field matrix of size is reduced to . These 201 sources are used in stage-II.
The same test case is added with 17 dB SNR of random white noise. In Stage-I, for Eq. 9 is used utilizing the robustness of norm to noise. The solution space is reduced to 429 most certain sources out of which some might be active out of 4605 in total. The lead field matrix of size is reduced to . The 429 sources are only used in stage-II.
The evaluation indexes (Fig. 2, Table. III and Table I) show an improvement in accuracy of localizing the active sources for FOCUSS and sLORETA due to reduction of solution space (to most certain sources).
Test Case-II: 5 active isolated grid points(3 deep and 2 surface) are considered. The sources are of more depth. Each source is excited with equal magnitude(5,5,5). The sources chosen are right surface top [53.86, -24.23, 31.56], right center deep [-1.9, -46.53,-1.9], left bottom deep [-35.37 20.40 -57.68], left surface top [-35.37 53.86 31.55], and center deep bottom [-1.91 -1.91 -57.68]. All the sources in Tables I and III are mentioned in the order given above as S-I, S-II, S-III, S-IV and S-V. FOCUSS missed out localizing S-II source, hence ’X’ is mentioned in S-II column for FOCUSS in table II. All distances mentioned in [] are in mm.
In Stage-I, for , Eq.8 is used. The solution space is reduced to 783 out of 4605 after the estimation of possibly certain sources using similarity index after Stage-I. This means there are only 783 most certain sources who might be active. The lead field matrix of size is reduced to . The 783 sources are only used in stage-II.
The same test case is added with 13 dB SNR of random white noise. In Stage-I, for Eq. 9 is used using norm. The solution space is reduced to 1659 out of 4605 after the estimation of possibly certain sources using similarity index after Stage-I. This means there are only 1659 most certain sources who might be active. The lead field matrix of size is reduced to . The 1659 sources are only used in stage-II.
The evaluation indexes for this test case are given in Table II (without noise added) and Table III (with noise added) that shows an improvement in localization of the active sources for FOCUSS and sLORETA.
III-B Real data tests
The real data is obtained using 256 channel EGI hydrocel geodesic sensor nets EEG setup. There are total of 10 persons(subjects). Each person is made to play a cognitive game - Matching and EEG is recorded simultaneously.
The ICA is performed using fieldtrip toolbox[33]. The EOG artifacts are removed by finding the ratio between power distributed on EEG channels prominently near to the eyes or prominent EOG artifact channels to EEG channels that are not selected as prominent EOG artifact channels using component to channel weight matrix generated by ICA.
for all the components is calculated. It is defined as:
[TABLE]
where and . are the EEG electrodes prominently near to the eyes. is power distribution ratio that gives the ratio of how much power is distributed at the probable EOG artifact electrodes to non-EOG electrodes for each component. is the component to channel weight matrix generated by ICA. and are the power distributed at EOG and non-EOG channels. If , implies more power of the component in EOG electrodes making this a dominant EOG artifact. ECG artifacts are removed by observing the time course of the components. After this, ICA is projected back, filtered using a band pass filter of 4-30 Hz and followed by both temporal and spatial filtering.
The spatial filtering is done using the neighboring channels generated in stage-0.
[TABLE]
where is the number of neighbors of channel and is the measurement vector after spatial filtering. Temporal filtering is applying moving average filter along the time axis.
The cortical activity predicted for person are presented in Fig. 4. The prior (in Fig. 4(a)) corresponding to the cognitive game(matching) shows profound activity in the frontal lobe which is associated with logical thinking of a person[2]. These observations are also confirmed by sLORETA in Fig. 4(c). The number of certain sources predicted by the prior is 662 out of 4605.
IV Conclusions
As the results show, two goals of this method are achieved. Firstly, reduction of solution space to most certain sources that might be active and hence eliminating the redundancy while solving the problem. Secondly, localization accuracy of other methods is improved thereby achieving the main goal of identifying the active sources in the brain accurately.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Sanei and J. A. Chambers, EEG signal processing . John Wiley & Sons, 2013.
- 2[2] J. Nolte, “The human brain: an introduction to its functional anatomy,” 2002.
- 3[3] S. Sommariva and A. Sorrentino, “Sequential monte carlo samplers for semi-linear inverse problems and application to magnetoencephalography,” Inverse Problems , vol. 30, no. 11, p. 114020, 2014.
- 4[4] C. M. Michel, M. M. Murray, G. Lantz, S. Gonzalez, L. Spinelli, and R. G. de Peralta, “Eeg source imaging,” Clinical neurophysiology , vol. 115, no. 10, pp. 2195–2222, 2004.
- 5[5] R. D. Pascual-Marqui, C. M. Michel, and D. Lehmann, “Low resolution electromagnetic tomography: a new method for localizing electrical activity in the brain,” International Journal of psychophysiology , vol. 18, no. 1, pp. 49–65, 1994.
- 6[6] C. Phillips, M. D. Rugg, and K. J. Friston, “Anatomically informed basis functions for eeg source localization: combining functional and anatomical constraints,” Neuro Image , vol. 16, no. 3, pp. 678–695, 2002.
- 7[7] I. F. Gorodnitsky and B. D. Rao, “Sparse signal reconstruction from limited data using focuss: A re-weighted minimum norm algorithm,” IEEE Transactions on signal processing , vol. 45, no. 3, pp. 600–616, 1997.
- 8[8] I. F. Gorodnitsky, J. S. George, and B. D. Rao, “Neuromagnetic source imaging with focuss: a recursive weighted minimum norm algorithm,” Electroencephalography and clinical Neurophysiology , vol. 95, no. 4, pp. 231–251, 1995.
