PubMed Health⌕ Search

Biomedical subjects

J J Ermer

Publications and source records attributed to J J Ermer.

2 recordsLinked to original sources

Rapidly recomputable EEG forward models for realistic head shapes.

With the increasing availability of surface extraction techniques for magnetic resonance and x-ray computed tomography images, realistic head models can be readily generated as forward models in the analysis of electroencephalography (EEG) and magnetoencephalography (MEG) data. Inverse analysis of this data, however, requires that the forward model be computationally efficient. We propose two methods for approximating the EEG forward model using realistic head shapes. The 'sensor-fitted sphere' approach fits a multilayer sphere individually to each sensor, and the 'three-dimensional interpolation' scheme interpolates using a grid on which a numerical boundary element method (BEM) solution has been precomputed. We have characterized the performance of each method in terms of magnitude and subspace error metrics, as well as computational and memory requirements. We have also made direct performance comparisons with traditional spherical models. The approximation provided by the interpolative scheme had an accuracy nearly identical to full BEM, even within 3 mm of the inner skull surface. Forward model computation during inverse procedures was approximately 30 times faster than for a traditional three-shell spherical model. Cast in this framework, high-fidelity numerical solutions currently viewed as computationally prohibitive for solving the inverse problem (e.g. linear Galerkin BEM) can be rapidly recomputed in a highly efficient manner. The sensor-fitting method has a similar one-time cost to the BEM method, and while it produces some improvement over a standard three-shell sphere, its performance does not approach that of the interpolation method. In both methods, there is a one-time cost associated with precomputing the forward solution over a set of grid points.

Algorithms↗

Paired MEG data set source localization using recursively applied and projected (RAP) MUSIC.

An important class of experiments in functional brain mapping involves collecting pairs of data corresponding to separate "Task" and "Control" conditions. The data are then analyzed to determine what activity occurs during the Task experiment but not in the Control. Here we describe a new method for processing paired magnetoencephalographic (MEG) data sets using our recursively applied and projected multiple signal classification (RAP-MUSIC) algorithm. In this method the signal subspace of the Task data is projected against the orthogonal complement of the Control data signal subspace to obtain a subspace which describes spatial activity unique to the Task. A RAP-MUSIC localization search is then performed on this projected data to localize the sources which are active in the Task but not in the Control data. In addition to dipolar sources, effective blocking of more complex sources, e.g., multiple synchronously activated dipoles or synchronously activated distributed source activity, is possible since these topographies are well-described by the Control data signal subspace. Unlike previously published methods, the proposed method is shown to be effective in situations where the time series associated with Control and Task activity possess significant cross correlation. The method also allows for straightforward determination of the estimated time series of the localized target sources. A multiepoch MEG simulation and a phantom experiment are presented to demonstrate the ability of this method to successfully identify sources and their time series in the Task data.

Algorithms↗