26,608 research outputs found
Shape of my heart: Cardiac models through learned signed distance functions
The efficient construction of an anatomical model is one of the major
challenges of patient-specific in-silico models of the human heart. Current
methods frequently rely on linear statistical models, allowing no advanced
topological changes, or requiring medical image segmentation followed by a
meshing pipeline, which strongly depends on image resolution, quality, and
modality. These approaches are therefore limited in their transferability to
other imaging domains. In this work, the cardiac shape is reconstructed by
means of three-dimensional deep signed distance functions with Lipschitz
regularity. For this purpose, the shapes of cardiac MRI reconstructions are
learned from public databases to model the spatial relation of multiple
chambers in Cartesian space. We demonstrate that this approach is also capable
of reconstructing anatomical models from partial data, such as point clouds
from a single ventricle, or modalities different from the trained MRI, such as
electroanatomical mapping, and in addition, allows us to generate new
anatomical shapes by randomly sampling latent vectors
Persistent Homology in Sparse Regression and its Application to Brain Morphometry
Sparse systems are usually parameterized by a tuning parameter that
determines the sparsity of the system. How to choose the right tuning parameter
is a fundamental and difficult problem in learning the sparse system. In this
paper, by treating the the tuning parameter as an additional dimension,
persistent homological structures over the parameter space is introduced and
explored. The structures are then further exploited in speeding up the
computation using the proposed soft-thresholding technique. The topological
structures are further used as multivariate features in the tensor-based
morphometry (TBM) in characterizing white matter alterations in children who
have experienced severe early life stress and maltreatment. These analyses
reveal that stress-exposed children exhibit more diffuse anatomical
organization across the whole white matter region.Comment: submitted to IEEE Transactions on Medical Imagin
Unified Heat Kernel Regression for Diffusion, Kernel Smoothing and Wavelets on Manifolds and Its Application to Mandible Growth Modeling in CT Images
We present a novel kernel regression framework for smoothing scalar surface
data using the Laplace-Beltrami eigenfunctions. Starting with the heat kernel
constructed from the eigenfunctions, we formulate a new bivariate kernel
regression framework as a weighted eigenfunction expansion with the heat kernel
as the weights. The new kernel regression is mathematically equivalent to
isotropic heat diffusion, kernel smoothing and recently popular diffusion
wavelets. Unlike many previous partial differential equation based approaches
involving diffusion, our approach represents the solution of diffusion
analytically, reducing numerical inaccuracy and slow convergence. The numerical
implementation is validated on a unit sphere using spherical harmonics. As an
illustration, we have applied the method in characterizing the localized growth
pattern of mandible surfaces obtained in CT images from subjects between ages 0
and 20 years by regressing the length of displacement vectors with respect to
the template surface.Comment: Accepted in Medical Image Analysi
Geometry Processing of Conventionally Produced Mouse Brain Slice Images
Brain mapping research in most neuroanatomical laboratories relies on
conventional processing techniques, which often introduce histological
artifacts such as tissue tears and tissue loss. In this paper we present
techniques and algorithms for automatic registration and 3D reconstruction of
conventionally produced mouse brain slices in a standardized atlas space. This
is achieved first by constructing a virtual 3D mouse brain model from annotated
slices of Allen Reference Atlas (ARA). Virtual re-slicing of the reconstructed
model generates ARA-based slice images corresponding to the microscopic images
of histological brain sections. These image pairs are aligned using a geometric
approach through contour images. Histological artifacts in the microscopic
images are detected and removed using Constrained Delaunay Triangulation before
performing global alignment. Finally, non-linear registration is performed by
solving Laplace's equation with Dirichlet boundary conditions. Our methods
provide significant improvements over previously reported registration
techniques for the tested slices in 3D space, especially on slices with
significant histological artifacts. Further, as an application we count the
number of neurons in various anatomical regions using a dataset of 51
microscopic slices from a single mouse brain. This work represents a
significant contribution to this subfield of neuroscience as it provides tools
to neuroanatomist for analyzing and processing histological data.Comment: 14 pages, 11 figure
Topological exploration of artificial neuronal network dynamics
One of the paramount challenges in neuroscience is to understand the dynamics
of individual neurons and how they give rise to network dynamics when
interconnected. Historically, researchers have resorted to graph theory,
statistics, and statistical mechanics to describe the spatiotemporal structure
of such network dynamics. Our novel approach employs tools from algebraic
topology to characterize the global properties of network structure and
dynamics.
We propose a method based on persistent homology to automatically classify
network dynamics using topological features of spaces built from various
spike-train distances. We investigate the efficacy of our method by simulating
activity in three small artificial neural networks with different sets of
parameters, giving rise to dynamics that can be classified into four regimes.
We then compute three measures of spike train similarity and use persistent
homology to extract topological features that are fundamentally different from
those used in traditional methods. Our results show that a machine learning
classifier trained on these features can accurately predict the regime of the
network it was trained on and also generalize to other networks that were not
presented during training. Moreover, we demonstrate that using features
extracted from multiple spike-train distances systematically improves the
performance of our method
- …