Search

The international neuroscience community is building the first comprehensive atlases of brain cell types to understand how the brain functions from a higher resolution, and more integrated perspective than ever before. In order to build these atlases, subsets of neurons (e.g. serotonergic neurons, prefrontal cortical neurons etc.) are traced in individual brain samples by placing points along dendrites and axons. Then, the traces are mapped to common coordinate systems by transforming the positions of their points, which neglects how the transformation bends the line segments in between. In this work, we apply the theory of jets to describe how to preserve derivatives of neuron traces up to any order. We provide a framework to compute possible error introduced by standard mapping methods, which involves the Jacobian of the mapping transformation. We show how our first order method improves mapping accuracy in both simulated and real neuron traces under random diffeomorphisms. Our method is freely available in our open-source Python package brainlit.

Advances in the development of largely automated microscopy methods such as MERFISH for imaging cellular structures in mouse brains are providing spatial detection of micron resolution gene expression. While there has been tremendous progress made in the field Computational Anatomy (CA) to perform diffeomorphic mapping technologies at the tissue scales for advanced neuroinformatic studies in common coordinates, integration of molecular- and cellular-scale populations through statistical averaging via common coordinates remains yet unattained. This paper describes the first set of algorithms for calculating geodesics in the space of diffeomorphisms, what we term Image-Varifold LDDMM,extending the family of large deformation diffeomorphic metric mapping (LDDMM) algorithms to accommodate the "copy and paste" varifold action of particles which extends consistently to the tissue scales. We represent the brain data as geometric measures, termed as {\em image varifolds} supported by a large number of unstructured points, % (i.e., not aligned on a 2D or 3D grid), each point representing a small volume in space % (which may be incompletely described) and carrying a list of densities of {\em features} elements of a high-dimensional feature space. The shape of image varifold brain spaces is measured by transforming them by diffeomorphisms. The metric between image varifolds is obtained after embedding these objects in a linear space equipped with the norm, yielding a so-called "chordal metric."

Learning is a process which can update decision rules, based on past experience, such that future performance improves. Traditionally, machine learning is often evaluated under the assumption that the future will be identical to the past in distribution or change adversarially. But these assumptions can be either too optimistic or pessimistic for many problems in the real world. Real world scenarios evolve over multiple spatiotemporal scales with partially predictable dynamics. Here we reformulate the learning problem to one that centers around this idea of dynamic futures that are partially learnable. We conjecture that certain sequences of tasks are not retrospectively learnable (in which the data distribution is fixed), but are prospectively learnable (in which distributions may be dynamic), suggesting that prospective learning is more difficult in kind than retrospective learning. We argue that prospective learning more accurately characterizes many real world problems that (1) currently stymie existing artificial intelligence solutions and/or (2) lack adequate explanations for how natural intelligences solve them. Thus, studying prospective learning will lead to deeper insights and solutions to currently vexing challenges in both natural and artificial intelligences., Comment: Accepted at the 2nd Conference on Lifelong Learning Agents (CoLLAs), 2023

Recent advances in brain clearing and imaging have made it possible to image entire mammalian brains at sub-micron resolution. These images offer the potential to assemble brain-wide atlases of neuron morphology, but manual neuron reconstruction remains a bottleneck. Several automatic reconstruction algorithms exist, but most focus on single neuron images. In this paper, we present a probabilistic reconstruction method, ViterBrain, which combines a hidden Markov state process that encodes neuron geometry with a random field appearance model of neuron fluorescence. Our method utilizes dynamic programming to compute the global maximizers of what we call the "most probable" neuron path. Our most probable estimation method models the task of reconstructing neuronal processes in the presence of other neurons, and thus is applicable in images with several neurons. Our method operates on image segmentations in order to leverage cutting edge computer vision technology. We applied our algorithm to imperfect image segmentations where false negatives severed neuronal processes, and showed that it can follow axons in the presence of noise or nearby neurons. Additionally, it creates a framework where users can intervene to, for example, fit start and endpoints. The code used in this work is available in our open-source Python package brainlit.

A compositional tree refers to a tree structure on a set of random variables where each random variable is a node and composition occurs at each non-leaf node of the tree. As a generalization of compositional data, compositional trees handle more complex relationships among random variables and appear in many disciplines, such as brain imaging, genomics and finance. We consider the problem of sparse regression on data that are associated with a compositional tree and propose a transformation-free tree-based regularized regression method for component selection. The regularization penalty is designed based on the tree structure and encourages a sparse tree representation. We prove that our proposed estimator for regression coefficients is both consistent and model selection consistent. In the simulation study, our method shows higher accuracy than competing methods under different scenarios. By analyzing a brain imaging data set from studies of Alzheimer's disease, our method identifies meaningful associations between memory declination and volume of brain regions that are consistent with current understanding.

Neuromorphology is crucial to identifying neuronal subtypes and understanding learning. It is also implicated in neurological disease. However, standard morphological analysis focuses on macroscopic features such as branching frequency and connectivity between regions, and often neglects the internal geometry of neurons. In this work, we treat neuron trace points as a sampling of differentiable curves and fit them with a set of branching B-splines. We designed our representation with the Frenet-Serret formulas from differential geometry in mind. The Frenet-Serret formulas completely characterize smooth curves, and involve two parameters, curvature and torsion. Our representation makes it possible to compute these parameters from neuron traces in closed form. These parameters are defined continuously along the curve, in contrast to other parameters like tortuosity which depend on start and end points. We applied our method to a dataset of cortical projection neurons traced in two mouse brains, and found that the parameters are distributed differently between primary, collateral, and terminal axon branches, thus quantifying geometric differences between different components of an axonal arbor. The results agreed in both brains, further validating our representation. The code used in this work can be readily applied to neuron traces in SWC format and is available in our open-source Python package brainlit: http://brainlit.neurodata.io/.

Brain segmentation at different levels is generally represented as hierarchical trees. Brain regional atrophy at specific levels was found to be marginally associated with Alzheimer's disease outcomes. In this study, we propose an L1-type regularization for predictors that follow a hierarchical tree structure. Considering a tree as a directed acyclic graph, we interpret the model parameters from a path analysis perspective. Under this concept, the proposed penalty regulates the total effect of each predictor on the outcome. With regularity conditions, it is shown that under the proposed regularization, the estimator of the model coefficient is consistent in L2-norm and the model selection is also consistent. By applying to a brain structural magnetic resonance imaging dataset acquired from the Alzheimer's Disease Neuroimaging Initiative, the proposed approach identifies brain regions where atrophy in these regions demonstrates the declination in memory. With regularization on the total effects, the findings suggest that the impact of atrophy on memory deficits is localized from small brain regions but at various levels of brain segmentation.

We study a shape evolution framework in which the deformation of shapes from time t to t + dt is governed by a regularized anisotropic elasticity model. More precisely, we assume that at each time shapes are infinitesimally deformed from a stress-free state to an elastic equilibrium as a result of the application of a small force. The configuration of equilibrium then becomes the new resting state for subsequent evolution. The primary motivation of this work is the modeling of slow changes in biological shapes like atrophy, where a body force applied to the volume represents the location and impact of the disease. Our model uses an optimal control viewpoint with the time derivative of force interpreted as a control, deforming a shape gradually from its observed initial state to an observed final state. Furthermore, inspired by the layered organization of cortical volumes, we consider a special case of our model in which shapes can be decomposed into a family of layers (forming a "foliation"). Preliminary experiments on synthetic layered shapes in two and three dimensions are presented to demonstrate the effect of elasticity., Comment: 12 pages, 6 figures

Anatomy is undergoing a renaissance driven by availability of large digital data sets generated by light microscopy. A central computational task is to map individual data volumes to standardized templates. This is accomplished by regularized estimation of a diffeomorphic transformation between the coordinate systems of the individual data and the template, building the transformation incrementally by integrating a smooth flow field. The canonical volume form of this transformation is used to quantify local growth, atrophy, or cell density. While multiple implementations exist for this estimation, less attention has been paid to the variance of the estimated diffeomorphism for noisy data. Notably, there is an infinite dimensional un-observable space defined by those diffeomorphisms which leave the template invariant. These form the stabilizer subgroup of the diffeomorphic group acting on the template. The corresponding flat directions in the energy landscape are expected to lead to increased estimation variance. Here we show that a least-action principle used to generate geodesics in the space of diffeomorphisms connecting the subject brain to the template removes the stabilizer. This provides reduced-variance estimates of the volume form. Using simulations we demonstrate that the asymmetric large deformation diffeomorphic mapping methods (LDDMM), which explicitly incorporate the asymmetry between idealized template images and noisy empirical images, provide lower variance estimators than their symmetrized counterparts (cf. ANTs). We derive Cramer-Rao bounds for the variances in the limit of small deformations. Analytical results are shown for the Jacobian in terms of perturbations of the vector fields and divergence of the vector field.

Whole brain neuroanatomy using tera-voxel light-microscopic data sets is of much current interest. A fundamental problem in this field is the mapping of individual brain data sets to a reference space. Previous work has not rigorously quantified the distortions in brain geometry from in-vivo to ex-vivo brains due to the tissue processing, which will be important when computing properties such as local cell and process densities at the voxel level in creating reference brain maps. Further, existing approaches focus on registering uni-modal volumetric data; however, given the increasing interest in the marmoset model for neuroscience research, it is necessary to cross-register multi-modal data sets including MRIs and multiple histological series that can help address individual variations in brain architecture. Here we present a computational approach for same-subject multimodal MRI guided reconstruction of a histological series, jointly with diffeomorphic mapping to a reference atlas. We quantify the scale change during the different stages of histological processing of the brains using the Jacobian determinant of the diffeomorphic transformations involved. There are two major steps in the histology process with associated scale distortions (a) brain perfusion (b) histological sectioning and reassembly. By mapping the final image stacks to the ex-vivo post fixation MRI, we show that tape-transfer histology can be reassembled accurately into 3D volumes with a local scale change of 2.0 $\pm$ 0.4% per axis dimension. In contrast, the perfusion step, as assessed by mapping the in-vivo MRIs to the ex-vivo post fixation MRIs, shows a larger local scale change of 6.9 $\pm$ 2.1% per axis dimension. This is the first systematic quantification of the local metric distortions associated with whole-brain histological processing, and we expect that the results will generalize to other species.

Big imaging data is becoming more prominent in brain sciences across spatiotemporal scales and phylogenies. We have developed a computational ecosystem that enables storage, visualization, and analysis of these data in the cloud, thusfar spanning 20+ publications and 100+ terabytes including nanoscale ultrastructure, microscale synaptogenetic diversity, and mesoscale whole brain connectivity, making NeuroData the largest and most diverse open repository of brain data.

Neuroscientists are now able to acquire data at staggering rates across spatiotemporal scales. However, our ability to capitalize on existing datasets, tools, and intellectual capacities is hampered by technical challenges. The key barriers to accelerating scientific discovery correspond to the FAIR data principles: findability, global access to data, software interoperability, and reproducibility/re-usability. We conducted a hackathon dedicated to making strides in those steps. This manuscript is a technical report summarizing these achievements, and we hope serves as an example of the effectiveness of focused, deliberate hackathons towards the advancement of our quickly-evolving field., Comment: 10 pages, 4 figures, hackathon report

This paper presents a variational framework for dense diffeomorphic atlas-mapping onto high-throughput histology stacks at the 20 um meso-scale. The observed sections are modelled as Gaussian random fields conditioned on a sequence of unknown section by section rigid motions and unknown diffeomorphic transformation of a three-dimensional atlas. To regularize over the high-dimensionality of our parameter space (which is a product space of the rigid motion dimensions and the diffeomorphism dimensions), the histology stacks are modelled as arising from a first order Sobolev space smoothness prior. We show that the joint maximum a-posteriori, penalized-likelihood estimator of our high dimensional parameter space emerges as a joint optimization interleaving rigid motion estimation for histology restacking and large deformation diffeomorphic metric mapping to atlas coordinates. We show that joint optimization in this parameter space solves the classical curvature non-identifiability of the histology stacking problem. The algorithms are demonstrated on a collection of whole-brain histological image stacks from the Mouse Brain Architecture Project.

CLARITY is a method for converting biological tissues into translucent and porous hydrogel-tissue hybrids. This facilitates interrogation with light sheet microscopy and penetration of molecular probes while avoiding physical slicing. In this work, we develop a pipeline for registering CLARIfied mouse brains to an annotated brain atlas. Due to the novelty of this microscopy technique it is impractical to use absolute intensity values to align these images to existing standard atlases. Thus we adopt a large deformation diffeomorphic approach for registering images via mutual information matching. Furthermore we show how a cascaded multi-resolution approach can improve registration quality while reducing algorithm run time. As acquired image volumes were over a terabyte in size, they were far too large for work on personal computers. Therefore the NeuroData computational infrastructure was deployed for multi-resolution storage and visualization of these images and aligned annotations on the web.

The CLARITY method renders brains optically transparent to enable high-resolution imaging in the structurally intact brain. Anatomically annotating CLARITY brains is necessary for discovering which regions contain signals of interest. Manually annotating whole-brain, terabyte CLARITY images is difficult, time-consuming, subjective, and error-prone. Automatically registering CLARITY images to a pre-annotated brain atlas offers a solution, but is difficult for several reasons. Removal of the brain from the skull and subsequent storage and processing cause variable non-rigid deformations, thus compounding inter-subject anatomical variability. Additionally, the signal in CLARITY images arises from various biochemical contrast agents which only sparsely label brain structures. This sparse labeling challenges the most commonly used registration algorithms that need to match image histogram statistics to the more densely labeled histological brain atlases. The standard method is a multiscale Mutual Information B-spline algorithm that dynamically generates an average template as an intermediate registration target. We determined that this method performs poorly when registering CLARITY brains to the Allen Institute's Mouse Reference Atlas (ARA), because the image histogram statistics are poorly matched. Therefore, we developed a method (Mask-LDDMM) for registering CLARITY images, that automatically find the brain boundary and learns the optimal deformation between the brain and atlas masks. Using Mask-LDDMM without an average template provided better results than the standard approach when registering CLARITY brains to the ARA. The LDDMM pipelines developed here provide a fast automated way to anatomically annotate CLARITY images. Our code is available as open source software at http://NeuroData.io.