atlas

Research map / Graph learning / Graph self-supervised learning

GraphMorph: Tubular Structure Extraction by Morphing Predicted Graphs

NeurIPS 2024 · Graph learning › Graph self-supervised learning · approach: Multi-view graph clustering · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes GraphMorph, which predicts a branch-level graph of a tubular structure with a Deformable DETR-based Graph Decoder and morphs it into a topologically accurate centerline mask via a training-free SkeletonDijkstra Morph Module, plus a post-processing step that reduces segmentation false positives.

Problem

Pixel-level segmentation of tubular structures (vessels, roads) often yields broken branches, redundant branches, and topological errors, because it does not explicitly model branch-level topology.

Approach

Predict nodes (junctions and endpoints) with a modified Deformable DETR and edges with a dynamic condition-linear-layer link predictor, then find minimum-cost single-pixel-width paths between connected nodes on the centerline probability map so the output centerline mask matches the predicted graph's topology; the graph decoder also serves as auxiliary training supervision.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add the Graph Decoder during training (ablation)UNet with softDice for centerline extraction · DRIVEβ0 error: 2.169 ± 0.112 -> 1.552 ± 0.094Helped
Add the Morph Module at inference (ablation)UNet with softDice + Graph Decoder for centerline extraction · DRIVEβ0 error: 1.552 ± 0.094 -> 0.555 ± 0.038Helped
Add the Morph Module at inference (ablation)UNet with softDice + Graph Decoder for centerline extraction · DRIVEDice: 0.7506 ± 0.0127 -> 0.7496 ± 0.0118Hurt
Add GraphMorph and segmentation post-processingUNet with softDice · DRIVEβ0 error: 1.191 ± 0.069 -> 0.692 ± 0.047Helped
Add GraphMorph and segmentation post-processingUNet with softDice · ISBI12β0 error: 0.569 ± 0.046 -> 0.361 ± 0.034Helped
Add GraphMorph and segmentation post-processingUNet with softDice · STAREDice: 0.8170 ± 0.0402 -> 0.8210 ± 0.0464Mixed
Add GraphMorph and segmentation post-processingUNet with softDice · MassRoadβ0 error: 0.479 ± 0.020 -> 0.386 ± 0.016Helped
Add GraphMorph and segmentation post-processing3D UNet with softDice · PARSEDice: 0.7968 ± 0.0166 -> 0.8196 ± 0.0138Helped
Use the Dynamic link prediction module instead of the [rln]-tokenGraphMorph · DRIVE centerline extractioninference time (s): 0.2823 -> 0.1582Helped
Use the Dynamic link prediction module instead of the [rln]-tokenGraphMorph · STARE centerline extractioninference time (s): 0.1385 -> 0.0754Helped
Set ROI size to H=32 rather than reducing it (ablation)GraphMorph on DRIVE · DRIVE centerline extractionβ0 errorHelped
Set the Morph Module path threshold to p_thresh = 0.5 (ablation)GraphMorph centerline extraction · Centerline extractiontopological metricsHelped

Surprising findings

Limitations

Experimental setup

Datasets: DRIVE STARE ISBI12 MassRoad PARSE

Benchmarks: DRIVE STARE ISBI12 MassRoad PARSE

Metrics: Dice clDice AUC ACC beta0 error beta1 error chi error ARI VOI

Baselines: softDice clDice PointScatter TopoLoss DSCNet TransUNet DC-UNet LinkNet34 D-Linknet34

Builds on: Deformable DETR Dijkstra algorithm clDice PointScatter RelationFormer

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