Matching Items (18)
Filtering by

Clear all filters

129655-Thumbnail Image.png
Description

In this paper, we develop a new automated surface registration system based on surface conformal parameterization by holomorphic 1-forms, inverse consistent surface fluid registration, and multivariate tensor-based morphometty (mTBM). First, we conformally map a surface onto a planar rectangle space with holomorphic 1-forms. Second, we compute surface conformal representation by

In this paper, we develop a new automated surface registration system based on surface conformal parameterization by holomorphic 1-forms, inverse consistent surface fluid registration, and multivariate tensor-based morphometty (mTBM). First, we conformally map a surface onto a planar rectangle space with holomorphic 1-forms. Second, we compute surface conformal representation by combining its local conformal factor and mean curvature and linearly scale the dynamic range of the conformal representation to form the feature image of the surface. Third, we align the feature image with a chosen template image via the fluid image registration algorithm, which has been extended into the curvilinear coordinates to adjust for the distortion introduced by surface parameterization. The inverse consistent image registration algorithm is also incorporated in the system to jointly estimate the forward and inverse transformations between the study and template images. This alignment induces a corresponding deformation on the surface. We tested the system on Alzheimer's Disease Neuroimaging Initiative (ADNI) baseline dataset to study AD symptoms on hippocampus. In our system, by modeling a hippocampus as a 3D parametric surface, we nonlinearly registered each surface with a selected template surface. Then we used mTBM to analyze the morphometry difference between diagnostic groups. Experimental results show that the new system has better performance than two publicly available subcortical surface registration tools: FIRST and SPHARM. We also analyzed the genetic influence of the Apolipoprotein E(is an element of)4 allele (ApoE4), which is considered as the most prevalent risk factor for AD. Our work successfully detected statistically significant difference between ApoE4 carriers and non-carriers in both patients of mild cognitive impairment (MCI) and healthy control subjects. The results show evidence that the ApoE genotype may be associated with accelerated brain atrophy so that our work provides a new MRI analysis tool that may help presymptomatic AD research.

ContributorsShi, Jie (Author) / Thompson, Paul M. (Author) / Gutman, Boris (Author) / Wang, Yalin (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2013-09-09
128004-Thumbnail Image.png
Description

Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex

Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex networks under game-based interactions from small amounts of data. The method is validated by using a variety of model networks and by conducting an actual experiment to reconstruct a social network. While most existing methods in this area assume oscillator networks that generate continuous-time data, our work successfully demonstrates that the extremely challenging problem of reverse engineering of complex networks can also be addressed even when the underlying dynamical processes are governed by realistic, evolutionary-game type of interactions in discrete time.

ContributorsWang, Wen-Xu (Author) / Lai, Ying-Cheng (Author) / Grebogi, Celso (Author) / Ye, Jieping (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2011-12-21
128560-Thumbnail Image.png
Description

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven,

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

ContributorsGao, Xin-Dong (Author) / Wang, Wen-Xu (Author) / Lai, Ying-Cheng (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2016-06-21
128519-Thumbnail Image.png
Description

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

ContributorsWang, Le-Zhi (Author) / Chen, Yu-Zhong (Author) / Wang, Wen-Xu (Author) / Lai, Ying-Cheng (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2017-01-11
128539-Thumbnail Image.png
Description

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control.

ContributorsWang, Le-Zhi (Author) / Su, Riqi (Author) / Huang, Zi-Gang (Author) / Wang, Xiao (Author) / Wang, Wen-Xu (Author) / Grebogi, Celso (Author) / Lai, Ying-Cheng (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2016-04-14
128511-Thumbnail Image.png
Description

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

ContributorsHan, Xiao (Author) / Shen, Zhesi (Author) / Wang, Wen-Xu (Author) / Lai, Ying-Cheng (Author) / Grebogi, Celso (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2016-07-22
129548-Thumbnail Image.png
Description

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

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.

ContributorsShen, Zhesi (Author) / Wang, Wen-Xu (Author) / Fan, Ying (Author) / Di, Zengru (Author) / Lai, Ying-Cheng (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2014-07-01
128812-Thumbnail Image.png
Description

Many children born preterm exhibit frontal executive dysfunction, behavioral problems including attentional deficit/hyperactivity disorder and attention related learning disabilities. Anomalies in regional specificity of cortico-striato-thalamo-cortical circuits may underlie deficits in these disorders. Nonspecific volumetric deficits of striatal structures have been documented in these subjects, but little is known about surface

Many children born preterm exhibit frontal executive dysfunction, behavioral problems including attentional deficit/hyperactivity disorder and attention related learning disabilities. Anomalies in regional specificity of cortico-striato-thalamo-cortical circuits may underlie deficits in these disorders. Nonspecific volumetric deficits of striatal structures have been documented in these subjects, but little is known about surface deformation in these structures. For the first time, here we found regional surface morphological differences in the preterm neonatal ventral striatum. We performed regional group comparisons of the surface anatomy of the striatum (putamen and globus pallidus) between 17 preterm and 19 term-born neonates at term-equivalent age. We reconstructed striatal surfaces from manually segmented brain magnetic resonance images and analyzed them using our in-house conformal mapping program. All surfaces were registered to a template with a new surface fluid registration method. Vertex-based statistical comparisons between the two groups were performed via four methods: univariate and multivariate tensor-based morphometry, the commonly used medial axis distance, and a combination of the last two statistics. We found statistically significant differences in regional morphology between the two groups that are consistent across statistics, but more extensive for multivariate measures. Differences were localized to the ventral aspect of the striatum. In particular, we found abnormalities in the preterm anterior/inferior putamen, which is interconnected with the medial orbital/prefrontal cortex and the midline thalamic nuclei including the medial dorsal nucleus and pulvinar. These findings support the hypothesis that the ventral striatum is vulnerable, within the cortico-stiato-thalamo-cortical neural circuitry, which may underlie the risk for long-term development of frontal executive dysfunction, attention deficit hyperactivity disorder and attention-related learning disabilities in preterm neonates.

ContributorsShi, Jie (Author) / Wang, Yalin (Author) / Ceschin, Rafael (Author) / An, Xing (Author) / Lao, Yi (Author) / Vanderbilt, Douglas (Author) / Nelson, Marvin D. (Author) / Thompson, Paul M. (Author) / Panigrahy, Ashok (Author) / Lepore, Natasha (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2013-07-03