Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 218

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

Large Scale Image Segmentation with Structured Loss Based Deep Learning for Connectome Reconstruction

Open access
Funke, Jan, Tschopp, Fabian, Grisaitis, William, Sheridan, Arlo, Singh, Chandan, Saalfeld, Stephan, Turaga, Srinivas C. · 2019 · IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

We present a method combining affinity prediction with region agglomeration, which improves significantly upon the state of the art of neuron segmentation from electron microscopy (EM) in accuracy and scalability. Our method consists of a 3D U-Net, trained to predict affinities between voxels, followed by iterative region agglomeration. We train using a structured loss based on Malis, encouraging topologically correct segmentations obtained from affinity thresholding. Our extension consists of two parts: First, we present a quasi-linear method to compute the loss gradient, improving over the original quadratic algorithm. Second, we compute the gradient in two separate passes to avoid spurious gradient contributions in early training stages. Our predictions are accurate enough that simple learning-free percentile-based agglomeration outperforms more involved methods used earlier on inferior predictions. We present results on three diverse EM datasets, achieving relative improvements over previous results of 27, 15, and 250 percent. Our findings suggest that a single method can be applied to both nearly isotropic block-face EM data and anisotropic serial sectioned EM data. The runtime of our method scales linearly with the size of the volume and achieves a throughput of $\sim$∼ 2.6 seconds per megavoxel, qualifying our method for the processing of very large datasets.

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.1109/tpami.2018.2835450

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

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

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

Research works printed but not linked: 14

  1. 10.2307/2033241 · doi:10.2307/2033241 · Paper page
  2. coelho, 2013, Mahotas: Open source software for scriptable computer vision, Journal of Open Research Software, 1
  3. 10.1016/j.ymeth.2016.12.013 · DOI
  4. 10.1016/j.neuron.2015.09.003 · DOI
  5. 10.1038/nmeth.2072 · DOI · Paper page
  6. zlateski, 2015, Image segmentation by size-dependent single linkage clustering of a watershed basin graph, CoRR, abs 1505 249
  7. januszewski, 2016, Flood-filling networks, CoRR, abs 1611 421
  8. maitin-shepard, 2016, Combinatorial energy learning for image segmentation, Proc Advances Neural Inf Process Syst, 1966
  9. 10.1007/978-3-642-33712-3_56 · DOI
  10. 10.3389/fninf.2014.00034 · DOI
  11. 10.1038/nmeth.4151 · DOI · Paper page
  12. 10.1109/ICCV.2015.204 · DOI
  13. briggman, 2009, Maximin affinity learning of image segmentation, Proc Advances Neural Inf Process Syst, 1865
  14. 10.1109/ICCV.2017.222 · DOI

Cited by

See all 218

Metadata

Authors
Funke, J., Tschopp, F., Grisaitis, W., Sheridan, A., Singh, C., Saalfeld, S., & Turaga, S. C.
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2019-07-01
Volume
41
Issue
7
Pages
1669-1680
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W2803790834
Cited by
218
References
4
FWCI
10.29
Type
journal article
Language
en
Open access
bronze
Funders
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (P2EZP2_165241)

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

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.