2,580 research outputs found
Computational Network Analysis of the Anatomical and Genetic Organizations in the Mouse Brain
Motivation: The mammalian central nervous system (CNS) generates high-level behavior and cognitive functions. Elucidating the anatomical and genetic organizations in the CNS is a key step toward understanding the functional brain circuitry. The CNS contains an enormous number of cell types, each with unique gene expression patterns. Therefore, it is of central importance to capture the spatial expression patterns in the brain. Currently, genome-wide atlas of spatial expression patterns in the mouse brain has been made available, and the data are in the form of aligned 3D data arrays. The sheer volume and complexity of these data pose significant challenges for efficient computational analysis. Results: We employ data reduction and network modeling techniques to explore the anatomical and genetic organizations in the mouse brain. First, to reduce the volume of data, we propose to apply tensor factorization techniques to reduce the data volumes. This tensor formulation treats the stack of 3D volumes as a 4D data array, thereby preserving the mouse brain geometry. We then model the anatomical and genetic organizations as graphical models. To improve the robustness and efficiency of network modeling, we employ stable model selection and efficient sparsity-regularized formulation. Results on network modeling show that our efforts recover known interactions and predicts novel putative correlations
Generative-Discriminative Low Rank Decomposition for Medical Imaging Applications
In this thesis, we propose a method that can be used to extract biomarkers from medical images toward early diagnosis of abnormalities. Surge of demand for biomarkers and availability of medical images in the recent years call for accurate, repeatable, and interpretable approaches for extracting meaningful imaging features. However, extracting such information from medical images is a challenging task because the number of pixels (voxels) in a typical image is in order of millions while even a large sample-size in medical image dataset does not usually exceed a few hundred. Nevertheless, depending on the nature of an abnormality, only a parsimonious subset of voxels is typically relevant to the disease; therefore various notions of sparsity are exploited in this thesis to improve the generalization performance of the prediction task.
We propose a novel discriminative dimensionality reduction method that yields good classification performance on various datasets without compromising the clinical interpretability of the results. This is achieved by combining the modelling strength of generative learning framework and the classification performance of discriminative learning paradigm. Clinical interpretability can be viewed as an additional measure of evaluation and is also helpful in designing methods that account for the clinical prior such as association of certain areas in a brain to a particular cognitive task or connectivity of some brain regions via neural fibres.
We formulate our method as a large-scale optimization problem to solve a constrained matrix factorization. Finding an optimal solution of the large-scale matrix factorization renders off-the-shelf solver computationally prohibitive; therefore, we designed an efficient algorithm based on the proximal method to address the computational bottle-neck of the optimization problem. Our formulation is readily extended for different scenarios such as cases where a large cohort of subjects has uncertain or no class labels (semi-supervised learning) or a case where each subject has a battery of imaging channels (multi-channel), \etc. We show that by using various notions of sparsity as feasible sets of the optimization problem, we can encode different forms of prior knowledge ranging from brain parcellation to brain connectivity
Recommended from our members
Nonlinear Data: Theory and Algorithms
Techniques and concepts from differential geometry are used in many parts of applied mathematics today. However, there is no joint community for users of such techniques. The workshop on Nonlinear Data assembled researchers from fields like numerical linear algebra, partial differential equations, and data analysis to explore differential geometry techniques, share knowledge, and learn about new ideas and applications
Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications
This survey explores modern approaches for computing low-rank approximations
of high-dimensional matrices by means of the randomized SVD, randomized
subspace iteration, and randomized block Krylov iteration. The paper compares
the procedures via theoretical analyses and numerical studies to highlight how
the best choice of algorithm depends on spectral properties of the matrix and
the computational resources available.
Despite superior performance for many problems, randomized block Krylov
iteration has not been widely adopted in computational science. The paper
strengthens the case for this method in three ways. First, it presents new
pseudocode that can significantly reduce computational costs. Second, it
provides a new analysis that yields simple, precise, and informative error
bounds. Last, it showcases applications to challenging scientific problems,
including principal component analysis for genetic data and spectral clustering
for molecular dynamics data.Comment: 60 pages, 14 figure
- …