BEGIN:VCALENDAR
BEGIN:VEVENT
SUMMARY:PhD Defense - Daniel Moyer
DESCRIPTION:PhD Candidate: Daniel Moyer\n
Date: Friday August 23rd, 2019\n
Time: 9:30 am - 11:30 am\n
Location: GFS 213\n
Committee: Greg Ver Steeg, Paul Thompson, Aram Galstyan, Aiichiro Nakano\n
\n
Title:\n
Representation Problems in Brain Imaging\n
\n
Abstract:\n
Diffusion weighted Magnetic Resonance Imaging (dMRI) is a imaging modality that, conditional on direction, queries the propensity for water diffusion in living tissue. These images are desirable for studying tissues with anisotropic diffusion profiles, e.g. the white matter of the human brain. I here describe two problems at the interface between diffusion imaging and computational science, as well as proposed solutions for those problems, reconciling differences between current methodology, existing theory, and practical constraints.\n
\n
The first part of this thesis describes methodology from the intersection of network science and neuroscience. Previous literature has worked to estimate white matter axon bundles (fasiculi) from dMRI. Combined with segmentations of the grey matter, this leads intuitively to the construction of macro-scale brain networks, where nodes are cortical regions and edges are estimates of axonal connections. The work I present here deconstructs this progression, reconciling the inherently spatially continuous cortex with discrete network theory. The resulting model is a generalization of discrete graphs, using point process theory to create continuous interaction densities (continuum adjacency functions).\n
\n
The second part of this thesis describes a method for learning representations of data that invariant under changes in specified outside factors. These can be applied to diffusion imaging data, which in particular suffers from instrument/observer biases ("site/scanner" biases). Due to the relative complexity of the domain, modelling the particular effects of each instrument may be difficult; moreover, such an approach does not generalize to unseen instruments. Instead, the described method can learn representations that are minimally informed of the imaging site. Subsequent derived data will then be at least as uninformed of the site variable.\n
DTSTART:20190823T093000
LOCATION:GFS 213
URL;VALUE=URI:
DTEND:20190823T113000
END:VEVENT
END:VCALENDAR