- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper addresses generalization of camera-pose networks to new domains by using unlabeled image collections to generate additional supervision. To achieve this, the paper relies on a set of strong tool -- such as a depth foundation model (MoGe-2), a pretrained correspondence matcher (RoMa?) with Doppelgangers++ verification -- which are combined with a trainable pose estimator.
The estimator follows a π³-like architecture with an image encoder initialized from DINOv2 and a multi-view decoder initialized from VGGT, made permutation-equivariant by removing the anchor-frame encoding. It takes as input RGB images and depth predicted by MoGe-2 and outputs camera rotations, translations, intrinsics, and per-view depth scales.
The model is first trained with in a supervised manner using annotated data from MegaDepth, ScanNet, Map-Free Relocalization, BlendedMVS, TartanAir, DL3DV, and ScanNet++ with ground truth data. Then unlabeled collections are added, for which predicted poses are refined with marginalized bundle adjustment while views registered unreliable are filtered out. The new data with the retained refined cameras poses are mixed with annotated data to supervise the final network fine-tuning. During this stage most of the backbone is frozen and primarily the camera head is trained.
The main adapted model (Ours†) is transductive because its fine-tuning pool includes the evaluation images, without their ground-truth poses. At inference the model takes the target RGB images and MoGe-2 depth predictions to estimate the camera parameters. Optionally, a Bundle Adjustment is applied to further refine the camera intrinsics, extrinsics and depth scale.
Critical strengths
The strongest argument for acceptance is the extensively evaluated pipeline showing that one can turn unconstrained, unlabeled image collections into useful self-supervision for improving camera-pose estimation, while supporting joint processing of thousands of views.
More detailed:
-
The paper makes effective use of unlabeled images by refining its camera predictions through geometric consistency checks and using the refined predictions to improve the network. In addition, the pipeline handles challenging image collections by rejecting misleading matches and filtering out unreliable views, including unrelated photos and images of similar-looking but different surfaces. This allows it to process unconstrained image collections gathered from the web.
-
To improve scalability, the paper proposes to distribute global attention across GPUs in a manner to preserve the full attention computation. This has the advantage to reduce memory requirements without approximating the attention or splitting the collection into independent groups and hence enables joint camera estimation over very large image collections. Indeed the paper shows results for scenes with over 6K images (in Eyeful Tower dataset), claiming to be able to handle 15K images.
-
The paper provides extensive experimental comparisons including small scenes, large-scale collections, and unconstrained internet images and large set of qualitative illustrations in the Appendix. The paper further provides several ablations illustrating the benefits of fine-tuning on unlabeled images, of the bundle adjustment after adaptation, and the contribution of free-point refinement. Leave-one-domain-out experiments also assess generalization beyond the domains included in fine-tuning.
Critical weaknesses
The main argument against acceptance is that the strongest results rely on computationally expensive transductive adaptation and selective image registration, leaving generalization and efficiency gains insufficiently established, while the methodological novelty beyond integrating existing components remains limited.
Detailed critical weaknesses:
-
One of my main concern is that the strongest results obtained in the paper combine transductive adaptation where all evaluation data is included in the self-supervised training phase, which requires substantial computation and selective image registration, making generalization and efficiency hard to assess. Indeed for Ours† the fine-tuning pool includes the evaluation images, supervised by pseudo labels generated through Ours◦ and then refined with bundle adjustment. This means that Ours† learned from the specific collections on which it is evaluated and therefore the comparisons with the other models is somewhat unfair, especially what concern runtime comparison in Table B.1 where the reported inference time for Ours† excludes the bundle adjustment used to generate its pseudo labels and the subsequent fine-tuning. Furthermore it is difficult to compare wall-clock runtime when two different hardwares are used.
-
From a practical point of view the images used to obtain Ours† could be considered as already labeled/posed images. Therefore, while it is interesting to show the results as an independent transductive adaptation scenario, in practice it would be more interesting to focus on the evaluation of Ours◦ and even more on the leave-one-domain-out models Ours⊖ which provides the most relevant evidence for performance on previously unseen collections and the gain obtained with training on unlabelled collection.
-
The performance of Ours◦ without BA is not consistently strong across benchmarks. Comparisons of Ours◦+BA should therefore also include competing feed-forward methods with BA refinement, as in Table 2, while reporting results without BA separately. Ours⊖ performs better than Ours◦, could be interesting to add this model with and without in the tables .
-
Another interesting scenario could be to use the proposed pipeline where the model is refined purely on the unlabelled target domain (test time adaptation).
-
In section 4 (lines 354-358) the authors then state that +BA configurations are scored on the subset retained after view filtering, and explicitly acknowledge that this favors the filtered setting, which according to Table C.1 (Reg) can be quite important in some cases. This makes pose error comparison rather difficult as not all methods are evaluated on the exact same set. The accuracy reported in the main should be therefore "all" or "retained together with the percentage of registered images).
-
My second main concern is the technical novelty. The method combines several existing, powerful, and computationally demanding models, as outlined in the paper summary. While I acknowledge that their integration represents a substantial engineering effort, there is limited methodological contribution in the paper.
-
Finally, I find the paper being very dense and quit difficult to follow, requiring frequent back-and-forth between the main text and the appendix.
Questions for authors
Clarification issues:
-
There are inconsistencies in the paper as in section Section 3.3 the authors mention Doppelgangers++ as a MASt3R-based matcher, while in the reproducibility statement they talk about RoMa correspondences with Doppelgangers++ verification. Can you clarify what was used at the end.
-
The paper claims to be able to handle 15K images. Was it tested on such scene and if yes which collection contains approximately 15,000 images? What are the inference time, memory consumption, registration rate for this collection?
4 comments
(Continued from last post)
A5: Selective registration (W5).
We thank the reviewer for highlighting the difficulty of comparing results on different sets of images. Following the reviewer's suggestion, the revised main tables report registration rates for Ours°+BA. Supplementary Table B.2 reports BA accuracy separately on all frames and on the retained views, together with the registration rate. We do not claim that our BA generally outperforms other SfM methods. Its primary role in our pipeline is to produce reliable pose pseudo-labels for fine-tuning.
A6: Novelty (W6).
We thank the reviewer for this critique. We acknowledge that our pipeline integrates existing models and optimization components. Our research goal is to study a generalizable and scalable learning paradigm for 3D foundation models that can use unlabeled data.
Our core methodology chooses a relatively “boring” approach: offline pseudo-labeling. We believe that validating this simple strategy is itself part of our contribution. Indeed, other works explore more sophisticated self-improvement strategies. Self-Geometry uses geometric-consistency losses (Youn et al., 2026), Fin3R distills a monocular teacher (Ren et al., 2025), Selfi uses feature alignment (Deng et al., 2026c), and Depth Anything 3 also uses a monocular teacher (Lin et al., 2026).
These methods apply supervision through losses evaluated during model updates. In contrast, we believe our simple offline pseudo-labeling strategy has the potential to provide higher-quality supervision at a larger scale. Our BA pipeline seeks poses that are geometrically consistent with foundation-model predictions (see A2 in our response to R2, Kw7X, for more details). It jointly optimizes poses across an image collection, potentially spanning thousands of views rather than only the views in a training batch. It can take many optimization steps before producing pseudo-labels. View filtering then provides an additional quality gate by excluding unreliable views. Indeed, this “simple” strategy brings substantial improvements in feed-forward pose accuracy. For example, RTA@3 rises from 23.1 to 86.6 on Mill 19 building, and RTA@5 rises from 60.4 to 88.5 on ETH3D (revised Table B.2). We hope this clarifies the novelty of our work.
A7: Presentation (W7).
We thank the reviewer for highlighting the difficulty of following the paper. We agree that the presentation should require less back-and-forth between the main text and the supplement. In the revised manuscript, we have consolidated references to supplementary method details at the end of Sec. 3. We have also added a brief implementation summary in Sec. 4. The main benchmark tables now include inductive results, so readers no longer need to consult the appendix for these comparisons.
A8: Correspondence models (Q1).
We apologize for the inconsistency. We use features from RoMa to identify covisible image pairs and construct the covisibility graph (App. D.2). Doppelgangers++ provides the correspondences used by BA (Sec. 3.3). We have corrected the reproducibility statement to distinguish their roles.
A9: The 15K-image collection (Q2).
The approximately 15K-image collection is Trafalgar in 1DSfM, which contains 15,685 images. We will include this detail in the revised manuscript.
References
Lin et al. (2026). Depth Anything 3: Recovering the Visual Space from Any Views. ICLR.
Deng et al. (2026c). Selfi: Self-improving Reconstruction Engine via 3D Geometric Feature Alignment. CVPR.
Ren et al. (2025). Fin3R: Fine-tuning Feed-forward 3D Reconstruction Models via Monocular Knowledge Distillation. NeurIPS.
Youn et al. (2026). Self-Geometry: GT-Free and Plug-and-Play Test-Time Adaptation for Geometrically Consistent 3D Vision Foundation Models. arXiv:2608.10708.
Deng et al. (2026a). Glob3R: Global Structure-from-Motion with 3D Foundation Models. arXiv:2607.09225.
Deng et al. (2026b). SAIL-Recon: Large SfM by Augmenting Scene Regression with Localization. 3DV.
Duisterhof et al. (2025). MASt3R-SfM: A Fully-Integrated Solution for Unconstrained Structure-from-Motion. 3DV.
Maggio et al. (2025). VGGT-SLAM: Dense RGB SLAM Optimized on the SL(4) Manifold. NeurIPS.
I appreciate the authors’ considerable effort in addressing the reviewers' concerns through additional experiments and clarifications, particularly the expanded implementation details and ablation studies. I also thank them for further comparisons between inductive transfer and transductive adaptation, adding test-time pseudo-label fine-tuning results, and reporting the percentage of retained frames alongside complementary scores computed over all frames. I acknowledge that with these extra experiments and clarification the authors substantially strengthened the paper, and would be happy to raise the score to a borderline, but no score is available for that.
Despite the above improvements, several concerns remain unresolved, preventing me from raising my score to weak accept.
- For a collection used in adaptation, BA has already produced refined camera poses before fine-tuning begins, so the benefit of subsequently training the network and predicting those poses again remains unclear.
- The authors acknowledge that main contribution lies in validating scalable offline pseudo-labeling through global BA and view filtering, rather than introducing fundamentally new components. However, the reported gains do not establish that this strategy produces better supervision than alternative pseudo-labeling pipelines under comparable data and compute budgets. They mention Self-Geometry, Fin3R and Selfi as "sophisticated self-improvement strategies", however there is no numerical or cost comparison to support the superiority of the "simple" approach proposed in this paper.
- Table B.2 provides more convincing evidence of usefulness through substantial inductive gains over the model before fine-tuning. However, inductive performance generally remains below that achieved with target-specific BA or TTO, suggesting that training on other domains transfers only part of their benefit. Furthermore, the relatively modest gains of transductive fine-tuning over TTO on several benchmarks leave the additional value of the broader fine-tuning pool unclear. The practical trade-off between generalization, accuracy, and adaptation cost therefore remains insufficiently established.
We thank you again for your thoughtful follow-up comments.
Follow-up concern 1: Why fine-tune when BA has already recovered the poses? We answer this from a practical application perspective. Feed-forward SfM models are being actively integrated into classical SfM pipelines, with improved camera-pose initialization as a key practical benefit. Commercial efforts at DroneDeploy and Niantic Spatial are pursuing this direction. Research efforts such as GLUEMAP confirm a similar trend. We observe the same benefit: improved initialization raises all-frame BA RTA@3 from 51.8 to 99.8 on Mill 19 building (revised Table B.2). These results show that model adaptation and BA are complementary: BA refines the predicted poses, while improving the initializer can also improve the final reconstruction. By transferring BA-refined poses back into the feed-forward model, our method alleviates its target-domain generalization gap, supporting its adaptation in SfM applications. We emphasize that fine-tuning on BA-refined poses addresses a concrete practical need, reflected in ongoing efforts across both industry and academia to integrate feed-forward models into SfM systems.
Follow-up concern 3: What is the value of pooled fine-tuning if gains over TTO are modest? A key research interest in TTO is retaining the benefits of adaptation across multiple target domains in a single model. For example, Niantic's ACE and ACE-G research how learning across scenes can improve a shared representation that supports scene-specific optimization. Our method naturally addresses the broader goal explored by ACE and ACE-G by consolidating adaptation across scenes into one shared model. A single Ours† model improves over Ours° + TTO across the summarized benchmarks (revised Table B.2).
Follow-up concern 2: Comparison with alternative supervision strategies. We thank the reviewer for highlighting this limitation. We emphasize two factual differences over alternative self-improvement methods. Our pipeline could: (1) leverage unconstrained image collections and (2) define supervision over pools of 1K+ images. We also believe that a direct pose loss against BA-refined & filtered pseudo-labels provides a more robust supervision signal. We acknowledge that we have not conducted a direct experimental comparison with these alternatives. We will continue working toward such comparisons under matched data and compute budgets.
We thank the reviewer for the thoughtful review and detailed summary. We appreciate the reviewer's recognition that our pipeline turns unconstrained, unlabeled collections into useful supervision. We are also grateful for the recognition of its ability to process thousands of views jointly. The reviewer's critique of evaluation fairness, computational cost, novelty, and presentation helps us clarify our contributions and their limitations.
A1: Performance and evaluation fairness (W1).
We thank the reviewer for highlighting the need to distinguish transductive adaptation from generalization to unseen domains. Following the reviewer's suggestion, we have added Ours⊖ to the main benchmark tables in the revised manuscript. Ours⊖ excludes the entire evaluation domain from pseudo-label fine-tuning and is evaluated on all frames. It remains competitive with recent feed-forward methods, outperforming AMB3R (2026) on ETH3D, π³ (2026) on Tanks & Temples, and Depth Anything 3 (2026) on IMC2021. We could not report the other feed-forward baselines on FastMap because they encountered out-of-memory (OOM) errors at its scale.
A2: Adaptation cost and runtime (W1).
We agree that the cost of pseudo-label generation and fine-tuning should be considered when assessing Ours†. Generating pseudo-labels for the full pool takes approximately 4 days on 8 A100 nodes, compared with 8 days for full training on the same resources. Pseudo-label generation adds substantial cost, but we consider it acceptable relative to the computational resources required for full training. We do not claim runtime efficiency as a contribution. We provide the reported runtimes for reference. Following the FastMap convention, these runtimes exclude preprocessing, including correspondence estimation and depth generation. The Ours† timing also excludes offline pseudo-label generation and fine-tuning. The revised supplementary runtime section now clarifies these exclusions and the different hardware used by the baselines.
During fine-tuning, we update all parameters of the pose estimator and train on the original annotated data together with the new pseudo-labels. This is more like extended training on a larger pool of supervision than a separate targeted fine-tuning run for each dataset. Our aim is to produce a single model that can generalize to unseen domains. Ours† is the main model trained on the combined pool. We apologize for the error in the original manuscript that may have caused this misunderstanding.
A3: Test-time adaptation (W2, W4).
We thank the reviewer for suggesting test-time adaptation as a separate evaluation scenario. In addition to the unseen-domain evaluation of Ours⊖ discussed in A1, we have included test-time pseudo-label fine-tuning results starting from Ours° in supplementary Table B.2 of the revised manuscript. Test-time fine-tuning achieves comparable performance to Ours†, although it performs slightly worse across these benchmarks. This may reflect the smaller pseudo-labeled training pool available for test-time adaptation. We summarize the results below.
Test-time fine-tuning results (revised Table B.2). All results use feed-forward poses. Metrics: RTA@5 for ETH3D and T&T, AUC@3 for IMC2021, and average RTA@3 for FastMap (all ↑).
A4: Comparisons with and without optimization (W3).
We thank the reviewer for this valuable comment. We agree that feed-forward predictions and optimization-based results should be reported separately. For a fairer comparison, we have added Ours⊖ to the main tables of the revised manuscript. Supplementary Table B.2 reports our models with and without BA, including all-frame and retained-view scores for BA. Following the reviewer's suggestion, all four main benchmark tables also report the frame registration rates for Ours°+BA.
Tables 1–3 also include methods that combine learned geometry with optimization. On ETH3D (Table 1), these include MASt3R-SfM and Glob3R. On IMC2021 (Table 2), we report π³ and VGGT both with and without BA. On Tanks & Temples (Table 3), we include SAIL and SAIL-OPT, as well as MASt3R-SfM and VGGT-SLAM. The latter methods use different forms of refinement:
On FastMap (Table 4), we could not include the other feed-forward baselines or their BA-refined results because their inference scripts encountered out-of-memory errors at this scale.