- Rating
- 4
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LCPReg, a displacement-field representation designed for pair-wise and test-time instance optimization in 3D image registration. A coarse displacement field is refined through learnable, locally connected upsampling layers with separably factorized kernels. The method also introduces an approximate B-spline initialization and a Laplacian-pyramid warm start that exactly reproduces an existing displacement estimate before optimization. Integrations into NODEO, convexAdam, and uniGradICON demonstrate consistent Dice improvements on OASIS, CANDI, and EMPIRE10, with substantial reductions in optimization time for the NODEO and uniGradICON settings.
Critical strengths
-
A clear and practically relevant contribution to instance optimization. The paper addresses whether representations designed for amortized prediction are necessarily suitable for refining a single image pair. Its focus on the displacement parameterization, rather than another large registration backbone, is well motivated.
-
Consistent empirical benefits across different optimization frameworks. LCP improves Dice in all nine framework–dataset combinations. The integrations retain the corresponding registration objectives and match optimization iteration counts, making these within-framework comparisons particularly informative.
-
Substantial computational benefits in the most expensive refinement settings. The reported runtime decreases from 66.10 to 23.13 seconds when replacing the NODEO representation, and from 68.08 to 9.67 seconds in the uniGradICON integration. These reductions accompany improved Dice rather than an accuracy sacrifice.
Critical weaknesses
1. The lung evaluation would be stronger with landmark-based correspondence measurements.
EMPIRE10 is evaluated using segmentation Dice, with HD95 provided in the appendix, but no landmark-based target registration error is reported(If I remember correctly, the dataset provides landmarks). Since the method is intended to improve local deformation refinement, landmark-based evaluation would provide a more direct test of this capability in the lung setting and complement the already high Dice scores.
2. Small performance differences require paired statistical analysis.
Some improvements are modest, particularly the EMPIRE10 Dice increase from 0.9820 to 0.9826 for the uniGradICON integration. Appropriate paired tests, such as a paired t-test, would help distinguish consistent gains from case-level variability.
Questions for authors
-
Can you provide landmark-based evaluation for the lung registration task?
-
Are the smaller improvements statistically supported in paired comparisons?
-
What additional advantage does the full Laplacian warm start provide over the finest-level-only alternative?
-
What are the end-to-end runtime and memory requirements of each integration?
4 comments
Q4. End-to-end runtime and memory
(Q4) What are the end-to-end runtime and memory requirements of each integration?
We added Table 3 (new), which reports the time of the initial prediction (Base), the optimization time (Opt.), and GPU memory requirements during optimization. The times in Table 1 are the end-to-end totals (Base + Opt.).
| Method | Base (s) | Opt. (s) | Total (s) | Peak memory |
|---|---|---|---|---|
| NODEO | – | 66.10 | 66.10 | 2.53 GB |
| LCPReg-opt (Ours) | – | 23.13 | 23.13 | 2.69 GB |
| convexAdam-MIND | 0.01 | 3.03 | 3.04 | 3.84 GB |
| LCPReg-conv (Ours) | 0.01 | 3.36 | 3.37 | 5.58 GB |
| uniGradICON (w/ IO) | 0.35 | 67.73 | 68.08 | 12.77 GB |
| LCPReg-uGI (Ours) | 0.35 | 9.32 | 9.67 | 7.62 GB |
In the uniGradICON integration, LCP reduces end-to-end time by 86% and peak memory by 40%, since backpropagation no longer passes through the U-Net cascade. In the NODEO integration, it reduces time by 65% at a 6% higher memory footprint. In convexAdam, which already optimizes a dense field directly, LCP adds roughly 0.33 seconds of optimization time per pair and requires around 45% more GPU memory.
We thank the reviewer again for the constructive suggestions, which we believe have strengthened the evaluation of our work.
I thank the authors for the additional experiments. My concerns have been addressed, and I will maintain my original score.
We sincerely thank the reviewer for the time investment in assessing our work and rebuttal. We are glad that our response addressed your concerns!
We thank the reviewer for the positive assessment and for recognizing the relevant contributions of our work. We address each of your concerns point-by-point below.
W1 / Q1. The lung evaluation would be stronger with landmark-based correspondence measurements.
We agree that landmark-based correspondence is a more direct test of local refinement than whole-lung Dice, which is close to saturation on EMPIRE10. However, because we were not able to acquire the landmark annotations originally used in the EMPIRE10 challenge, we instead evaluated all three integrations on two additional lung CT datasets with publicly available landmark annotations: NLST (landmarks and keypoints) and DirLab-4DCT (landmarks). For ease of readability, we have provided these results in the table in our general comment, or they can be viewed in Table 2 (new) in our revised manuscript. LCP reduces landmark TRE in all six framework–dataset combinations.
W2 / Q2. Small performance differences require paired statistical analysis.
As requested, we provide a paired t-test for the EMPIRE10 uniGradICON comparison:
"p(corrected)" refers to Holm–Bonferroni corrected p-values and "d_z" is paired-samples Cohen’s d.
Although small, the increase in Dice is statistically significant, while the improvement in Neg. JD is not. For reference, we also provide the paired t-test for the OASIS uniGradICON comparison:
Q3. Advantage of the full Laplacian warm start over the finest-level-only alternative
We agree that the accuracy difference is negligible; the reason we keep the full warm start is that it is the only variant that initializes the pyramid in a state consistent with its intended optimization dynamics. Seeding only the coarse field u(L) discards detail below h(L) and lowers Dice to 0.8007. Seeding only the finest level preserves u^, but leaves every intermediate level u(ℓ) at zero. Since the gradient with respect to each kernel weight is proportional to u(ℓ)(q) (Eq. 15), the kernels then receive no gradient at the start of optimization, and the prior is held entirely in a fixed residual that the kernels cannot adapt. The full warm start sets u(ℓ)=D(ℓ)u^ at every level, so the adaptive term of the tangent kernel (Eq. 18) is active from the first iteration and concentrates kernel adaptation where the prior model predicts motion. This matters most in short instance optimization schedules such as uniGradICON's 50 iterations. Empirically, it also yields less folding (3.4e-3% vs 4.9e-3%) at no additional cost (9.67 s vs 9.65 s).