REVIEW 2 cited by
Condition numbers in multiview geometry, instability in relative pose estimation, and RANSAC
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we introduce a general framework for analyzing the numerical conditioning of minimal problems in multiple view geometry, using tools from computational algebra and Riemannian geometry. Special motivation comes from the fact that relative pose estimation, based on standard 5-point or 7-point Random Sample Consensus (RANSAC) algorithms, can fail even when no outliers are present and there is enough data to support a hypothesis. We argue that these cases arise due to the intrinsic instability of the 5- and 7-point minimal problems. We apply our framework to characterize the instabilities, both in terms of the world scenes that lead to infinite condition number, and directly in terms of ill-conditioned image data. The approach produces computational tests for assessing the condition number before solving the minimal problem. Lastly, synthetic and real data experiments suggest that RANSAC serves not only to remove outliers, but in practice it also selects for well-conditioned image data, which is consistent with our theory.
Forward citations
Cited by 2 Pith papers
-
Higher-Order Group Synchronization
The paper introduces hypergraph-based higher-order group synchronization, proves a cycle-consistency characterization, and gives a message-passing algorithm with convergence guarantees and competitive results on SO(2)...
-
Numerically Computing Galois Groups of Minimal Problems
A tutorial arguing that the Galois group and the Galois-width invariant characterize the intrinsic algebraic difficulty of minimal problems, with numerical monodromy code for the five-point problem.
Discussion (0). Continue with ORCID to comment.