Matching Items (85)
Filtering by
- Language: English
Description
Functional magnetic resonance imaging (fMRI) has been widely used to measure the retinotopic organization of early visual cortex in the human brain. Previous studies have identified multiple visual field maps (VFMs) based on statistical analysis of fMRI signals, but the resulting geometry has not been fully characterized with mathematical models. This thesis explores using concepts from computational conformal geometry to create a custom software framework for examining and generating quantitative mathematical models for characterizing the geometry of early visual areas in the human brain. The software framework includes a graphical user interface built on top of a selected core conformal flattening algorithm and various software tools compiled specifically for processing and examining retinotopic data. Three conformal flattening algorithms were implemented and evaluated for speed and how well they preserve the conformal metric. All three algorithms performed well in preserving the conformal metric but the speed and stability of the algorithms varied. The software framework performed correctly on actual retinotopic data collected using the standard travelling-wave experiment. Preliminary analysis of the Beltrami coefficient for the early data set shows that selected regions of V1 that contain reasonably smooth eccentricity and polar angle gradients do show significant local conformality, warranting further investigation of this approach for analysis of early and higher visual cortex.
ContributorsTa, Duyan (Author) / Wang, Yalin (Thesis advisor) / Maciejewski, Ross (Committee member) / Wonka, Peter (Committee member) / Arizona State University (Publisher)
Created2013
Description
In blindness research, the corpus callosum (CC) is the most frequently studied sub-cortical structure, due to its important involvement in visual processing. While most callosal analyses from brain structural magnetic resonance images (MRI) are limited to the 2D mid-sagittal slice, we propose a novel framework to capture a complete set of 3D morphological differences in the corpus callosum between two groups of subjects. The CCs are segmented from whole brain T1-weighted MRI and modeled as 3D tetrahedral meshes. The callosal surface is divided into superior and inferior patches on which we compute a volumetric harmonic field by solving the Laplace's equation with Dirichlet boundary conditions. We adopt a refined tetrahedral mesh to compute the Laplacian operator, so our computation can achieve sub-voxel accuracy. Thickness is estimated by tracing the streamlines in the harmonic field. We combine areal changes found using surface tensor-based morphometry and thickness information into a vector at each vertex to be used as a metric for the statistical analysis. Group differences are assessed on this combined measure through Hotelling's T2 test. The method is applied to statistically compare three groups consisting of: congenitally blind (CB), late blind (LB; onset > 8 years old) and sighted (SC) subjects. Our results reveal significant differences in several regions of the CC between both blind groups and the sighted groups; and to a lesser extent between the LB and CB groups. These results demonstrate the crucial role of visual deprivation during the developmental period in reshaping the structural architecture of the CC.
ContributorsXu, Liang (Author) / Wang, Yalin (Thesis advisor) / Maciejewski, Ross (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2013
Description
Sparsity has become an important modeling tool in areas such as genetics, signal and audio processing, medical image processing, etc. Via the penalization of l-1 norm based regularization, the structured sparse learning algorithms can produce highly accurate models while imposing various predefined structures on the data, such as feature groups or graphs. In this thesis, I first propose to solve a sparse learning model with a general group structure, where the predefined groups may overlap with each other. Then, I present three real world applications which can benefit from the group structured sparse learning technique. In the first application, I study the Alzheimer's Disease diagnosis problem using multi-modality neuroimaging data. In this dataset, not every subject has all data sources available, exhibiting an unique and challenging block-wise missing pattern. In the second application, I study the automatic annotation and retrieval of fruit-fly gene expression pattern images. Combined with the spatial information, sparse learning techniques can be used to construct effective representation of the expression images. In the third application, I present a new computational approach to annotate developmental stage for Drosophila embryos in the gene expression images. In addition, it provides a stage score that enables one to more finely annotate each embryo so that they are divided into early and late periods of development within standard stage demarcations. Stage scores help us to illuminate global gene activities and changes much better, and more refined stage annotations improve our ability to better interpret results when expression pattern matches are discovered between genes.
ContributorsYuan, Lei (Author) / Ye, Jieping (Thesis advisor) / Wang, Yalin (Committee member) / Xue, Guoliang (Committee member) / Kumar, Sudhir (Committee member) / Arizona State University (Publisher)
Created2013
Description
For over a century, researchers have been investigating collective cognition, in which a group of individuals together process information and act as a single cognitive unit. However, I still know little about circumstances under which groups achieve better (or worse) decisions than individuals. My dissertation research directly addressed this longstanding question, using the house-hunting ant Temnothorax rugatulus as a model system. Here I applied concepts and methods developed in psychology not only to individuals but also to colonies in order to investigate differences of their cognitive abilities. This approach is inspired by the superorganism concept, which sees a tightly integrated insect society as the analog of a single organism. I combined experimental manipulations and models to elucidate the emergent processes of collective cognition. My studies show that groups can achieve superior cognition by sharing the burden of option assessment among members and by integrating information from members using positive feedback. However, the same positive feedback can lock the group into a suboptimal choice in certain circumstances. Although ants are obligately social, my results show that they can be isolated and individually tested on cognitive tasks. In the future, this novel approach will help the field of animal behavior move towards better understanding of collective cognition.
ContributorsSasaki, Takao (Author) / Pratt, Stephen C (Thesis advisor) / Amazeen, Polemnia (Committee member) / Liebig, Jürgen (Committee member) / Janssen, Marco (Committee member) / Fewell, Jennifer (Committee member) / Hölldobler, Bert (Committee member) / Arizona State University (Publisher)
Created2013
Description
Over 2 billion people are using online social network services, such as Facebook, Twitter, Google+, LinkedIn, and Pinterest. Users update their status, post their photos, share their information, and chat with others in these social network sites every day; however, not everyone shares the same amount of information. This thesis explores methods of linking publicly available data sources as a means of extrapolating missing information of Facebook. An application named "Visual Friends Income Map" has been created on Facebook to collect social network data and explore geodemographic properties to link publicly available data, such as the US census data. Multiple predictors are implemented to link data sets and extrapolate missing information from Facebook with accurate predictions. The location based predictor matches Facebook users' locations with census data at the city level for income and demographic predictions. Age and relationship based predictors are created to improve the accuracy of the proposed location based predictor utilizing social network link information. In the case where a user does not share any location information on their Facebook profile, a kernel density estimation location predictor is created. This predictor utilizes publicly available telephone record information of all people with the same surname of this user in the US to create a likelihood distribution of the user's location. This is combined with the user's IP level information in order to narrow the probability estimation down to a local regional constraint.
ContributorsMao, Jingxian (Author) / Maciejewski, Ross (Thesis advisor) / Farin, Gerald (Committee member) / Wang, Yalin (Committee member) / Arizona State University (Publisher)
Created2012
Description
This document presents a new implementation of the Smoothed Particles Hydrodynamics algorithm using DirectX 11 and DirectCompute. The main goal of this document is to present to the reader an alternative solution to the largely studied and researched problem of fluid simulation. Most other solutions have been implemented using the NVIDIA CUDA framework; however, the proposed solution in this document uses the Microsoft general-purpose computing on graphics processing units API. The implementation allows for the simulation of a large number of particles in a real-time scenario. The solution presented here uses the Smoothed Particles Hydrodynamics algorithm to calculate the forces within the fluid; this algorithm provides a Lagrangian approach for discretizes the Navier-Stockes equations into a set of particles. Our solution uses the DirectCompute compute shaders to evaluate each particle using the multithreading and multi-core capabilities of the GPU increasing the overall performance. The solution then describes a method for extracting the fluid surface using the Marching Cubes method and the programmable interfaces exposed by the DirectX pipeline. Particularly, this document presents a method for using the Geometry Shader Stage to generate the triangle mesh as defined by the Marching Cubes method. The implementation results show the ability to simulate over 64K particles at a rate of 900 and 400 frames per second, not including the surface reconstruction steps and including the Marching Cubes steps respectively.
ContributorsFigueroa, Gustavo (Author) / Farin, Gerald (Thesis advisor) / Maciejewski, Ross (Committee member) / Wang, Yalin (Committee member) / Arizona State University (Publisher)
Created2012
Description
Alzheimer's Disease (AD) is the most common form of dementia observed in elderly patients and has significant social-economic impact. There are many initiatives which aim to capture leading causes of AD. Several genetic, imaging, and biochemical markers are being explored to monitor progression of AD and explore treatment and detection options. The primary focus of this thesis is to identify key biomarkers to understand the pathogenesis and prognosis of Alzheimer's Disease. Feature selection is the process of finding a subset of relevant features to develop efficient and robust learning models. It is an active research topic in diverse areas such as computer vision, bioinformatics, information retrieval, chemical informatics, and computational finance. In this work, state of the art feature selection algorithms, such as Student's t-test, Relief-F, Information Gain, Gini Index, Chi-Square, Fisher Kernel Score, Kruskal-Wallis, Minimum Redundancy Maximum Relevance, and Sparse Logistic regression with Stability Selection have been extensively exploited to identify informative features for AD using data from Alzheimer's Disease Neuroimaging Initiative (ADNI). An integrative approach which uses blood plasma protein, Magnetic Resonance Imaging, and psychometric assessment scores biomarkers has been explored. This work also analyzes the techniques to handle unbalanced data and evaluate the efficacy of sampling techniques. Performance of feature selection algorithm is evaluated using the relevance of derived features and the predictive power of the algorithm using Random Forest and Support Vector Machine classifiers. Performance metrics such as Accuracy, Sensitivity and Specificity, and area under the Receiver Operating Characteristic curve (AUC) have been used for evaluation. The feature selection algorithms best suited to analyze AD proteomics data have been proposed. The key biomarkers distinguishing healthy and AD patients, Mild Cognitive Impairment (MCI) converters and non-converters, and healthy and MCI patients have been identified.
ContributorsDubey, Rashmi (Author) / Ye, Jieping (Thesis advisor) / Wang, Yalin (Committee member) / Wu, Tong (Committee member) / Arizona State University (Publisher)
Created2012
Description
The spread of invasive species may be greatly affected by human responses to prior species spread, but models and estimation methods seldom explicitly consider human responses. I investigate the effects of management responses on estimates of invasive species spread rates. To do this, I create an agent-based simulation model of an insect invasion across a county-level citrus landscape. My model provides an approximation of a complex spatial environment while allowing the "truth" to be known. The modeled environment consists of citrus orchards with insect pests dispersing among them. Insects move across the simulation environment infesting orchards, while orchard managers respond by administering insecticide according to analyst-selected behavior profiles and management responses may depend on prior invasion states. Dispersal data is generated in each simulation and used to calculate spread rate via a set of estimators selected for their predominance in the empirical literature. Spread rate is a mechanistic, emergent phenomenon measured at the population level caused by a suite of latent biological, environmental, and anthropogenic. I test the effectiveness of orchard behavior profiles on invasion suppression and evaluate the robustness of the estimators given orchard responses. I find that allowing growers to use future expectations of spread in management decisions leads to reduced spread rates. Acting in a preventative manner by applying insecticide before insects are actually present, orchards are able to lower spread rates more than by reactive behavior alone. Spread rates are highly sensitive to spatial configuration. Spatial configuration is hardly a random process, consisting of many latent factors often not accounted for in spread rate estimation. Not considering these factors may lead to an omitted variables bias and skew estimation results. The ability of spread rate estimators to predict future spread varies considerably between estimators, and with spatial configuration, invader biological parameters, and orchard behavior profile. The model suggests that understanding the latent factors inherent to dispersal is important for selecting phenomenological models of spread and interpreting estimation results. This indicates a need for caution when evaluating spread. Although standard practice, current empirical estimators may both over- and underestimate spread rate in the simulation.
ContributorsShanafelt, David William (Author) / Fenichel, Eli P (Thesis advisor) / Richards, Timothy (Committee member) / Janssen, Marco (Committee member) / Arizona State University (Publisher)
Created2012
DescriptionThis paper provides an analysis of the differences in impacts made by companies that promote their sustainability efforts. A comparison of companies reveals that the ones with greater supply chain influence and larger consumer bases can make more concrete progress in terms of accomplishment for the sustainability realm.
ContributorsBeaubien, Courtney Lynn (Author) / Anderies, John (Thesis director) / Allenby, Brad (Committee member) / Janssen, Marco (Committee member) / Barrett, The Honors College (Contributor) / School of Life Sciences (Contributor)
Created2013-05
Description
The evolution of cooperation is a fundamental problem in biology, especially for non-relatives, where indirect fitness benefits cannot counter within-group inequalities. Multilevel selection models show how cooperation can evolve if it generates a group-level advantage, even when cooperators are disadvantaged within their group. This allows the possibility of group selection, but few examples have been described in nature. Here we show that group selection can explain the evolution of cooperative nest founding in the harvester ant Pogonomyrmex californicus. Through most of this species’ range, colonies are founded by single queens, but in some populations nests are instead founded by cooperative groups of unrelated queens. In mixed groups of cooperative and single-founding queens, we found that aggressive individuals had a survival advantage within their nest, but foundress groups with such non-cooperators died out more often than those with only cooperative members. An agent-based model shows that the between-group advantage of the cooperative phenotype drives it to fixation, despite its within-group disadvantage, but only when population density is high enough to make between-group competition intense. Field data show higher nest density in a population where cooperative founding is common, consistent with greater density driving the evolution of cooperative foundation through group selection.
ContributorsShaffer, Zachary (Author) / Sasaki, Takao (Author) / Haney, Brian (Author) / Janssen, Marco (Author) / Pratt, Stephen (Author) / Fewell, Jennifer (Author) / College of Liberal Arts and Sciences (Contributor)
Created2016-07-28