- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses camera position recovery from noisy relative directions contaminated by incorrect matches, assuming known camera orientations. Its key idea is to introduce multiple virtual reference points, transforming an unbounded position search into finite direction labeling on the unit sphere. The method constructs Markov random fields and uses TRW-S to jointly infer camera directions, then recovers positions through robust ray triangulation and improves accuracy through continuous refinement. The reported experiments show that it outperforms several baselines on synthetic data with high outlier rates. When integrated into GLOMAP as a replacement for its positioning stage, it delivers substantial gains on ETH3D and smaller improvements on other datasets. Its main limitations are higher computational cost and continued sensitivity to weak geometric constraints.
Critical strengths
The paper represents each camera by its direction from multiple virtual reference points, replacing direct discretization of unbounded 3D positions with a shared, bounded spherical label space. Positions are then recovered through robust ray triangulation. The geometric characterization of compatible direction pairs enables sparse interactions within the discrete model. This is the paper’s strongest methodological contribution, and it provides a concrete way to apply discrete joint inference without requiring a predefined scene bounding box.
Critical weaknesses
In my view, the connection between the pairwise compatibility scores and the existence of a globally consistent camera configuration requires further clarification. After depths are eliminated independently for each edge, it is unclear to me how the model ensures that each camera has a consistent depth across all incident constraints. Certain direction assignments could therefore receive high pairwise scores without corresponding to a single, realizable configuration of camera positions. Whether exact per-edge elimination preserves equivalence to the original problem merits further discussion. Subsequent multi-seed fusion and continuous refinement may mitigate this issue, but I find the explanation of how they do so, and under what conditions, insufficient.
Questions for authors
For a given seed, could one constraint require a camera to lie closer to the seed along its assigned ray, while another requires it to lie farther away, such that both constraints are individually compatible but cannot be satisfied simultaneously? How does the algorithm detect and resolve such conflicts? After depths are eliminated independently for each edge, which step ensures that all direction assignments jointly correspond to a single, globally consistent configuration of camera positions? Does this require additional assumptions? The paper discusses outlier rates, geometric degeneracies, scale selection, and parameter sensitivity. However, I could not find a discussion of whether pairwise-compatible direction assignments are necessarily globally realizable. Could the authors clarify whether such conflicts can arise and, if so, how the method handles them?
Thank you for this insightful question. After submission, we realized that the multiple seed points can be solved jointly in a single MRF run, thus reducing the runtime by 2x to 3x on average (up to 12.7x on Phototourism) as all K=4 non-coplanar seeds share one table per edge. Below, we first answer for our paper's per-seed solver (K=8), and then explain how the joint solver strengthens depth consistency.
1. Can a Single Seed Admit Conflicting Depths Across Incident Edges? Yes
Your geometric intuition is right. Fix one seed Sk and assign camera i ray direction vk,i∈S2, so ci=Sk+rk,ivk,i (rk,i>0). Suppose camera i has two neighbors j,m at fixed 3D positions cj=Sk+rk,jvk,j and cm=Sk+rk,mvk,m:
Thus, for one seed (K=1), per-edge depth elimination is an exact per-edge projection onto coplanarity and forward orientation that relaxes shared node depths across incident edges: sliding ci along vk,i preserves span(vk,i,vk,j), leaving a 1-DoF radial ambiguity per camera and omitting cycle products ∏e∈Cαe=1. In our paper's solver, per-seed MRFs do not enforce shared depths alone - consistency is restored across the K seeds during multi-seed fusion. This is why the final robust triangulation is crucial.
2. Which Step Ensures Global 3D Realizability - and Under What Assumptions?
Multi-seed ray intersection (Sec. 3.5) across the $K $ seeds eliminates this radial ambiguity and ties every camera to one shared depth across all edges:
3. How Conflicts Are Detected and Resolved: Original vs. Joint Solver
Conflicts are resolved in three steps:
How the joint solver relates: Rather than reconciling rays only after independent TRW-S runs, our joint MRF couples a K=4 non-coplanar tetrahedron via cross-seed skew-ray potentials ψkl(vk,i,vl,i) that penalize non-intersecting or negative-depth rays directly inside TRW-S, followed by the same triangulation and refinement (0 failures on 40/40 scenes, 34.9 ETH3D, 2x-3x faster). This is simple change to the algorithm but allows for directly considering multi-view consistency.