- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
P2G proposes affine registration of cross-modal images without task-specific training. GRID-FAST/LPSD and FSC estimate a coarse transform, after which structural descriptors and frozen DINOv3 features select one-to-one matches from multiple candidates. These become weighted graph nodes; edges measure agreement of within-image feature similarities across modalities. Node and edge scores guide three-point sampling and affine estimation. On OSDataset Hard, AUC@3px is 44.73%, compared with 33.33% for the best baseline (Table 1). Tests also cover visible–infrared and other modality pairs.
Critical strengths
- The premise is useful: relationships among points may be more stable across modalities than direct descriptor similarity. On fixed correspondences, Appendix D (Table 4) reports ROC-AUC of 0.729 for graph scores against 0.670 for point-wise DINOv3 scores on WHU-OPT-SAR Hard.
- The reported Hard-setting results are competitive without task-specific fine-tuning. On OSDataset Hard, AUC@3px is 44.73% versus 33.33% for RoMaV2, and AUC@5px is 63.89% versus 56.07% (Table 1).
Critical weaknesses
- The affine estimation procedure is not clearly specified. In Sec. 3.4, the sampling weights in Eqs. (9)–(10) can become negative, while the final hypothesis-selection criterion in Eq. (12) appears inconsistent with the objective of minimizing registration error. Since these steps are essential to the proposed method, the authors should clarify the actual implementation and ensure that the mathematical formulation matches the reported experiments.
- The contribution of relational edge modeling could be further clarified. Although Table 3 provides comprehensive component-level ablations, the relation-guided estimator is compared with FSC, making it difficult to isolate the benefit of relational edge weights from the sampling strategy itself. Additional comparisons with node-only guided sampling and shuffled-edge guidance under identical correspondence sets and sampling budgets would provide stronger evidence for the proposed graph representation.
Questions for authors
- Could the authors clarify how the sampling probabilities in Eqs. (9)–(10) are computed and how the final affine hypothesis is selected in Eq. (12)? Please provide the corresponding pseudocode and confirm whether the reported experiments follow the described implementation.
- Under identical correspondence sets and sampling budgets, how does the proposed relation-guided estimation compare with node-only guided sampling and shuffled-edge guidance? Could the authors also report the runtime of the main stages?