Biology subjects

Mitra, P. P.

Publications and source records attributed to Mitra, P. P..

6 recordsLinked to original sources

bioRxiv2018

Unidirectional monosynaptic connections from auditory areas to the primary visual cortex in the marmoset monkey

Until the late 20th Century, it was believed that different sensory modalities were processed by largely independent pathways in the primate cortex, with cross-modal integration only occurring in specialized polysensory areas. This model was challenged by the finding that the peripheral representation of the primary visual cortex (V1) receives monosynaptic connections from areas of the auditory cortex in the macaque. However, auditory projections to V1 have not been reported in other primates. We investigated the existence of direct interconnections between V1 and auditory areas in the marmoset, a New World monkey. Labelled neurons in auditory cortex were observed following 4 out of 10 retrograde tracer injections involving V1. These projections to V1 originated in the caudal subdivisions of auditory cortex (primary auditory cortex, caudal belt and parabelt areas), and targeted parts of V1 that represent parafoveal and peripheral vision. Injections near the representation of the vertical meridian of the visual field labelled few or no cells in auditory cortex. We also placed 8 retrograde tracer injections involving core, belt and parabelt auditory areas, none of which revealed direct projections from V1. These results confirm the existence of a direct, nonreciprocal projection from auditory areas to V1 in a different primate species, which has evolved separately from the macaque for over 30 million years. The essential similarity of these observations between marmoset and macaque indicate that early-stage audiovisual integration is a shared characteristic of primate sensory processing.

neuroscience↗

bioRxiv2018

A High-throughput Neurohistological Pipeline for Brain-Wide Mesoscale Connectivity Mapping of the Common Marmoset

Understanding the connectivity architecture of entire vertebrate brains is a fundamental but difficult task. MRI based methods offer whole brain coverage, but remain indirect in the approach to connectivity mapping. Recent progress has been made in directly mapping whole-brain connectivity architecture in the mouse at the mesoscopic scale. The basic approach uses tracer injections systematically placed on a grid of locations spanning the brain and computational analysis of the resulting whole brain data sets. Scaling this approach to bigger primate brains poses nontrivial technical challenges. Here we present an integrated neurohistological pipeline as well as a grid-based tracer injection strategy for systematic mesoscale connectivity mapping in the common Marmoset (Callithrix jacchus). Individual brains are sectioned into [~]1700 20{micro}m sections using the tape transfer technique, permitting high quality 3D reconstruction of a series of histochemical stains (Nissl, myelin) interleaved with tracer labelled sections. Combining the resulting 3D volumes, containing informative cytoarchitectonic markers, with in-vivo and ex-vivo MRI, and using an integrated computational pipeline, we are able to overcome the significant individual variation exhibited by Marmosets to obtain routine and high quality maps to a common atlas framework. This will facilitate the systematic assembly of a mesoscale connectivity matrix together with unprecedented 3D reconstructions of brain-wide projection patterns in a primate brain. While component instruments or protocols may be available from previous work, we believe that this is the first detailed systems-level presentation of the methodology required for high-throughput neuroanatomy in a model primate.

neuroscience↗

bioRxiv2018

Continuity between koniocellular layers of dorsal lateral geniculate and inferior pulvinar nuclei in common marmosets

In primates, the koniocellular (K) layers of the dorsal lateral geniculate nucleus (LGN) and the calbindin-rich subdivisions of the inferior pulvinar (IPul) nucleus are considered part of a thalamic matrix system which projects diffusely to superficial cortical layers. Activity in the matrix system is proposed to coordinate oscillatory activity in thalamocortical loops. Further, since both K cells and IPul are involved in visual processing pathways, especially in alternative pathways to visual cortex after V1 lesion in early life (\"blindsight\"), their functional similarities have been strongly implicated. Here we tested the hypothesis that calbindin-positive K cells and IPul cells constitute a continuous group of cells. By combining immunohistochemistry and a high-throughput neuronal tracing method, we found that both K cells and IPul form reciprocal connections with striate and extrastriate cortices; whereas principal laminae of LGN do not receive inputs from extrastriate cortex and only project sparsely to these areas. Retrograde labelled cells in lateral division of IPul merged seamlessly into the retrograde labelled cells in K layers. These results supported the continuity between LGN K layers and IPul, providing the anatomical basis for functional congruity of this part of dorsal thalamic matrix.

neuroscience↗

bioRxiv2018

On variational solutions for whole brain serial-section histology using the computational anatomy random orbit model

This paper presents a variational framework for dense diffeomorphic atlas-mapping onto high-throughput histology stacks at the 20 m 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.\n\nAuthor SummaryNew developments in neural tracing techniques have motivated the widespread use of histology as a modality for exploring the circuitry of the brain. Automated mapping of pre-labeled atlases onto modern large datasets of histological imagery is a critical step for elucidating the brains neural circuitry and shape. This task is challenging as histological sections are imaged independently and the reconstruction of the unsectioned volume is nontrivial. Typically, neuroanatomists use reference volumes of the same subject (e.g. MRI) to guide reconstruction. However, obtaining reference imagery is often non-standard, as in high-throughput animal models like mouse histology. Others have proposed using anatomical atlases as guides, but have not accounted for the intrinsic nonlinear shape difference from atlas to subject. Our method addresses these limitations by jointly optimizing reconstruction informed by an atlas simultaneously with the nonlinear change of coordinates that encapsulates anatomical variation. This accounts for intrinsic shape differences and enables rigorous, direct comparisons of atlas and subject coordinates. Using simulations, we demonstrate that our method recovers the reconstruction parameters more accurately than atlas-free models and innately produces accurate segmentations from simultaneous atlas mapping. We also demonstrate our method on the Mouse Brain Architecture dataset, successfully mapping and reconstructing over 500 brains.

neuroscience↗

bioRxiv2018

High precision automated detection of labelednuclei in terabyte-scale whole-brain volumetricimage data of mouse

There is a need in modern neuroscience for accurate and automated image processing techniques for analyzing the large volume of neuroanatomical data. For e.g., the use of light microscopy to image whole mouse brains in a mesoscopic scale produces individual neuroanatomical data volumes in the TerraByte range.. A fundamental task involves the detection and quantification of objects of a given type, e.g. neuronal nuclei or somata, in whole mouse brains. Traditionally this quantification is performed by human visual inspection with high accuracy, that is not scalable.. When state-of-the-art CNN and SVM-based methods are used to solve this classification problem, they achieve accuracy levels between 85 - 92%. However, higher rates of precision and recall, close to that of humans are necessary. In this paper, we describe an unsupervised, iterative algorithm, which provides a high close to human performance for a specific problem of broad interest, i.e. detection of Green Fluorescent Protein labeled nuclei in whole mouse brains. The algorithm judiciously combines classical computer vision (CV) techniques and is focused on the complex problem of decomposing strong overlapped objects (nuclei). Our proposed iterative method uses features detected on ridge lines over distance transformation and an arc based iterative spatial-filling method to solve the problem. We demonstrate our results on two whole mouse brain data sets of Gigabyte resolution and compare it with manual annotation of the brains. Our results show that an aptly designed CV algorithm with classical feature extractors when tailored to this problem of interest achieves near-ideal human-like performance. Quantitative analysis, when compared with the manually annotated ground truth, reveals that our approach performs better on whole mouse brain scans than general purpose machine learning (including deep CNN) methods.

neuroscience↗

bioRxiv2016

Metrics for comparing Neuronal Tree Shapes based on Persistent Homology

The geometrical tree structures of axonal and dendritic processes play important roles in determining the architecture and capabilities of neuronal circuitry. Morphological features based on this tree structure have played a central role in classifying neurons for over a century. Yet geometrical trees are not automatically adapted to the basic mathematical tool used widely in data analysis, namely vector spaces and linear algebra, since tree geometries cannot be naturally added and subtracted. Current methods for analysis reduce trees to feature vectors in more or less ad hoc ways. A more natural mathematical object suited to characterizing neuronal tree geometries, is a metric space, where only distances between objects need be defined. In recent years, there have been significant developments in the fields of computational topology and geometry that promise to be useful for the analysis of neuronal geometries. In this paper, we adapt these tools to the problem of characterizing and analyzing neuronal morphology.\n\nAs more and more neuroanatomical data are made available through efforts such as NeuroMorpho.org and FlyCircuit.org, the need to develop computational tools to facilitate automatic knowledge discovery from such large datasets becomes more urgent. One fundamental question is how best to compare neuron structures, for instance to organize and classify large collection of neurons. We aim to develop a flexible yet powerful framework to support comparison and classification of large collection of neuron structures efficiently. Specifically we propose to use a topological persistence-based feature vectorization framework. Existing methods to vectorize a neuron (i.e, convert a neuron to a feature vector so as to support efficient comparison and/or searching) typically rely on statistics or summaries of morphometric information, such as the average or maximum local torque angle or partition asymmetry. These simple summaries have limited power in encoding global tree structures. Leveraging recent development in topological data analysis, we vectorize each neuron structure into a simple yet informative summary via the use of topological persistence. In particular, each type of information of interest can be represented as a descriptor function defined on the neuron tree, which is then mapped to a simple persistence-signature. Our framework can encode both local and global tree structure, as well as other information of interest (electrophysiological or dynamical measures), by considering multiple descriptor functions on the neuron. The resulting persistence-based signature is potentially more informative than simple statistical summaries (such as average/mean/max) of morphometric quantities - Indeed, we show that using a certain descriptor function will give a persistence-based signature containing strictly more information than the classical Sholl analysis. At the same time, our framework retains the efficiency associated with treating neurons as points in a simple Euclidean feature space, which would be important for constructing efficient searching or indexing structures over them. We present preliminary experimental results to demonstrate the effectiveness of our persistence-based neuronal feature vectorization framework.

neuroscience↗