3,630 research outputs found
Information flow between resting state networks
The resting brain dynamics self-organizes into a finite number of correlated
patterns known as resting state networks (RSNs). It is well known that
techniques like independent component analysis can separate the brain activity
at rest to provide such RSNs, but the specific pattern of interaction between
RSNs is not yet fully understood. To this aim, we propose here a novel method
to compute the information flow (IF) between different RSNs from resting state
magnetic resonance imaging. After haemodynamic response function blind
deconvolution of all voxel signals, and under the hypothesis that RSNs define
regions of interest, our method first uses principal component analysis to
reduce dimensionality in each RSN to next compute IF (estimated here in terms
of Transfer Entropy) between the different RSNs by systematically increasing k
(the number of principal components used in the calculation). When k = 1, this
method is equivalent to computing IF using the average of all voxel activities
in each RSN. For k greater than one our method calculates the k-multivariate IF
between the different RSNs. We find that the average IF among RSNs is
dimension-dependent, increasing from k =1 (i.e., the average voxels activity)
up to a maximum occurring at k =5 to finally decay to zero for k greater than
10. This suggests that a small number of components (close to 5) is sufficient
to describe the IF pattern between RSNs. Our method - addressing differences in
IF between RSNs for any generic data - can be used for group comparison in
health or disease. To illustrate this, we have calculated the interRSNs IF in a
dataset of Alzheimer's Disease (AD) to find that the most significant
differences between AD and controls occurred for k =2, in addition to AD
showing increased IF w.r.t. controls.Comment: 47 pages, 5 figures, 4 tables, 3 supplementary figures. Accepted for
publication in Brain Connectivity in its current for
A blind deconvolution approach to recover effective connectivity brain networks from resting state fMRI data
A great improvement to the insight on brain function that we can get from
fMRI data can come from effective connectivity analysis, in which the flow of
information between even remote brain regions is inferred by the parameters of
a predictive dynamical model. As opposed to biologically inspired models, some
techniques as Granger causality (GC) are purely data-driven and rely on
statistical prediction and temporal precedence. While powerful and widely
applicable, this approach could suffer from two main limitations when applied
to BOLD fMRI data: confounding effect of hemodynamic response function (HRF)
and conditioning to a large number of variables in presence of short time
series. For task-related fMRI, neural population dynamics can be captured by
modeling signal dynamics with explicit exogenous inputs; for resting-state fMRI
on the other hand, the absence of explicit inputs makes this task more
difficult, unless relying on some specific prior physiological hypothesis. In
order to overcome these issues and to allow a more general approach, here we
present a simple and novel blind-deconvolution technique for BOLD-fMRI signal.
Coming to the second limitation, a fully multivariate conditioning with short
and noisy data leads to computational problems due to overfitting. Furthermore,
conceptual issues arise in presence of redundancy. We thus apply partial
conditioning to a limited subset of variables in the framework of information
theory, as recently proposed. Mixing these two improvements we compare the
differences between BOLD and deconvolved BOLD level effective networks and draw
some conclusions
Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization
We study the question of reconstructing two signals and from their
convolution . This problem, known as {\em blind deconvolution},
pervades many areas of science and technology, including astronomy, medical
imaging, optics, and wireless communications. A key challenge of this intricate
non-convex optimization problem is that it might exhibit many local minima. We
present an efficient numerical algorithm that is guaranteed to recover the
exact solution, when the number of measurements is (up to log-factors) slightly
larger than the information-theoretical minimum, and under reasonable
conditions on and . The proposed regularized gradient descent algorithm
converges at a geometric rate and is provably robust in the presence of noise.
To the best of our knowledge, our algorithm is the first blind deconvolution
algorithm that is numerically efficient, robust against noise, and comes with
rigorous recovery guarantees under certain subspace conditions. Moreover,
numerical experiments do not only provide empirical verification of our theory,
but they also demonstrate that our method yields excellent performance even in
situations beyond our theoretical framework
Blind deconvolution of sparse pulse sequences under a minimum distance constraint: a partially collapsed Gibbs sampler method
For blind deconvolution of an unknown sparse sequence convolved with an unknown pulse, a powerful Bayesian method employs the Gibbs sampler in combination with a BernoulliâGaussian prior modeling sparsity. In this paper, we extend this method by introducing a minimum distance constraint for the pulses in the sequence. This is physically relevant in applications including layer detection, medical imaging, seismology, and multipath parameter estimation. We propose a Bayesian method for blind deconvolution that is based on a modified BernoulliâGaussian prior including a minimum distance constraint factor. The core of our method is a partially collapsed Gibbs sampler (PCGS) that tolerates and even exploits the strong local dependencies introduced by the minimum distance constraint. Simulation results demonstrate significant performance gains compared to a recently proposed PCGS. The main advantages of the minimum distance constraint are a substantial reduction of computational complexity and of the number of spurious components in the deconvolution result
Recent Progress in Image Deblurring
This paper comprehensively reviews the recent development of image
deblurring, including non-blind/blind, spatially invariant/variant deblurring
techniques. Indeed, these techniques share the same objective of inferring a
latent sharp image from one or several corresponding blurry images, while the
blind deblurring techniques are also required to derive an accurate blur
kernel. Considering the critical role of image restoration in modern imaging
systems to provide high-quality images under complex environments such as
motion, undesirable lighting conditions, and imperfect system components, image
deblurring has attracted growing attention in recent years. From the viewpoint
of how to handle the ill-posedness which is a crucial issue in deblurring
tasks, existing methods can be grouped into five categories: Bayesian inference
framework, variational methods, sparse representation-based methods,
homography-based modeling, and region-based methods. In spite of achieving a
certain level of development, image deblurring, especially the blind case, is
limited in its success by complex application conditions which make the blur
kernel hard to obtain and be spatially variant. We provide a holistic
understanding and deep insight into image deblurring in this review. An
analysis of the empirical evidence for representative methods, practical
issues, as well as a discussion of promising future directions are also
presented.Comment: 53 pages, 17 figure
- âŠ