- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a coarse-to-fine method for 3D coronary reconstruction from segmented X-ray views with known acquisition geometry. It uses frozen VGGT features to predict branch existence, B-spline control points, and radii, followed by projection-guided geometry and radius refinement. Experiments use simulated projections, with additional qualitative examples on real angiography.
Critical strengths
The method provides centrelines and radii through a compact representation that keeps each branch connected. It also shows promising results compared with the tested baselines.
Critical weaknesses
The contribution and cost of the proposed design need stronger evidence. Runtime comparisons do not include other VGGT-based methods, and Table 6 does not report runtime for the backbone variants. The tables also show that most gains come from geometry refinement, but the paper does not test whether a refiner trained from a simple initial shape can achieve similar accuracy without the coarse predictor. Such a comparison, including runtime, is needed to establish whether the coarse predictor is necessary.
The method and results are not described in enough detail. Section 3.3 does not specify which VGGT layer provides the features, Section 3.5 omits loss-weight values, and the differentiable rendering implementation remains unclear. Table 5 also does not make clear whether both variants include radius refinement. These gaps make the method harder to reproduce and the results harder to verify.
Questions for authors
What is the accuracy and runtime trade-off between the VGGT and ResNet-101 variants? Does the reported 121 ms include VGGT feature extraction, and how much time does that step take?
Are there other VGGT-based methods that could be compared under the same input and output settings? If so, why were they not included in the accuracy and runtime comparisons?
Can a refiner trained from a simple initial shape achieve similar accuracy without the coarse predictor, using the same image features? Please compare accuracy and runtime.
Which VGGT module and layers provide the features? Please also give the loss-weight values and explain how differentiable rendering is implemented.
Do both variants in Table 5 include radius refinement? What are the radius errors before and after refinement?
We thank the reviewer. We have added backbone timing, a template-initialisation ablation, implementation details, and radius-error evaluation. The original Tables 5 and 6 are now Tables 6 and 7. CD denotes branch-level Chamfer distance; CC count is the number of connected components.
Weakness 1 and Question 1: Backbone accuracy and runtime
Table 7 reports accuracy after geometry and radius refinement. The timings below include online feature extraction and coarse prediction, using two masks on one RTX 4090 (Table 10; lines 826–833).
VGGT improves refined Dice by 6.30 for RCA and 4.26 for LCA, at approximately 55 ms additional coarse-stage cost.
Yes, the reported 121 ms includes online VGGT extraction: 58.1 ms for VGGT, 1.9 ms for coarse prediction, 14 ms for geometry refinement, and 47 ms for radius refinement (lines 1387–1392).
Weakness 1 and Question 2: Other VGGT-based methods
Related approaches include VGGT-Occ (arXiv:2605.16911) and VGOcc (arXiv:2607.18078). Like ours, they use frozen VGGT features with calibrated multi-view images, but target occupancy prediction in RGB driving scenes rather than coronary reconstruction. A meaningful comparison would require adapting and retraining these methods for projected artery masks, which we have not completed within the rebuttal period. As volumetric predictors, they would also need the same centreline extraction as AutoCAR and DeepCA, which we already compare against.
Our controlled backbone comparison isolates VGGT’s contribution within our framework. Even with ResNet-101, the refined model has lower branch-level CD and CC counts than the evaluated baselines for both arteries (Tables 2, 3 and 7). These advantages therefore do not depend on VGGT alone.
Weakness 1 and Question 3: Template versus learned coarse initialisation
We replace predicted geometry and radii with a per-branch mean template from the training set and retrain both refiners using the same procedure and image features. Coarse-predicted branch existence is retained (Tables 16–17; lines 1400–1453).
The refiners recover substantial accuracy from the template. Learned coarse initialisation nevertheless improves RCA Dice by 9.02 and reduces CD by 1.46 mm for RCA and 1.62 mm for LCA, although LCA Dice is similar. This supports a better geometric starting point, not an absolute requirement for refinement.
In an additional timing run of the template pipeline, VGGT takes 58.34 ms, the coarse predictor 1.18 ms, and both refiners, including preparation, 75.80 ms: 135.31 ms overall. Subtracting the coarse predictor gives an estimated 134.14 ms, not measured as coarse-free runtime: branch existence and branch tokens are still required, and VGGT features are reused by the geometry refiner. Thus, eliminating that computation would save only 1.18 ms in this run. These timings are separate from the original 121 ms benchmark.
Weakness 2 and Question 4: Implementation details
Weakness 2 and Question 5: Radius refinement and accuracy
Yes, both dense-centreline and B-spline variants include geometry and radius refinement (Table 6 caption). Tables 2–3 report radius mean absolute error (RadMAE) and relative RadMAE before and after refinement:
Refinement reduces radius MAE by 32% for RCA and 16% for LCA, directly demonstrating radius improvement beyond changes in Dice.