CoChat

FMST: an Automatic Neuron Tracing Method Based on Fast Marching and Minimum Spanning Tree

Yang, Jian, Hao, Ming, Liu, Xiaoyang, Wan, Zhijiang, Zhong, Ning, Peng, Hanchuan · 2019 · Neuroinformatics

The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.

Abstract

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.

Overview

Integrity signals

Registry

Crossref · 10.1007/s12021-018-9392-y

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 34 references

Research works printed but not linked: 1

  1. Zhou, Z., Kuo, H.-C., Peng, H., Long, F. (2018). DeepNeuron: an open deep learning toolbox for neuron tracing. bioRxiv: 254318 .

Cited by

See all 53

Metadata

Authors
Yang, J., Hao, M., Liu, X., Wan, Z., Zhong, N., & Peng, H.
Affiliations
  • Beijing University of Technology (CN)
  • Maebashi Institute of Technology (JP)
  • Allen Institute for Brain Science (US)
Corresponding author
  • Zhong, Ning
  • Peng, Hanchuan
Venue
Neuroinformatics
Published
2018-07-23
Volume
17
Issue
2
Pages
185-196
ISSN
  • 1539-2791 (ISSN-L)
  • 1559-0089
OpenAlex
W2884739365
Cited by
53
References
34
Citations by year
2026: 2 · 2025: 5 · 2024: 1 · 2023: 7 · 2022: 6 · 2021: 12 · 2020: 14 · 2019: 6
FWCI
4.17
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Neuroinformatics (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Basic Research Program of China (No. 2014CB744600)
  • National Natural Science Foundation of China (No. 61420106005)
  • Natural Science Foundation of Beijing Municipality (CN) (No. 4164080)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Biophysics › Cell Image Analysis Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Medical Image Segmentation Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Image Processing Techniques
Keywords
neuron reconstruction, neural tracing, minimum spanning tree, fast marching method, edge weights, node pruning, Drosophila neurons, computational neuroscience
MeSH terms
Algorithms, Animals, Humans, Neurons, Neurosciences, Imaging, Three-Dimensional

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: FMST: an Automatic Neuron Tracing Method Based on Fast Marching and Minimum Spanning Tree. https://app.cochat.ai/papers/10.1007/s12021-018-9392-y
The paper
Yang, J., Hao, M., Liu, X., Wan, Z., Zhong, N., & Peng, H. (2019). FMST: an Automatic Neuron Tracing Method Based on Fast Marching and Minimum Spanning Tree. Neuroinformatics. https://doi.org/10.1007/s12021-018-9392-y

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.