FMST: an Automatic Neuron Tracing Method Based on Fast Marching and Minimum Spanning Tree
Neuron reconstruction is an important technique in computational neuroscience. Although there are many reconstruction algorithms, few can generate robust results. In this paper, we propose a reconstruction algorithm called fast marching spanning tree (FMST). FMST is based on a minimum spanning tree method (MST) and improve its performance in two aspects: faster implementation and no loss of small branches. The contributions of the proposed method are as follows. Firstly, the Euclidean distance weight of edges in MST is improved to be a more reasonable value, which is related to the probability of the existence of an edge. Secondly, a strategy of pruning nodes is presented, which is based on the radius of a node’s inscribed ball. Thirdly, separate branches of broken neuron reconstructions can be merged into a single tree. FMST and many other state of the art reconstruction methods were implemented on two datasets: 120 Drosophila neurons and 163 neurons with gold standard reconstructions. Qualitative and quantitative analysis on experimental results demonstrates that the performance of FMST is good compared with many existing methods. Especially, on the 91 fruitfly neurons with gold standard and evaluated by five metrics, FMST is one of two methods with best performance among all 27 state of the art reconstruction methods. FMST is a good and practicable neuron reconstruction algorithm, and can be implemented in Vaa3D platform as a neuron tracing plugin.
KeywordsNeuron reconstruction Neuron morphology Minimum spanning tree Fast marching
The authors thank the BigNeuron community for providing the data and the discussions, especially Dr. Zhi Zhou at Allen Institute for Brain Science. This work is partially supported by the National Basic Research Program of China (No. 2014CB744600), National Natural Science Foundation of China (No. 61420106005), and Beijing Natural Science Foundation (No. 4164080).
- Gala, R. B., Chapeton, J., Jitesh, J., Bhavsar, C., Stepanyants, A. (2014). Active learning of neuron morphology for accurate automated tracing of neuritis. Frontiers in Neuroanatomy, 8.Google Scholar
- Halavi, M., Hamilton, K. A., Parekh, R., Ascoli, G.A. (2012). Digital reconstructions of neuronal morphology: three decades of research trends. Frontiers in neuroscience, 6.Google Scholar
- Sethian, J. (1999). Level set methods and fast marching methods: evolving interfaces in computational geometry, fluid mechanics, computer vision, and materials science. In Cambridge Monographs on Applied and Computational Mathematics. Cambridge: Cambridge University Press.Google Scholar
- Zhou, Z., Sorensen, S., Peng, H. (2015). Neuron crawler: an automatic tracing algorithm for very large neuron images. In: IEEE 2015 International Symposium on Biomedical Imaging: From Nano to Macro, pp. 870–874.Google Scholar
- Zhou, Z., Kuo, H.-C., Peng, H., Long, F. (2018). DeepNeuron: an open deep learning toolbox for neuron tracing. bioRxiv:254318.