title: AN OPTIMAL-PATH APPROACH FOR NEURAL CIRCUIT RECONSTRUCTION.
abstract: Neurobiologists are collecting large amounts of electron microscopy image data to gain a better understanding of neuron organization in the central nervous system. Image analysis plays an important role in extracting the connectivity present in these images; however, due to the large size of these datasets, manual analysis is essentially impractical. Automated analysis, however, is challenging because of the difficulty in reliably segmenting individual neurons in 3D. In this paper, we describe an automatic method for finding neurons in sequences of 2D sections. The proposed method formulates the problem of finding paths through sets of sections as an optimal path computation, which applies a cost function to the identification of a cell from one section to the next and solves this optimization problem using Dijkstra's algorithm. This basic formulation allows us to account for variability or inconsistencies between sections and to prioritize cells based on the evidence of their connectivity.
authors.affiliation: School of Computing, University of Utah.
authors.forename: Elizabeth
authors.initials: E
authors.lastname: Jurrus
authors.forename: Ross
authors.initials: R
authors.lastname: Whitaker
authors.forename: Bryan W
authors.initials: BW
authors.lastname: Jones
authors.forename: Robert
authors.initials: R
authors.lastname: Marc
authors.forename: Tolga
authors.initials: T
authors.lastname: Tasdizen