Matching Items (26)
Filtering by
- Genre: Doctoral Dissertation
- Status: Published
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
The contemporary architectural pedagogy is far removed from its ancestry: the classical Beaux-Arts and polytechnic schools of the 19th century and the Bauhaus and Vkhutemas models of the modern period. Today, the "digital" has invaded the academy and shapes pedagogical practices, epistemologies, and ontologies within it, and this invasion is reflected in teaching practices, principles, and tools. Much of this digital integration goes unremarked and may not even be explicitly taught. In this qualitative research project, interviews with 18 leading architecture lecturers, professors, and deans from programs across the United States were conducted. These interviews focused on advanced practices of digital architecture, such as the use of digital tools, and how these practices are viewed. These interviews yielded a wealth of information about the uses (and abuses) of advanced digital technologies within the architectural academy, and the results were analyzed using the methods of phenomenology and grounded theory. Most schools use digital technologies to some extent, although this extent varies greatly. While some schools have abandoned hand-drawing and other hand-based craft almost entirely, others have retained traditional techniques and use digital technologies sparingly. Reasons for using digital design processes include industry pressure as well as the increased ability to solve problems and the speed with which they could be solved. Despite the prevalence of digital design, most programs did not teach related design software explicitly, if at all, instead requiring students (especially graduate students) to learn to use them outside the design studio. Some of the problems with digital design identified in the interviews include social problems such as alienation as well as issues like understanding scale and embodiment of skill.
ContributorsAlqabandy, Hamad (Author) / Brandt, Beverly (Thesis advisor) / Mesch, Claudia (Committee member) / Newton, David (Committee member) / Arizona State University (Publisher)
Created2012
Description
The dissertation focuses on several Romanian avant-garde magazines, such as Contimporanul, Integral, and 75HP, that Romanian artists and writers created in Romania in the 1920s, after Romanian Dadaists Tristan Tzara and Marcel Iancu disbanded from Zurich Dada in the 1910s. The Romanian avant-garde magazines launched the Romanian avant-garde movement—the most intense period of artistic production in the country. The Romanian avant-gardists established Integralism in an attempt to differentiate themselves from other European avant-garde groups and to capture the intense and innovative creative spirit of their modern era by uniting and condensing avant-garde and modern styles on the pages of their magazines. However, I argue that instead of Integralism, what the Romanian avant-garde magazines put forth were Romanian avant-garde versions of Constructivism and Cubism conveyed in the magazines’ constructivist prints and reproductions of cubist paintings. The originality of the Romanian avant-garde magazines, thus, is concentrated in their appropriation and reinterpretation of Constructivism and Cubism rather than in their Integralism. Moreover, in their rebellion and resistance to Romania’s social, political, and artistic status quo, the Romanian avant-garde magazines functioned as an instrument with which the Romanian avant-gardists expressed their complex relationship with their Jewish identity. The magazines were not on the periphery of artistic production, as art history discourse on modern and avant-garde art has situated them, but were an important player in the global network of avant-garde magazines that traversed across eastern and western Europe, South America, the United States, and Japan.
ContributorsMiholca, Amelia (Author) / Mesch, Claudia (Thesis advisor) / Orlich, Ileana (Committee member) / Holian, Anna (Committee member) / Navarro, Rudy (Committee member) / Arizona State University (Publisher)
Created2021
Description
This dissertation constructs a new computational processing framework to robustly and precisely quantify retinotopic maps based on their angle distortion properties. More generally, this framework solves the problem of how to robustly and precisely quantify (angle) distortions of noisy or incomplete (boundary enclosed) 2-dimensional surface to surface mappings. This framework builds upon the Beltrami Coefficient (BC) description of quasiconformal mappings that directly quantifies local mapping (circles to ellipses) distortions between diffeomorphisms of boundary enclosed plane domains homeomorphic to the unit disk. A new map called the Beltrami Coefficient Map (BCM) was constructed to describe distortions in retinotopic maps. The BCM can be used to fully reconstruct the original target surface (retinal visual field) of retinotopic maps. This dissertation also compared retinotopic maps in the visual processing cascade, which is a series of connected retinotopic maps responsible for visual data processing of physical images captured by the eyes. By comparing the BCM results from a large Human Connectome project (HCP) retinotopic dataset (N=181), a new computational quasiconformal mapping description of the transformed retinal image as it passes through the cascade is proposed, which is not present in any current literature. The description applied on HCP data provided direct visible and quantifiable geometric properties of the cascade in a way that has not been observed before. Because retinotopic maps are generated from in vivo noisy functional magnetic resonance imaging (fMRI), quantifying them comes with a certain degree of uncertainty. To quantify the uncertainties in the quantification results, it is necessary to generate statistical models of retinotopic maps from their BCMs and raw fMRI signals. Considering that estimating retinotopic maps from real noisy fMRI time series data using the population receptive field (pRF) model is a time consuming process, a convolutional neural network (CNN) was constructed and trained to predict pRF model parameters from real noisy fMRI data
ContributorsTa, Duyan Nguyen (Author) / Wang, Yalin (Thesis advisor) / Lu, Zhong-Lin (Committee member) / Hansford, Dianne (Committee member) / Liu, Huan (Committee member) / Li, Baoxin (Committee member) / Arizona State University (Publisher)
Created2022
Description
Retinotopic map, the map between visual inputs on the retina and neuronal activation in brain visual areas, is one of the central topics in visual neuroscience. For human observers, the map is typically obtained by analyzing functional magnetic resonance imaging (fMRI) signals of cortical responses to slowly moving visual stimuli on the retina. Biological evidences show the retinotopic mapping is topology-preserving/topological (i.e. keep the neighboring relationship after human brain process) within each visual region.
Unfortunately, due to limited spatial resolution and the signal-noise ratio of fMRI, state of art retinotopic map is not topological.
The topic was to model the topology-preserving condition mathematically, fix non-topological retinotopic map with numerical methods, and improve the quality of retinotopic maps.
The impose of topological condition, benefits several applications.
With the topological retinotopic maps, one may have a better insight on human retinotopic maps, including better cortical magnification factor quantification, more precise description of retinotopic maps, and potentially better exam ways of in Ophthalmology clinic.
ContributorsTu, Yanshuai (Author) / Wang, Yalin (Thesis advisor) / Lu, Zhong-Lin (Committee member) / Crook, Sharon (Committee member) / Yang, Yezhou (Committee member) / Zhang, Yu (Committee member) / Arizona State University (Publisher)
Created2022
Description
Beta-Amyloid(Aβ) plaques and tau protein tangles in the brain are now widely recognized as the defining hallmarks of Alzheimer’s disease (AD), followed by structural atrophy detectable on brain magnetic resonance imaging (MRI) scans. However, current methods to detect Aβ/tau pathology are either invasive (lumbar puncture) or quite costly and not widely available (positron emission tomography (PET)). And one of the particular neurodegenerative regions is the hippocampus to which the influence of Aβ/tau on has been one of the research projects focuses in the AD pathophysiological progress.
In this dissertation, I proposed three novel machine learning and statistical models to examine subtle aspects of the hippocampal morphometry from MRI that are associated with Aβ /tau burden in the brain, measured using PET images. The first model is a novel unsupervised feature reduction model to generate a low-dimensional representation of hippocampal morphometry for each individual subject, which has superior performance in predicting Aβ/tau burden in the brain. The second one is an efficient federated group lasso model to identify the hippocampal subregions where atrophy is strongly associated with abnormal Aβ/Tau. The last one is a federated model for imaging genetics, which can identify genetic and transcriptomic influences on hippocampal morphometry. Finally, I stated the results of these three models that have been published or submitted to peer-reviewed conferences and journals.
ContributorsWu, Jianfeng (Author) / Wang, Yalin (Thesis advisor) / Li, Baoxin (Committee member) / Liang, Jianming (Committee member) / Wang, Junwen (Committee member) / Wu, Teresa (Committee member) / Arizona State University (Publisher)
Created2022
Description
Statistical Shape Modeling is widely used to study the morphometrics of deformable objects in computer vision and biomedical studies. There are mainly two viewpoints to understand the shapes. On one hand, the outer surface of the shape can be taken as a two-dimensional embedding in space. On the other hand, the outer surface along with its enclosed internal volume can be taken as a three-dimensional embedding of interests. Most studies focus on the surface-based perspective by leveraging the intrinsic features on the tangent plane. But a two-dimensional model may fail to fully represent the realistic properties of shapes with both intrinsic and extrinsic properties. In this thesis, severalStochastic Partial Differential Equations (SPDEs) are thoroughly investigated and several methods are originated from these SPDEs to try to solve the problem of both two-dimensional and three-dimensional shape analyses. The unique physical meanings of these SPDEs inspired the findings of features, shape descriptors, metrics, and kernels in this series of works. Initially, the data generation of high-dimensional shapes, here, the tetrahedral meshes, is introduced. The cerebral cortex is taken as the study target and an automatic pipeline of generating the gray matter tetrahedral mesh is introduced. Then, a discretized Laplace-Beltrami operator (LBO) and a Hamiltonian operator (HO) in tetrahedral domain with Finite Element Method (FEM) are derived. Two high-dimensional shape descriptors are defined based on the solution of the heat equation and Schrödinger’s equation. Considering the fact that high-dimensional shape models usually contain massive redundancies, and the demands on effective landmarks in many applications, a Gaussian process landmarking on tetrahedral meshes is further studied. A SIWKS-based metric space is used to define a geometry-aware Gaussian process. The study of the periodic potential diffusion process further inspired the idea of a new kernel call the geometry-aware convolutional kernel. A series of Bayesian learning methods are then introduced to tackle the problem of shape retrieval and classification. Experiments of every single item are demonstrated. From the popular SPDE such as the heat equation and Schrödinger’s equation to the general potential diffusion equation and the specific periodic potential diffusion equation, it clearly shows that classical SPDEs play an important role in discovering new features, metrics, shape descriptors and kernels. I hope this thesis could be an example of using interdisciplinary knowledge to solve problems.
ContributorsFan, Yonghui (Author) / Wang, Yalin (Thesis advisor) / Lepore, Natasha (Committee member) / Turaga, Pavan (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2021
Description
Graph matching is a fundamental but notoriously difficult problem due to its NP-hard nature, and serves as a cornerstone for a series of applications in machine learning and computer vision, such as image matching, dynamic routing, drug design, to name a few. Although there has been massive previous investigation on high-performance graph matching solvers, it still remains a challenging task to tackle the matching problem under real-world scenarios with severe graph uncertainty (e.g., noise, outlier, misleading or ambiguous link).In this dissertation, a main focus is to investigate the essence and propose solutions to graph matching with higher reliability under such uncertainty. To this end, the proposed research was conducted taking into account three perspectives related to reliable graph matching: modeling, optimization and learning. For modeling, graph matching is extended from typical quadratic assignment problem to a more generic mathematical model by introducing a specific family of separable function, achieving higher capacity and reliability. In terms of optimization, a novel high gradient-efficient determinant-based regularization technique is proposed in this research, showing high robustness against outliers. Then learning paradigm for graph matching under intrinsic combinatorial characteristics is explored. First, a study is conducted on the way of filling the gap between discrete problem and its continuous approximation under a deep learning framework. Then this dissertation continues to investigate the necessity of more reliable latent topology of graphs for matching, and propose an effective and flexible framework to obtain it. Coherent findings in this dissertation include theoretical study and several novel algorithms, with rich experiments demonstrating the effectiveness.
ContributorsYu, Tianshu (Author) / Li, Baoxin (Thesis advisor) / Wang, Yalin (Committee member) / Yang, Yezhou (Committee member) / Yang, Yingzhen (Committee member) / Arizona State University (Publisher)
Created2021
Description
Graph matching is a fundamental but notoriously difficult problem due to its NP-hard nature, and serves as a cornerstone for a series of applications in machine learning and computer vision, such as image matching, dynamic routing, drug design, to name a few. Although there has been massive previous investigation on high-performance graph matching solvers, it still remains a challenging task to tackle the matching problem under real-world scenarios with severe graph uncertainty (e.g., noise, outlier, misleading or ambiguous link).In this dissertation, a main focus is to investigate the essence and propose solutions to graph matching with higher reliability under such uncertainty. To this end, the proposed research was conducted taking into account three perspectives related to reliable graph matching: modeling, optimization and learning. For modeling, graph matching is extended from typical quadratic assignment problem to a more generic mathematical model by introducing a specific family of separable function, achieving higher capacity and reliability. In terms of optimization, a novel high gradient-efficient determinant-based regularization technique is proposed in this research, showing high robustness against outliers. Then learning paradigm for graph matching under intrinsic combinatorial characteristics is explored. First, a study is conducted on the way of filling the gap between discrete problem and its continuous approximation under a deep learning framework. Then this dissertation continues to investigate the necessity of more reliable latent topology of graphs for matching, and propose an effective and flexible framework to obtain it. Coherent findings in this dissertation include theoretical study and several novel algorithms, with rich experiments demonstrating the effectiveness.
ContributorsYu, Tianshu (Author) / Li, Baoxin (Thesis advisor) / Wang, Yalin (Committee member) / Yang, Yezhou (Committee member) / Yang, Yingzhen (Committee member) / Arizona State University (Publisher)
Created2021
Description
Tools designed to help match people with behaviors they identify as likely to lead to a successful behavioral outcome remain under-researched. This study assessed the effect of a participant-driven behavior-matching intervention on 1) the adoption of a new behavior related to fruit and vegetable (F&V) consumption, 2) study attrition, and 3) changes in F&V consumption. In this two-arm randomized controlled trial, 64 adults who did not meet standard F&V recommendations were allocated to an intervention (n=33) or control group (n=31). Participants in the intervention group ranked 20 F&V-related behaviors according to their perceived likelihood of engagement in the behavior and their perception of the behavior’s efficacy in increasing F&V consumption. Participants in the intervention group were subsequently shown the list of 20 behaviors in order of their provided rankings, with the highest-ranked behaviors at the top, and were asked to choose a behavior they would like to perform daily for 4 weeks. The control group chose from a random-order list of the same 20 behaviors to adopt daily for 4 weeks. During the study period, text messages were sent to all participants 90 minutes before their reported bedtime to collect Yes/No data reflecting successful behavior engagement each day. The binary repeated-measures data collected from the text messages was analyzed using mixed-effects logistic regression, differences in attrition were assessed using log-rank analysis, and change scores in F&V consumption were compared between the two groups using the Man-Whitney U test. P<0.05 indicated significance. The rate of successful behavior adoption did not differ significantly between the two groups (b=0.09, 95%CI= -0.81, 0.98, p=0.85). The log rank test results indicated that there was no significant difference in attrition between the two groups (χ2=2.68, df=1, p=0.10). F&V consumption increased significantly over the 4 weeks in the total sample (Z=-5.86, p<0.001), but no differences in F&V change scores were identified between the control and intervention groups (Z=-0.21, p=0.84). The behavior-matching tool assessed in this study did not significantly improve behavior adoption, study attrition, or F&V intake over 4 weeks.
ContributorsCosgrove, Kelly Sarah (Author) / Wharton, Christopher (Thesis advisor) / Adams, Marc (Committee member) / DesRoches, Tyler (Committee member) / Grebitus, Carola (Committee member) / Johnston, Carol (Committee member) / Arizona State University (Publisher)
Created2023