Neuromantic : from semi-manual to semi-automatic reconstruction of neuron morphology

The ability to create accurate geometric models of neuronal morphology is important for understanding the role of shape in information processing. Despite a significant amount of research on automating neuron reconstructions from image stacks obtained via microscopy, in practice most data are still collected manually. This paper describes Neuromantic, an open source system for three dimensional digital tracing of neurites. Neuromantic reconstructions are comparable in quality to those of existing commercial and freeware systems while balancing speed and accuracy of manual reconstruction. The combination of semi-automatic tracing, intuitive editing, and ability of visualizing large image stacks on standard computing platforms provides a versatile tool that can help address the reconstructions availability bottleneck. Practical considerations for reducing the computational time and space requirements of the extended algorithm are also discussed

Image informatics strategies for deciphering neuronal network connectivity

Brain function relies on an intricate network of highly dynamic neuronal connections that rewires dramatically under the impulse of various external cues and pathological conditions. Among the neuronal structures that show morphologi- cal plasticity are neurites, synapses, dendritic spines and even nuclei. This structural remodelling is directly connected with functional changes such as intercellular com- munication and the associated calcium-bursting behaviour. In vitro cultured neu- ronal networks are valuable models for studying these morpho-functional changes. Owing to the automation and standardisation of both image acquisition and image analysis, it has become possible to extract statistically relevant readout from such networks. Here, we focus on the current state-of-the-art in image informatics that enables quantitative microscopic interrogation of neuronal networks. We describe the major correlates of neuronal connectivity and present workflows for analysing them. Finally, we provide an outlook on the challenges that remain to be addressed, and discuss how imaging algorithms can be extended beyond in vitro imaging studies

Semi-Automated Reconstruction of Curvilinear Structures in Noisy 2D images and 3D image stacks

We propose a new approach to semi-automated delineation of curvilinear structures in a wide range of imaging modalities. Earlier approaches lack robustness to imaging noise, do not provide radius estimates for the structures and operate only on single channel images. In contrast, ours makes use of the color information, when available, and generates accurate centreline location and radius estimates with minimal supervision. We demonstrate this on a wide range of datasets ranging from a 2D dataset of aerial images to 3D micrographs of neurites

Potential Synaptic Connectivity of Different Neurons onto Pyramidal Cells in a 3D Reconstruction of the Rat Hippocampus

Most existing connectomic data and ongoing efforts focus either on individual synapses (e.g., with electron microscopy) or on regional connectivity (tract tracing). An individual pyramidal cell (PC) extends thousands of synapses over macroscopic distances (∼cm). The contrasting requirements of high-resolution and large field of view make it too challenging to acquire the entire synaptic connectivity for even a single typical cortical neuron. Light microscopy can image whole neuronal arbors and resolve dendritic branches. Analyzing connectivity in terms of close spatial appositions between axons and dendrites could thus bridge the opposite scales, from synaptic level to whole systems. In the mammalian cortex, structural plasticity of spines and boutons makes these “potential synapses” functionally relevant to learning capability and memory capacity. To date, however, potential synapses have only been mapped in the surrounding of a neuron and relative to its local orientation rather than in a system-level anatomical reference. Here we overcome this limitation by estimating the potential connectivity of different neurons embedded into a detailed 3D reconstruction of the rat hippocampus. Axonal and dendritic trees were oriented with respect to hippocampal cytoarchitecture according to longitudinal and transversal curvatures. We report the potential connectivity onto PC dendrites from the axons of a dentate granule cell, three CA3 PCs, one CA2 PC, and 13 CA3b interneurons. The numbers, densities, and distributions of potential synapses were analyzed in each sub-region (e.g., CA3 vs. CA1), layer (e.g., oriens vs. radiatum), and septo-temporal location (e.g., dorsal vs. ventral). The overall ratio between the numbers of actual and potential synapses was ∼0.20 for the granule and CA3 PCs. All potential connectivity patterns are strikingly dependent on the anatomical location of both pre-synaptic and post-synaptic neurons

Planning and Doing Things

The University of Edinburgh and research sponsors are authorised to reproduce and distribute reprints and on-line copies for their purposes notwithstanding any copyright annotation hereon. The views and conclusions contained herein are the author’s and shouldn’t be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of other parties.I was interested in computers by the age of 15 and gave talks on them at school. I attended evening classes a couple of years later while still at school travelling on the bus for an hour in the evening to a college in Leeds to learn programming (in COBOL!). Computers at that time filled a room, you submitted your exercises on punched card and got the results the following day. I built my first AI planner over 35 years ago. I’d already been on an early AI course at Lancaster University where the language of choice for teaching a range of topics was POP-2 and wanted to do a Summer project to create a problem solver. With support from Donald Michie and his team at Edinburgh I tried to create a Graph Traverser along the lines they were working on. Boy, am I glad I got involved with Computers, AI and planning technology

The natverse, a versatile toolbox for combining and analysing neuroanatomical data.

To analyse neuron data at scale, neuroscientists expend substantial effort reading documentation, installing dependencies and moving between analysis and visualisation environments. To facilitate this, we have developed a suite of interoperable open-source R packages called the natverse. The natverse allows users to read local and remote data, perform popular analyses including visualisation and clustering and graph-theoretic analysis of neuronal branching. Unlike most tools, the natverse enables comparison across many neurons of morphology and connectivity after imaging or co-registration within a common template space. The natverse also enables transformations between different template spaces and imaging modalities. We demonstrate tools that integrate the vast majority of Drosophila neuroanatomical light microscopy and electron microscopy connectomic datasets. The natverse is an easy-to-use environment for neuroscientists to solve complex, large-scale analysis challenges as well as an open platform to create new code and packages to share with the community

The natverse, a versatile toolbox for combining and analysing neuroanatomical data.

To analyse neuron data at scale, neuroscientists expend substantial effort reading documentation, installing dependencies and moving between analysis and visualisation environments. To facilitate this, we have developed a suite of interoperable open-source R packages called the natverse. The natverse allows users to read local and remote data, perform popular analyses including visualisation and clustering and graph-theoretic analysis of neuronal branching. Unlike most tools, the natverse enables comparison across many neurons of morphology and connectivity after imaging or co-registration within a common template space. The natverse also enables transformations between different template spaces and imaging modalities. We demonstrate tools that integrate the vast majority of Drosophila neuroanatomical light microscopy and electron microscopy connectomic datasets. The natverse is an easy-to-use environment for neuroscientists to solve complex, large-scale analysis challenges as well as an open platform to create new code and packages to share with the community

Multiscale Exploration of Mouse Brain Microstructures Using the Knife-Edge Scanning Microscope Brain Atlas

Connectomics is the study of the full connection matrix of the brain. Recent advances in high-throughput, high-resolution 3D microscopy methods have enabled the imaging of whole small animal brains at a sub-micrometer resolution, potentially opening the road to full-blown connectomics research. One of the first such instruments to achieve whole-brain-scale imaging at sub-micrometer resolution is the Knife-Edge Scanning Microscope (KESM). KESM whole-brain data sets now include Golgi (neuronal circuits), Nissl (soma distribution), and India ink (vascular networks). KESM data can contribute greatly to connectomics research, since they fill the gap between lower resolution, large volume imaging methods (such as diffusion MRI) and higher resolution, small volume methods (e.g., serial sectioning electron microscopy). Furthermore, KESM data are by their nature multiscale, ranging from the subcellular to the whole organ scale. Due to this, visualization alone is a huge challenge, before we even start worrying about quantitative connectivity analysis. To solve this issue, we developed a web-based neuroinformatics framework for efficient visualization and analysis of the multiscale KESM data sets. In this paper, we will first provide an overview of KESM, then discuss in detail the KESM data sets and the web-based neuroinformatics framework, which is called the KESM brain atlas (KESMBA). Finally, we will discuss the relevance of the KESMBA to connectomics research, and identify challenges and future directions

Automated Reconstruction of Evolving Curvilinear Tree Structures

Curvilinear networks are prevalent in nature and span many different scales, ranging from micron-scale neural structures in the brain to petameter-scale dark-matter arbors binding massive galaxy clusters. Reliably reconstructing them in an automated fashion is of great value in many different scientific domains. However, it remains an open Computer Vision problem. In this thesis we focus on automatically delineating curvilinear tree structures in images of the same object of interest taken at different time instants. Unlike virtually all of the existing methods approaching the task of tree structures delineation we process all the images at once. This is useful in the more ambiguous regions and allows to reason for the tree structure that fits best to all the acquired data. We propose two methods that utilize this principle of temporal consistency to achieve results of higher quality compared to single time instant methods. The first, simpler method starts by building an overcomplete graph representation of the final solution in all time instants while simultaneously obtaining correspondences between image features across time. We then define an objective function with a temporal consistency prior and reconstruct the structures in all images at once by solving a mathematical optimization. The role of the prior is to encourage solutions where for two consecutive time instants corresponding candidate edges are either both retained or both rejected from the final solution. The second multiple time instant method uses the same overcomplete graph principle but handles the temporal consistency in a more robust way. Instead of focusing on the very local consistency of single edges of the overcomplete graph we propose a method for describing topological relationships. This favors solutions whose connectivity is consistent over time. We show that by making the temporal consistency more global we achieve additional robustness to errors in the initial features matching step, which is shared by both the approaches. In the end, this yields superior performance. Furthermore, an added benefit of both our approaches is the ability to automatically detect places where significant changes have occurred over time, which is challenging when considering large amounts of data. We also propose a simple single time instant method for delineating tree structures. It computes a Minimum Spanning Arborescence of an initial overcomplete graph and proceeds to optimally prune spurious branches. This yields results of lower but still competitive quality compared to the mathematical optimization based methods, while keeping low computational complexity. Our methods can applied to both 2D and 3D data. We demonstrate their performance in 3D on microscopy volumes of mouse brain and rat brain. We also test them in 2D on time-lapse images of a growing runner bean and aerial images of a road network