AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Biologically-Constrained Graphs for Global Connectomics Reconstruction

Brian Matejek, Daniel Haehn, Haidong Zhu, Donglai Wei, Toufiq Parag, Hanspeter Pfister

CVPR 2019 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 31 citations (OpenAlex)

Check your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply biologically constrained graph construction and global partitioning to the input segmentationConnectome reconstruction pipeline · PNI Test OneTotal VI: 0.491 -> 0.388; -20.9%Improved
Apply biologically constrained graph construction and global partitioning to the input segmentationConnectome reconstruction pipeline · PNI Test TwoTotal VI: 0.416 -> 0.297; -28.7%Improved
Apply biologically constrained graph construction and global partitioning to the input segmentationConnectome reconstruction pipeline · Kasthuri TestTotal VI: 0.965 -> 0.815; -15.6%Improved
Apply biologically constrained graph construction and global partitioning to the input segmentationConnectome reconstruction pipeline · SNEMI3DTotal VI: 0.807 -> 0.647; -19.8%Improved
Add morphology-based node generation for merging small segments (ablation)Biologically-Constrained Graphs · PNI Test OneCorrect small-segment merges: 305 / 521 (36.9%) -> 686 / 169 (80.2%)Improved
Add morphology-based node generation for merging small segments (ablation)Biologically-Constrained Graphs · PNI Test TwoCorrect small-segment merges: 185 / 281 (39.7%) -> 444 / 75 (85.5%)Improved
Add morphology-based node generation for merging small segments (ablation)Biologically-Constrained Graphs · Kasthuri TestCorrect small-segment merges: 4,514 / 4,090 (52.5%) -> 6,623 / 2,020 (76.6%)Improved
Add skeleton endpoint and geometric constraints to prune candidate edges (ablation)Biologically-Constrained Graphs · PNI Test OneCandidate edges: 528 / 25,619 -> 417 / 10,074; 79.0% / 39.3%Improved
Add skeleton endpoint and geometric constraints to prune candidate edges (ablation)Biologically-Constrained Graphs · PNI Test TwoCandidate edges: 460 / 30,388 -> 370 / 11,869; 80.4% / 39.1%Improved
Add skeleton endpoint and geometric constraints to prune candidate edges (ablation)Biologically-Constrained Graphs · Kasthuri TestCandidate edges: 1,193 / 43,951 -> 936 / 18,168; 78.5% / 41.3%Improved
Add global graph optimization instead of greedy local agglomeration (ablation)Biologically-Constrained Graphs · PNI Test OneVI Merge: 0.127 -> 0.115; -9.4%Improved
Add global graph optimization instead of greedy local agglomeration (ablation)Biologically-Constrained Graphs · PNI Test TwoVI Merge: 0.127 -> 0.097; -23.6%Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy