CoChat

Precise segmentation of densely interweaving neuron clusters using G-Cut

Open access

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

Abstract

Characterizing the precise three-dimensional morphology and anatomical context of neurons is crucial for neuronal cell type classification and circuitry mapping. Recent advances in tissue clearing techniques and microscopy make it possible to obtain image stacks of intact, interweaving neuron clusters in brain tissues. As most current 3D neuronal morphology reconstruction methods are only applicable to single neurons, it remains challenging to reconstruct these clusters digitally. To advance the state of the art beyond these challenges, we propose a fast and robust method named G-Cut that is able to automatically segment individual neurons from an interweaving neuron cluster. Across various densely interconnected neuron clusters, G-Cut achieves significantly higher accuracies than other state-of-the-art algorithms. G-Cut is intended as a robust component in a high throughput informatics pipeline for large-scale brain mapping projects.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41467-019-09515-0

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 A workflow for automated reconstruction of individual neurons from a neuron cluster. a An image stack with a densely labeled neuron cluster is obtained with appropriate tissue preparation and imaging techniques (e.g., confocal microscopy, multiphoton microscopy on clarified tissue, etc.). b An existing tracing method (e.g., NeuronStudio software) is applied to obtain an unsegmented reconstruction of the neural cluster as shown in c. G-Cut is applied to the unsegmented reconstruction. Resulting individual neurons are shown with distinct colors as shown in d. e and f show enlarged view of two reconstructed single neurons corresponding to the orange boxes in d. g shows segmentation result of G-Cut on four reconstructed neuron clusters. Initial unsegmented neuron clusters were reconstructed from experimental image stacks with APP2 algorithm in Vaa3D software. The result shows that G-Cut can be applied on clusters with numerous neurons
Fig. 1 A workflow for automated reconstruction of individual neurons from a neuron cluster. a An image stack with a densely labeled neuron cluster is obtained with appropriate tissue preparation and imaging techniques (e.g., confocal microscopy, multiphoton microscopy on clarified tissue, etc.). b An existing tracing method (e.g., NeuronStudio software) is applied to obtain an unsegmented reconstruction of the neural cluster as shown in c. G-Cut is applied to the unsegmented reconstruction. Resulting individual neurons are shown with distinct colors as shown in d. e and f show enlarged view of two reconstructed single neurons corresponding to the orange boxes in d. g shows segmentation result of G-Cut on four reconstructed neuron clusters. Initial unsegmented neuron clusters were reconstructed from experimental image stacks with APP2 algorithm in Vaa3D software. The result shows that G-Cut can be applied on clusters with numerous neuronsCC BY · PubMed Central
Fig. 2 G-Cut performs automatic segmentation based on biological features and graph theory. a The original graph representation of a neuron cluster consists of branches and somas. Each branch starts at one topological node, and ends at another topological node (soma nodes shown as blue, branch nodes shown as green, leaf nodes shown as yellow, path nodes shown as magenta, and edges between nodes shown as solid line). b The Growth Orientation Feature (GOF) quantifies the orientation of a branch with respect to a soma. Blue node: soma. Green node: branch node. Yellow node: leaf node. Red node: path node. c Left-hand panel shows an example histogram of the GOF for more than 70,000 experimentally reconstructed neuronal morphologies from the NeuroMorpho.Org database. Right-hand panel shows cumulative distribution function of the GOF derived from its histogram. d We identify bridging branches between somas and establish their topological relations by constructing a directed acyclic graph (DAG) rooted at a given soma using the Dijkstra algorithm. The branches which are reachable from only one soma are excluded with a Breadth-first search algorithm in preprocessing to reduce problem size. The direction of each branch and its path from the soma are established in this step (direction of each branch shown as blue arrow). After that, the linear programming algorithm is used to find a globally optimal segmentation for the neuron cluster
Fig. 2 G-Cut performs automatic segmentation based on biological features and graph theory. a The original graph representation of a neuron cluster consists of branches and somas. Each branch starts at one topological node, and ends at another topological node (soma nodes shown as blue, branch nodes shown as green, leaf nodes shown as yellow, path nodes shown as magenta, and edges between nodes shown as solid line). b The Growth Orientation Feature (GOF) quantifies the orientation of a branch with respect to a soma. Blue node: soma. Green node: branch node. Yellow node: leaf node. Red node: path node. c Left-hand panel shows an example histogram of the GOF for more than 70,000 experimentally reconstructed neuronal morphologies from the NeuroMorpho.Org database. Right-hand panel shows cumulative distribution function of the GOF derived from its histogram. d We identify bridging branches between somas and establish their topological relations by constructing a directed acyclic graph (DAG) rooted at a given soma using the Dijkstra algorithm. The branches which are reachable from only one soma are excluded with a Breadth-first search algorithm in preprocessing to reduce problem size. The direction of each branch and its path from the soma are established in this step (direction of each branch shown as blue arrow). After that, the linear programming algorithm is used to find a globally optimal segmentation for the neuron clusterCC BY · PubMed Central
Fig. 3 GOF distributions obtained from public datasets available on the NeuroMorpho.Org website. Neurons are cataloged by species or by brain regions. a GOF distribution of each species contains more than one thousand neurons (excluding C. elegans which only has 424 neurons in total). b GOF distribution of each brain region contains more than one thousand neurons. Kullback-Leibler divergence was performed on different species and different brain regions, respectively
Fig. 3 GOF distributions obtained from public datasets available on the NeuroMorpho.Org website. Neurons are cataloged by species or by brain regions. a GOF distribution of each species contains more than one thousand neurons (excluding C. elegans which only has 424 neurons in total). b GOF distribution of each brain region contains more than one thousand neurons. Kullback-Leibler divergence was performed on different species and different brain regions, respectivelyCC BY · PubMed Central
Fig. 4 Segmentation accuracy of G-Cut on a simulated neuron cluster. a A simulated neuron cluster (left panel) and segmentation result (right panel). Each segmented neuron is given a unique color for easier visualization. b Comparison between each original neuron (left) and segmented neuron (right). The neurons are rotated for more effective visual presentation. Rendering is done with neuTube software
Fig. 4 Segmentation accuracy of G-Cut on a simulated neuron cluster. a A simulated neuron cluster (left panel) and segmentation result (right panel). Each segmented neuron is given a unique color for easier visualization. b Comparison between each original neuron (left) and segmented neuron (right). The neurons are rotated for more effective visual presentation. Rendering is done with neuTube softwareCC BY · PubMed Central
Fig. 5 Evaluating the segmentation accuracy of G-Cut on simulated neuron clusters. a Segmentation accuracy of G-Cut compared to NeuroGPS-tree and TREES toolbox on different scales of simulated neuron clusters (sample size: 100 neuron clusters for each scale). Mann–Whitney U tests with Benjamini-Hochberg correction show that G-Cut has consistently higher accuracy (p < 0.01) across all scales of clusters. b The probability distribution of degree of entanglement in randomly generated neuron clusters with a fixed cluster scale of six. c Segmentation accuracy of G-Cut compared to NeuroGPS-Tree and TREES toolbox on simulated neuron clusters with different degrees of entanglement (sample size: 100 neuron clusters for each degree of entanglement). The MES result of G-Cut is consistently higher than both NeuroGPS-TREE and TREES toolbox at all degrees of entanglement (p < 0.01, Mann–Whitney U test with Benjamini-Hochberg correction). Source data are provided as a Source Data file
Fig. 5 Evaluating the segmentation accuracy of G-Cut on simulated neuron clusters. a Segmentation accuracy of G-Cut compared to NeuroGPS-tree and TREES toolbox on different scales of simulated neuron clusters (sample size: 100 neuron clusters for each scale). Mann–Whitney U tests with Benjamini-Hochberg correction show that G-Cut has consistently higher accuracy (p < 0.01) across all scales of clusters. b The probability distribution of degree of entanglement in randomly generated neuron clusters with a fixed cluster scale of six. c Segmentation accuracy of G-Cut compared to NeuroGPS-Tree and TREES toolbox on simulated neuron clusters with different degrees of entanglement (sample size: 100 neuron clusters for each degree of entanglement). The MES result of G-Cut is consistently higher than both NeuroGPS-TREE and TREES toolbox at all degrees of entanglement (p < 0.01, Mann–Whitney U test with Benjamini-Hochberg correction). Source data are provided as a Source Data fileCC BY · PubMed Central
Fig. 6 Performance of G-Cut, NeuroGPS-tree and TREES toolbox on densely connected neurons. a The raw image stack. Data size: 1024 × 1024 × 500 voxels. b A neuron cluster was automatically reconstructed from the image stack by NeuronStudio software. The neuron cluster contained 108 spurious links in total. Some representative spurious links were marked in yellow circles. c Sixteen neurons were manually reconstructed from the raw image stack with neuTube software and used as ground truth. d–f The neuron cluster in b was segmented into individual neurons by G-Cut, NeuroGPS-tree and TREES toolbox, respectively. Identical post-processing was used on segmentation results from all three algorithms (see Supplementary Fig. 7 and Supplementary Note 2). g Miss-Extra-Scores of the sixteen neurons reconstructed by G-Cut, NeuroGPS-Tree and TREES toolbox. The MES was obtained by comparing an automatic reconstruction result with the manual reconstruction result of each neuron. The red line represents median MES. Source data are provided as a Source Data file
Fig. 6 Performance of G-Cut, NeuroGPS-tree and TREES toolbox on densely connected neurons. a The raw image stack. Data size: 1024 × 1024 × 500 voxels. b A neuron cluster was automatically reconstructed from the image stack by NeuronStudio software. The neuron cluster contained 108 spurious links in total. Some representative spurious links were marked in yellow circles. c Sixteen neurons were manually reconstructed from the raw image stack with neuTube software and used as ground truth. d–f The neuron cluster in b was segmented into individual neurons by G-Cut, NeuroGPS-tree and TREES toolbox, respectively. Identical post-processing was used on segmentation results from all three algorithms (see Supplementary Fig. 7 and Supplementary Note 2). g Miss-Extra-Scores of the sixteen neurons reconstructed by G-Cut, NeuroGPS-Tree and TREES toolbox. The MES was obtained by comparing an automatic reconstruction result with the manual reconstruction result of each neuron. The red line represents median MES. Source data are provided as a Source Data fileCC BY · PubMed Central
Fig. 7 Validation of G-Cut, NeuroGPS-tree and TREES toolbox on a large number of neurons. a The raw Golgi-cox staining image stack. Data size: 8192 × 2048 × 46 voxels. b Forty-five neurons were manually reconstructed using neuTube software and used as ground truth. c Neuron clusters were reconstructed from the image stack by automatic tracing methods in NeuronStudio software. The neuron clusters contained 169 spurious links in total. d–f The neuron clusters in c were segmented by G-Cut, NeuroGPS-tree and TREES tool box into 45 individual neurons, respectively. Identical post-processing was applied to results from all three algorithms to fix tracing errors and prune redundant branches (see Supplementary Fig. 7 and Supplementary Note 2). g Miss-Extra-Scores of the forty-five neurons segmented by G-Cut, NeuroGPS-Tree, and TREES toolbox. Source data are provided as a Source Data file
Fig. 7 Validation of G-Cut, NeuroGPS-tree and TREES toolbox on a large number of neurons. a The raw Golgi-cox staining image stack. Data size: 8192 × 2048 × 46 voxels. b Forty-five neurons were manually reconstructed using neuTube software and used as ground truth. c Neuron clusters were reconstructed from the image stack by automatic tracing methods in NeuronStudio software. The neuron clusters contained 169 spurious links in total. d–f The neuron clusters in c were segmented by G-Cut, NeuroGPS-tree and TREES tool box into 45 individual neurons, respectively. Identical post-processing was applied to results from all three algorithms to fix tracing errors and prune redundant branches (see Supplementary Fig. 7 and Supplementary Note 2). g Miss-Extra-Scores of the forty-five neurons segmented by G-Cut, NeuroGPS-Tree, and TREES toolbox. Source data are provided as a Source Data fileCC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 33 references

Cited by

See all 57

Metadata

Authors
Li, R., Zhu, M., Li, J., Bienkowski, M. S., Foster, N. N., Xu, H., Ard, T., Bowman, I., Zhou, C., Veldman, M. B., Yang, X. W., Hintiryan, H., Zhang, J., & Dong, H.-W.
Affiliations
  • University of Southern California (US)
  • Xiamen University (CN)
  • University of California, Los Angeles (US)
Corresponding author
  • Zhang, Junsong
  • Dong, Hong-Wei
Venue
Nature Communications
Published
2019-04-04
Volume
10
Issue
1
Pages
1549-1549
ISSN
2041-1723 (ISSN-L)
OpenAlex
W2925806435
Cited by
57
References
32
Citations by year
2026: 5 · 2025: 9 · 2024: 10 · 2023: 5 · 2022: 10 · 2021: 10 · 2020: 5 · 2019: 2
FWCI
3.26
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature Communications (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • National Natural Science Foundation of China (2013CB329502, 61772440)
  • China Scholarship Council
  • Xiamen University
  • National Institutes of Health
  • National Key Research and Development Program of China (2013CB329502)
  • National Institute of Mental Health (MH094360, U01MH106008, R01MH094360, MH094360-01A1)
  • National Cancer Institute (U01CA198932)
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 › Advanced Neural Network Applications
Keywords
neuron segmentation, graph cuts
MeSH terms
Algorithms, Brain Mapping, Computer Simulation, Models, Theoretical, Nerve Net, Neurons, Computational Biology

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: Precise segmentation of densely interweaving neuron clusters using G-Cut. https://app.cochat.ai/papers/10.1038/s41467-019-09515-0
The paper
Li, R., Zhu, M., Li, J., Bienkowski, M. S., Foster, N. N., Xu, H., Ard, T., Bowman, I., Zhou, C., Veldman, M. B., Yang, X. W., Hintiryan, H., Zhang, J., & Dong, H.-W. (2019). Precise segmentation of densely interweaving neuron clusters using G-Cut. Nature Communications. https://doi.org/10.1038/s41467-019-09515-0

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.