Skip to main content

Automated computation of arbor densities: a step toward identifying neuronal cell types

Author(s): Sümbül, Uygar; Zlateski, Aleksandar; Vishwanathan, Ashwin; Masland, Richard H; Seung, H Sebastian

To refer to this page use:
Abstract: The shape and position of a neuron convey information regarding its molecular and functional identity. The identification of cell types from structure, a classic method, relies on the time-consuming step of arbor tracing. However, as genetic tools and imaging methods make data-driven approaches to neuronal circuit analysis feasible, the need for automated processing increases. Here, we first establish that mouse retinal ganglion cell types can be as precise about distributing their arbor volumes across the inner plexiform layer as they are about distributing the skeletons of the arbors. Then, we describe an automated approach to computing the spatial distribution of the dendritic arbors, or arbor density, with respect to a global depth coordinate based on this observation. Our method involves three-dimensional reconstruction of neuronal arbors by a supervised machine learning algorithm, post-processing of the enhanced stacks to remove somata and isolate the neuron of interest, and registration of neurons to each other using automatically detected arbors of the starburst amacrine interneurons as fiducial markers. In principle, this method could be generalizable to other structures of the CNS, provided that they allow sparse labeling of the cells and contain a reliable axis of spatial reference.
Publication Date: 25-Nov-2014
Citation: Sümbül, Uygar, Aleksandar Zlateski, Ashwin Vishwanathan, Richard H. Masland, and H. Sebastian Seung. "Automated computation of arbor densities: a step toward identifying neuronal cell types." Frontiers in Neuroanatomy 8 (2014): 139:1-10. doi:10.3389/fnana.2014.00139
DOI: 10.3389/fnana.2014.00139
EISSN: 1662-5129
Pages: 139:1-10
Type of Material: Journal Article
Journal/Proceeding Title: Frontiers in Neuroanatomy
Version: Final published version. This is an open access article.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.