93,374 research outputs found
Fiber Orientation Estimation Guided by a Deep Network
Diffusion magnetic resonance imaging (dMRI) is currently the only tool for
noninvasively imaging the brain's white matter tracts. The fiber orientation
(FO) is a key feature computed from dMRI for fiber tract reconstruction.
Because the number of FOs in a voxel is usually small, dictionary-based sparse
reconstruction has been used to estimate FOs with a relatively small number of
diffusion gradients. However, accurate FO estimation in regions with complex FO
configurations in the presence of noise can still be challenging. In this work
we explore the use of a deep network for FO estimation in a dictionary-based
framework and propose an algorithm named Fiber Orientation Reconstruction
guided by a Deep Network (FORDN). FORDN consists of two steps. First, we use a
smaller dictionary encoding coarse basis FOs to represent the diffusion
signals. To estimate the mixture fractions of the dictionary atoms (and thus
coarse FOs), a deep network is designed specifically for solving the sparse
reconstruction problem. Here, the smaller dictionary is used to reduce the
computational cost of training. Second, the coarse FOs inform the final FO
estimation, where a larger dictionary encoding dense basis FOs is used and a
weighted l1-norm regularized least squares problem is solved to encourage FOs
that are consistent with the network output. FORDN was evaluated and compared
with state-of-the-art algorithms that estimate FOs using sparse reconstruction
on simulated and real dMRI data, and the results demonstrate the benefit of
using a deep network for FO estimation.Comment: A shorter version is accepted by MICCAI 201
Hopping in the crowd to unveil network topology
We introduce a nonlinear operator to model diffusion on a complex undirected
network under crowded conditions. We show that the asymptotic distribution of
diffusing agents is a nonlinear function of the nodes' degree and saturates to
a constant value for sufficiently large connectivities, at variance with
standard diffusion in the absence of excluded-volume effects. Building on this
observation, we define and solve an inverse problem, aimed at reconstructing
the a priori unknown connectivity distribution. The method gathers all the
necessary information by repeating a limited number of independent measurements
of the asymptotic density at a single node that can be chosen randomly. The
technique is successfully tested against both synthetic and real data, and
shown to estimate with great accuracy also the total number of nodes
Reconstructing propagation networks with natural diversity and identifying hidden sources
Our ability to uncover complex network structure and dynamics from data is
fundamental to understanding and controlling collective dynamics in complex
systems. Despite recent progress in this area, reconstructing networks with
stochastic dynamical processes from limited time series remains to be an
outstanding problem. Here we develop a framework based on compressed sensing to
reconstruct complex networks on which stochastic spreading dynamics take place.
We apply the methodology to a large number of model and real networks, finding
that a full reconstruction of inhomogeneous interactions can be achieved from
small amounts of polarized (binary) data, a virtue of compressed sensing.
Further, we demonstrate that a hidden source that triggers the spreading
process but is externally inaccessible can be ascertained and located with high
confidence in the absence of direct routes of propagation from it. Our approach
thus establishes a paradigm for tracing and controlling epidemic invasion and
information diffusion in complex networked systems.Comment: 20 pages and 5 figures. For Supplementary information, please see
http://www.nature.com/ncomms/2014/140711/ncomms5323/full/ncomms5323.html#
Deep learning-based parameter mapping for joint relaxation and diffusion tensor MR Fingerprinting
Magnetic Resonance Fingerprinting (MRF) enables the simultaneous
quantification of multiple properties of biological tissues. It relies on a
pseudo-random acquisition and the matching of acquired signal evolutions to a
precomputed dictionary. However, the dictionary is not scalable to
higher-parametric spaces, limiting MRF to the simultaneous mapping of only a
small number of parameters (proton density, T1 and T2 in general). Inspired by
diffusion-weighted SSFP imaging, we present a proof-of-concept of a novel MRF
sequence with embedded diffusion-encoding gradients along all three axes to
efficiently encode orientational diffusion and T1 and T2 relaxation. We take
advantage of a convolutional neural network (CNN) to reconstruct multiple
quantitative maps from this single, highly undersampled acquisition. We bypass
expensive dictionary matching by learning the implicit physical relationships
between the spatiotemporal MRF data and the T1, T2 and diffusion tensor
parameters. The predicted parameter maps and the derived scalar diffusion
metrics agree well with state-of-the-art reference protocols. Orientational
diffusion information is captured as seen from the estimated primary diffusion
directions. In addition to this, the joint acquisition and reconstruction
framework proves capable of preserving tissue abnormalities in multiple
sclerosis lesions
Data based identification and prediction of nonlinear and complex dynamical systems
We thank Dr. R. Yang (formerly at ASU), Dr. R.-Q. Su (formerly at ASU), and Mr. Zhesi Shen for their contributions to a number of original papers on which this Review is partly based. This work was supported by ARO under Grant No. W911NF-14-1-0504. W.-X. Wang was also supported by NSFC under Grants No. 61573064 and No. 61074116, as well as by the Fundamental Research Funds for the Central Universities, Beijing Nova Programme.Peer reviewedPostprin
Kernel-based Inference of Functions over Graphs
The study of networks has witnessed an explosive growth over the past decades
with several ground-breaking methods introduced. A particularly interesting --
and prevalent in several fields of study -- problem is that of inferring a
function defined over the nodes of a network. This work presents a versatile
kernel-based framework for tackling this inference problem that naturally
subsumes and generalizes the reconstruction approaches put forth recently by
the signal processing on graphs community. Both the static and the dynamic
settings are considered along with effective modeling approaches for addressing
real-world problems. The herein analytical discussion is complemented by a set
of numerical examples, which showcase the effectiveness of the presented
techniques, as well as their merits related to state-of-the-art methods.Comment: To be published as a chapter in `Adaptive Learning Methods for
Nonlinear System Modeling', Elsevier Publishing, Eds. D. Comminiello and J.C.
Principe (2018). This chapter surveys recent work on kernel-based inference
of functions over graphs including arXiv:1612.03615 and arXiv:1605.07174 and
arXiv:1711.0930
- …