- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
OddEye integrates off-the-shelf pairwise dense matchers into incremental SfM through two components: fixed per-image source anchors for constructing connected multi-view tracks, and attention-guided scheduling for selecting the initial pair, the next image, and registered matching partners. The framework improves reconstruction accuracy across several benchmarks and reduces matching costs through on-demand pair selection.
Critical strengths
- The empirical results are strong, particularly on ETH3D. Improvements with the same underlying matcher suggest that the gains extend beyond adopting RoMa v2.
- The evaluation covers multiple matchers, backbones, and component ablations. The fixed-anchor modification to MV-RoMa and larger-scale reconstructions provide useful evidence of transferability and practical value.
Critical weaknesses
-
Limited methodological novelty. Fixed anchors provide a simple and effective way to preserve observation identities across pairwise dense matching calls while retaining continuous target coordinates. The results, including the MV-RoMa modification, establish its utility. However, given the established principle of persistent observations in SfM and prior work on dense track construction and registration-aware matching, I find the methodological advance relatively incremental. The paper could more precisely articulate the distinctive insight in its attention-and-track-based scheduling.
-
Limited comparison with geometry-aware alternatives. Tables 4 and 5 convincingly establish gains over appearance-based retrieval, but do not show whether the attention prior improves upon a competitive geometry-aware selector. A feasible comparison using the same matcher and comparable matching costs would strengthen this contribution. Extending the existing end-to-end runtime comparison to a competitive sparse pairing strategy would also better establish the practical efficiency advantage.
Questions for authors
-
Can you more precisely distinguish fixed-anchor construction from source-centered track construction in existing multi-view matching methods, particularly regarding persistence across groups?
-
Can you provide a representative geometry-aware or registration-aware scheduling baseline under comparable matching costs, or explain the relevant implementation constraints?
3 comments
W2/Q2. Geometry-aware and registration-aware scheduling baselines under comparable matching cost. We compared the attention prior with three published selectors and with a geometry-aware selector that we built for this comparison, using the same matcher and a similar number of matched pairs. Attention outperforms all of them with both matchers.
Published selectors. We selected recent methods that can be applied before any matching and that use geometry in their training or their features. SupScene is a retrieval descriptor trained with overlap supervision, MASt3R-SfM retrieval uses the encoder features of a 3D model, and Global Edge Prior (CVPR 2026) ranks pairs with a network trained on labels derived from SfM geometry. Note that all three still assign a single score to each image pair. We used their scores in place of the attention prior in all three scheduling decisions (initial pair, next view, and registered partners). For the next view, we ranked the candidates by their mean score to the registered views, because the mean gives higher accuracy than the maximum on the methods where we ran both (SupScene and Global Edge Prior).
A geometry-aware selector from the same model. To test geometry more directly, we designed a selector based on the geometry decoded by the same DVLT model that provides our attention, so that the two schedulers differ only in which output of the model they use. For each patch of image i, we take the 3D points that DVLT predicts for its pixels and project them into image j with the predicted cameras. We then compute the fraction of these points that fall inside the image and lie in front of the surface predicted for j, with a 10% depth tolerance. We use this fraction in place of the attention score of the patch and set the visibility threshold of Eq. 6 to 0.5. This selector is a strong baseline, because its ranking of image pairs is as accurate as that of attention (AP 0.936 vs. 0.938) and its ranking of next-view candidates agrees with the ground truth better (ρ = 0.938 vs. 0.756, App. G.4).
| Scheduler (ETH3D, 22 scenes, k = 3, AUC@3° %) | RoMa | RoMa v2 | Pairs / scene (RoMa) |
|---|---|---|---|
| Attention prior (ours) | 89.07 | 94.79 | 116 |
| Decoded geometry (same 3D model) | 85.53 | 93.90 | 120 |
| Global Edge Prior (CVPR 2026) | 82.71 | 87.87 | 128 |
| SupScene | 81.64 | 90.28 | 137 |
| MASt3R-SfM retrieval | 73.82 | 84.43 | 111 |
Decoded geometry is the strongest alternative, and attention outperforms it by 3.5 points with RoMa and by 0.9 points with RoMa v2. With RoMa, we found that most of this difference comes from pair selection. When geometry selects the initial pair and the partners, two scenes (bridge and meadow) fall to 48 and 45 AUC@3°, compared with 95 and 92 with attention. When geometry selects only the next view, these scenes reach 96 and 87, and the mean is 88.15 (Table R5). Geometry also needs the decoders of the model, which raise the peak GPU memory of a 110-image forward pass from 3.9 to 13.7 GiB, whereas attention is available without them.
Registration-aware scheduling. We understand “registration-aware scheduling” as selecting the next view or the pairs based on the state of the current reconstruction, as in the next-best-view score of COLMAP, or based on the matches obtained so far, as in the covisibility-based matching of EC-SfM. These methods score a candidate from its correspondences, so they need the matches of every candidate. With on-demand matching, a candidate has no matches before it is selected, and matching every candidate in advance would remove the benefit of on-demand matching. These methods can therefore be applied at a comparable matching cost only when the pairs are fixed before reconstruction. In this setting, COLMAP, which uses its own registration-aware selection, reaches 91–93 with the sparse matcher LoMa on the same number of attention-selected pairs as OddEye, compared with 94.79 for RoMa v2 + OddEye (App. G.2). Within on-demand matching, our scheduler and the decoded-geometry selector are both registration-aware, since Eq. 6 counts the tracks of the current reconstruction that are predicted to be visible in each candidate.
Methods that we could not include. SARA estimates overlap and parallax from a lightweight pre-matching pass to select the pairs, and we did not find public code for it. Co-VGGT learns a co-visibility predictor on a frozen 3D model, but its code and weights have not been released yet.
W2 (continued). Runtime against a sparse pairing strategy. We extended the runtime comparison of the submission (Fig. 8), which compares OddEye with exhaustive matching, to schedulers that also match a sparse set of pairs with the same dense matcher. On the same 110-image bridge scene, the attention scheduler has the shortest total runtime among them (RoMa v2, k = 3, RTX 3090).
| Scheduler | Pairs | End-to-end time | AUC@3° |
|---|---|---|---|
| Attention prior (ours) | 324 | 1,247 s | 96.68 |
| NetVLAD, on-demand | 387 | 1,328 s | 96.19 |
| Global Edge Prior, on-demand | 373 | 1,476 s | 86.05 |
Extracting the attention prior takes 64 s, which is 16 s longer than extracting the NetVLAD descriptors, but its matching stage is shorter (454 s, compared with 618 s and 709 s). The attention scheduler also registers an image at every attempt (108 of 108), whereas the NetVLAD scheduler fails in 18 of 126 attempts and the Global Edge Prior scheduler in 53 of 157. Its accuracy on this scene is similar to that of the NetVLAD scheduler (96.68 vs. 96.19). Table R10 (App. G.3) gives the time of each stage and also includes sparse-matcher pipelines (LoMa and FlexGlue with COLMAP).
If the reviewer has a specific baseline in mind, we would be glad to include it.
We thank the reviewer for the thoughtful assessment and the two questions.
W1. The distinctive insight of the scheduling. We agree that persistent observations are an established principle of SfM, and that fixed anchors are a simple way to apply it to pairwise dense matching. The insight that we consider distinctive is that fixed anchors allow us to estimate, before matching an image, how many of the existing tracks are visible in it. This number is the classical next-view criterion of incremental SfM, and we obtain it from the attention of a 3D foundation model instead of from precomputed matches.
The classical criterion. Incremental SfM commonly selects the next image by the number of already triangulated points that it observes, and COLMAP (Schönberger & Frahm, 2016) additionally considers how these points are distributed in the image. This criterion has been the standard for more than a decade. However, it is computed from the matches of every candidate image, so the pairs have to be matched in advance, either all of them or those selected by a retrieval prior that may be inaccurate (see also our reply to W2/Q2).
Why this is possible. Every track starts from a fixed anchor, so we know the image and the patch from which it originates. The attention of a 3D foundation model from this patch indicates in which other images the patch is visible, and the model computes it from all images of the scene jointly. For every image that is not registered yet, we can therefore count the existing tracks that are estimated to be visible in it, without matching this image (Eq. 6). We select the image with the highest count as the next view, and we use the same attention to select the registered images with which it is matched.
Difference from prior work. DetectorFreeSfM and DenseSfM first match the image pairs and build an initial reconstruction. They then use this reconstruction to refine the tracks (DetectorFreeSfM) or to extend them to further images (DenseSfM). In both methods, the reconstruction is used after the matching, and it is not used to decide which image pairs are matched. In OddEye, the current reconstruction is used before matching, to decide which image and which pairs are matched next, which allows us to run a dense matcher on only a few pairs per image.
Evidence. To test the role of the tracks, we scored the next image with the same attention at the image level, without using the tracks, and AUC@3° decreased from 89.07 to 86.69. To test the role of selecting the pairs during reconstruction, we fixed the pairs before reconstruction, using the same attention scores and the same number of pairs. In this case, AUC@3° decreased to 80.04, and only 730 of the 809 images were registered instead of 796 (App. G.1).
Q1. Fixed anchors vs. source-centered track construction, and persistence across groups. The difference is whether the points sampled in an image are kept from one group to the next. Suppose image A belongs to two groups of views, {A, B, C} and {A, D, E}, and all five images observe the same window corner. A multi-view matcher such as MV-RoMa (Lee et al., 2026) samples points in A for the first group and predicts their corresponding locations in B and C. For the second group, it samples a new set of points in A. The corner is then tracked once through A, B, and C, and once more through A, D, and E from a different point, and the two tracks are not connected. In OddEye, we sample the points of A once and keep them throughout the reconstruction. Whenever A is matched with B, C, D, or E, the same anchor on the corner is used, so its observations in these images belong to a single track, and a pair matched at a later step extends existing tracks instead of starting new ones. The table below compares how far a tracked point is reused in each method.
We included a condensed version of the table above as Table R17 in the revision (App. G.8) and added this discussion to Sec. 2, 3.1, and 3.3.