Search

Contemporary neuroscience has embraced network science and dynamical systems to study the complex and self-organized structure of the human brain. Despite the developments in non-invasive neuroimaging techniques, a full understanding of the directed interactions in whole brain networks, referred to as effective connectivity , as well as their role in the emergent brain dynamics is still lacking. The main reason is that estimating brain connectivity requires solving a formidable large-scale inverse problem from indirect and noisy measurements. Building on the dynamic causal modelling framework, the present study offers a novel method for estimating whole-brain effective connectivity from resting-state functional magnetic resonance data. To this purpose sparse estimation methods are adapted to infer the parameters of our novel model, which is based on a linearized, region-specific haemodynamic response function. The resulting algorithm, referred to as sparse DCM , is shown to compare favorably with state-of-the art methods when tested on both synthetic and real data. We also provide a graph-theoretical analysis on the whole-brain effective connectivity estimated using data from a cohort of healthy individuals, which reveals properties such as asymmetry in the connectivity structure as well as the different roles of brain areas in favoring segregation or integration. [ABSTRACT FROM AUTHOR]

The paper reports a machine learning approach for estimating the phase in a distributed acoustic sensor implemented using optical frequency domain reflectometry, with enhanced robustness at the fading points. A neural network configuration was trained using a simulated set of optical signals that were modeled after the Rayleigh scattering pattern of a perturbed fiber. Firstly, the performance of the network was verified using another set of numerically generated scattering profiles to compare the achieved accuracy levels with the standard homodyne detection method. Then, the proposed method was tested on real experimental measurements, which indicated a detection improvement of at least 5.1 dB with respect to the standard approach.

We address the problem of performing decision tasks, and in particular classification and recognition, in the space of dynamical models in order to compare time series of data. Motivated by the application of recognition of human motion in image sequences, we consider a class of models that include linear dynamics, both stable and marginally stable (periodic), both minimum and non-minimum phase, driven by non-Gaussian processes. This requires extending existing learning and system identification algorithms to handle periodic modes and nonminimum phase behavior, while taking into account higher-order statistics of the data. Once a model is identified, we define a kernel-based cord distance between models that includes their dynamics, their initial conditions as well as input distribution. This is made possible by a novel kernel defined between two arbitrary (non-Gaussian) distributions, which is computed by efficiently solving an optimal transport problem. We validate our choice of models, inference algorithm, and distance on the tasks of human motion synthesis (sample paths of the learned models), and recognition (nearest-neighbor classification in the computed distance). However, our work can be applied more broadly where one needs to compare historical data while taking into account periodic trends, non-minimum phase behavior, and non-Gaussian input distributions.