Eurographics/ Ieee-vgtc Symposium on Visualization (2007) Functional Unit Maps for Data-driven Visualization of High-density Eeg Coherence

Synchronous electrical activity in different brain regions is generally assumed to imply functional relationships between these regions. A measure for this synchrony is electroencephalography (EEG) coherence, computed between pairs of signals as a function of frequency. Existing high-density EEG coherence visualizations are generally either hypothesis-driven, or data-driven graph visualizations which are cluttered. In this paper, a new method is presented for data-driven visualization of high-density EEG coherence, which strongly reduces clutter and is referred to as functional unit (FU) map. Starting from an initial graph, with vertices representing electrodes and edges representing significant coherences between electrode signals, we define an FU as a set of electrodes represented by a clique consisting of spatially connected vertices. In an FU map, the spatial relationship between electrodes is preserved, and all electrodes in one FU are assigned an identical gray value. Adjacent FUs are visualized with different gray values and FUs are connected by a line if the average coherence between FUs exceeds a threshold. Results obtained with our visualization are in accordance with known electrophysiological findings. FU maps can be used as a preprocessing step for conventional analysis.

[1]  Terrence J. Sejnowski,et al.  From single-trial EEG to brain area dynamics , 2002, Neurocomputing.

[2]  A M Amjad,et al.  A framework for the analysis of mixed time series/point process data--theory and application to the study of physiological tremor, single motor unit discharges and electromyograms. , 1995, Progress in biophysics and molecular biology.

[3]  Mark Harman,et al.  5 th IEEE International Workshop on Program Comprehension (IWPC'97) , 1997 .

[4]  Natasha M. Maurits,et al.  Tiled Parallel Coordinates for the Visualization of Time-Varying Multichannel EEG Data , 2005, EuroVis.

[5]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[6]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[7]  M. Sheelagh T. Carpendale,et al.  Edgelens: an interactive method for managing edge congestion in graphs , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

[8]  J Holsheimer,et al.  Volume conduction and EEG measurements within the brain: a quantitative approach to the influence of electrical spread on the linear relationship of activity measured at different locations. , 1977, Electroencephalography and clinical neurophysiology.

[9]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[10]  Guy Melançon,et al.  Software components capture using graph clustering , 2003, 11th IEEE International Workshop on Program Comprehension, 2003..

[11]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[12]  J. Polich,et al.  P3a and P3b from typical auditory and visual stimuli , 1999, Clinical Neurophysiology.

[13]  Ritske de Jong,et al.  Pre-stimulus EEG effects related to response speed, task switching and upcoming response hand , 2006, Biological Psychology.

[14]  Henry D. Shapiro,et al.  Heuristics for rapidly four-coloring large planar graphs , 1991, Algorithmica.

[15]  Natasha M. Maurits,et al.  Design and Evaluation of Tiled Parallel Coordinate Visualization of Multichannel EEG Data , 2007, IEEE Transactions on Visualization and Computer Graphics.

[16]  Ivan Herman,et al.  Density functions for visual attributes and effective partitioning in graph visualization , 2000, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings.

[17]  M. Kaminski,et al.  Topographic analysis of coherence and propagation of EEG activity during sleep and wakefulness. , 1997, Electroencephalography and clinical neurophysiology.

[18]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[19]  F. Varela,et al.  Measuring phase synchrony in brain signals , 1999, Human brain mapping.

[20]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[21]  N M Maurits,et al.  P300 Component Identification Using Source Analysis Techniques: Reduced Latency Variability , 2003, Journal of clinical neurophysiology : official publication of the American Electroencephalographic Society.

[22]  R. Scheeringa,et al.  EEG Coherence Obtained From an Auditory Oddball Task Increases With Age , 2006, Journal of clinical neurophysiology : official publication of the American Electroencephalographic Society.

[23]  P. Seymour,et al.  A new proof of the four-colour theorem , 1996 .

[24]  Christopher G. Healey,et al.  Choosing effective colours for data visualization , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[25]  D. Tucker,et al.  EEG coherency. I: Statistics, reference electrode, volume conduction, Laplacians, cortical imaging, and interpretation at multiple scales. , 1997, Electroencephalography and clinical neurophysiology.

[26]  R. Srinivasan.  Methods to Improve the Spatial Resolution of EEG , 1999 .

[27]  H Petsche,et al.  Synchronization between temporal and parietal cortex during multimodal object processing in man. , 1999, Cerebral cortex.

[28]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.