Graph Averaging as a Means to Compare Multichannel EEG Coherence Networks

A method is proposed for quantifying differences between multichannel EEG coherence networks represented by functional unit (FU) maps. The approach is based on inexact graph matching for attributed relational graphs and graph averaging, adapted to FU maps. The mean of a set of input FU maps is defined in such a way that it not only represents the mean group coherence during a certain task or condition but also to some extent displays individual variations in brain activity. The definition of a mean FU map relies on a graph dissimilarity measure which takes into account both node positions and node or edge attributes. A visualization of the mean FU map is used with a visual representation of the frequency of occurrence of nodes and edges in the input FUs. This makes it possible to investigate which brain regions are more commonly involved in a certain task, by analysing the occurrence of an FU of the mean graph in the input FUs. Furthermore, our method gives the possibility to quantitatively compare individual FU maps by computing their distance to the mean FU map.

[1]  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.

[2]  A. Kraskov,et al.  On the predictability of epileptic seizures , 2005, Clinical Neurophysiology.

[3]  Jonathan D. Power,et al.  Functional Brain Networks Develop from a “Local to Distributed” Organization , 2009, PLoS Comput. Biol..

[4]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[5]  Stephan Diehl,et al.  Graphs, They Are Changing , 2002, GD.

[6]  Erkki Oja,et al.  Improved Simulated Annealing, Boltzmann Machine, and Attributed Graph Matching , 1990, EURASIP Workshop.

[7]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[8]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[9]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Natasha M. Maurits,et al.  Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units , 2008, IEEE Transactions on Visualization and Computer Graphics.

[11]  Yong Liu,et al.  Altered Anatomical Network in Early Blindness Revealed by Diffusion Tensor Tractography , 2009, PloS one.

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

[13]  Henrik I. Christensen,et al.  Pattern Recognition in Practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems , 1994 .

[14]  G. Levi.  A note on the derivation of maximal common subgraphs of two directed or undirected graphs , 1973 .

[15]  Abraham Kandel,et al.  Mean and maximum common subgraph of two graphs , 2000, Pattern Recognit. Lett..

[16]  Kuo-Chin Fan,et al.  Genetic-based search for error-correcting graph isomorphism , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[17]  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).

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

[19]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[20]  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.

[21]  H. Petsche,et al.  Synchronization between prefrontal and posterior association cortex during human working memory. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

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

[24]  Karl J. Friston.  Functional and effective connectivity in neuroimaging: A synthesis , 1994 .

[25]  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.

[26]  Kaizhong Zhang,et al.  The approximate graph matching problem , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

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

[28]  Cornelis J Stam,et al.  Graph theoretical analysis of complex networks in the brain , 2007, Nonlinear biomedical physics.

[29]  Salih O. Duffuaa,et al.  A Linear Programming Approach for the Weighted Graph Matching Problem , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[30]  Edwin R. Hancock,et al.  Genetic Search for Structural Matching , 1996, ECCV.

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

[32]  Olaf Sporns,et al.  Complex network measures of brain connectivity: Uses and interpretations , 2010, NeuroImage.