Abstract:The aim of this work is to characterize quantitatively the performance of a body of techniques in the frequency domain for the estimation of cortical connectivity from high-resolution EEG recordings in different operative conditions commonly encountered in practice. Connectivity pattern estimators investigated are the Directed Transfer Function (DTF), its modification known as direct DTF (dDTF) and the Partial Directed Coherence (PDC). Predefined patterns of cortical connectivity were simulated and then retrieved by the application of the DTF, dDTF, and PDC methods. Signal-to-noise ratio (SNR) and length (LENGTH) of EEG epochs were studied as factors affecting the reconstruction of the imposed connectivity patterns. Reconstruction quality and error rate in estimated connectivity patterns were evaluated by means of some indexes of quality for the reconstructed connectivity pattern. The error functions were statistically analyzed with analysis of variance (ANOVA). The whole methodology was then applied to high-resolution EEG data recorded during the well-known Stroop paradigm. Simulations indicated that all three methods correctly estimated the simulated connectivity patterns under reasonable conditions. However, performance of the methods differed somewhat as a function of SNR and LENGTH factors. The methods were generally equivalent when applied to the Stroop data. In general, the amount of available EEG affected the accuracy of connectivity pattern estimations. Analysis of 27 s of nonconsecutive recordings with an SNR of 3 or more ensured that the connectivity pattern could be accurately recovered with an error below 7% for the PDC and 5% for the DTF. In conclusion, functional connectivity patterns of cortical activity can be effectively estimated under general conditions met in most EEG recordings by combining high-resolution EEG techniques, linear inverse estimation of the cortical activity, and frequency domain multivariate methods such as PDC, DTF, and dDTF. Hum Brain Mapp 28:143-157, 2007.
The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective, communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunc- tions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires the know-how of all the methodological steps of the pipeline that manipulate the input brain signals and extract the functional network prop- erties. On the other hand, knowledge of the neural phenomenon under study is required to perform physiologically relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.