The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2018
DOI: 10.3390/e20050311
|View full text |Cite
|
Sign up to set email alerts
|

Network Entropy for the Sequence Analysis of Functional Connectivity Graphs of the Brain

Abstract: Dynamic representation of functional brain networks involved in the sequence analysis of functional connectivity graphs of the brain (FCGB) gains advances in uncovering evolved interaction mechanisms. However, most of the networks, even the event-related ones, are highly heterogeneous due to spurious interactions, which bring challenges to revealing the change patterns of interactive information in the complex dynamic process. In this paper, we propose a network entropy (NE) method to measure connectivity unce… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(22 citation statements)
references
References 56 publications
0
22
0
Order By: Relevance
“…Referring to [ 37 ], the raw EEG data were filtered by wavelet decomposition with 9 levels; after that, wavelet coefficients (7.8–15.6 Hz) at fifth level were used to reconstruct alpha waves. Moreover, the wavelet-based threshold technique in [ 26 ] was used to correct the filtered signals.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Referring to [ 37 ], the raw EEG data were filtered by wavelet decomposition with 9 levels; after that, wavelet coefficients (7.8–15.6 Hz) at fifth level were used to reconstruct alpha waves. Moreover, the wavelet-based threshold technique in [ 26 ] was used to correct the filtered signals.…”
Section: Methodsmentioning
confidence: 99%
“…Artificial interactions directly caused by signal mixing neglecting real interactions between neuronal groups at the considered locations can be reduced by a number of binarized connectivity matrices that typically aim to remove linear coupling terms [ 25 ]. Spurious interactions (referred to as ghost interactions) arising from the leakage of signals from a true link of sources to the surrounding links are more difficult to be processed, because of multivariate mixing effects [ 26 , 27 ]. Up to now, steps towards addressing the problem have been taken for suppressing spurious interactions, such as oscillation-based and phase-based estimates [ 28 , 29 ].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The adjacent matrix is obtained by computing the magnitude squared coherence between signals from two different channels [20,21]. The magnitude squared coherence C xy is a function of the power spectral densities P xx (f) and P yy (f) of x and y [7,22], and the cross power spectral density P xy (f) of x and y,…”
Section: Scaling Analysis By Brain Network For Driving Tasksmentioning
confidence: 99%
“…Therefore, by using Equation 5, the adjacent matrix can be computed, as shown in Figure 3. The brain networks under different states have different structural information as the connectivity between different pairs of nodes [22]. In order to give a flavour about the distribution of spatial patterns, Figure 3 provides the weighted functional brain network, in which the spatial topographic distribution obtained a noticeable difference to driver's different states.…”
Section: Scaling Analysis By Brain Network For Driving Tasksmentioning
confidence: 99%