- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes Counterfactual Logit Debiasing (CLD) for unsupervised domain-adaptive cardiac segmentation. A U-Net structure branch produces per-pixel features; a domain branch fuses pooled image features with a learnable domain embedding into a global context vector. A shared head computes factual logits from observed features and counterfactual logits from a broadcast running-mean structural vector under the same context; their difference, inspired by the total direct effect (TDE), forms the final prediction. On bSSFP→LGE (MS-CMRSeg) and CT→MR (MMWHS), CLD reports mean Dice of 0.823 and 0.778, exceeding SLCL by 0.7 and 1.7 points.
Critical strengths
- It requires no image translation or multi-stage training and leaves the segmentation backbone unchanged. It is cheap and architecture-agnostic, and would be easy to adopt in existing UDA pipelines. This is the main practical argument for the method.
Critical weaknesses
-
The counterfactual branch does not perform the claimed structural debiasing. The counterfactual input is spatially constant. Any convolutional or pixel-wise head therefore yields a spatially constant L_cf that carries no image-specific structure. The paper never defines TDE and never tests the mechanism. It gives no analysis of L_cf, no domain probes of X and Z, and no comparison with a learnable class bias or with logit adjustment.
-
The experiments do not reliably establish an improvement over prior work. All results come from single runs, with no variance estimates or significance tests.
Questions for authors
-
Please specify f_seg. Because [F̄_loc; Z̃] is spatially constant, any convolutional or pixel-wise head yields a spatially constant L_cf, so L_TDE equals L_fact minus a per-image, per-class offset; with a linear head, Z cancels and inference reduces to a single-branch U-Net.
-
The target consistency term ||p_fact − p_TDE||_1 vanishes only when L_cf is constant across classes, i.e., when the counterfactual subtraction changes nothing. How do you reconcile this with the debiasing rationale? Does the term help mainly by sharpening L_fact, as an additional entropy-like regularizer?
-
Please define which local vectors enter the running mean X̄ (source, target or both; background included?), whether you stop gradients through it, and how you initialize it. Please also define Φ^TDE (Eq. 5) and the domain classifier (pixel-wise or image-level).
-
All baseline values in Table 1 and the baseline row of Table 2 match Gu et al. (MICCAI 2024) to the reported precision. Are they taken from it? If so, please state this, confirm identical splits, folds, preprocessing and backbone, and report your own source-only baseline. How did you obtain the SLCL predictions in Figures 4–5, and if you re-ran SLCL, what scores did it achieve?
-
Do all results come from single runs? Please report mean ± standard deviation over at least three seeds and paired per-volume tests against SLCL, since the margins are 0.7–1.7 DSC points. Please also report per-class DSC and HD95 for both tasks.
-
MMWHS uses 25 MR volumes “with automatically generated masks” for training-data augmentation. Do these target-domain masks enter any loss? If so, the setting is not unsupervised. Please also state whether you compute DSC per slice or per volume, which spacing converts HD95 to mm after resizing.
-
Please provide evidence for the claimed mechanism: visualize L_fact, L_cf and L_TDE on target images; probe how much domain information X and Z each contain.