Pith. sign in

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

arxiv 2310.02719 v2 pith:ILLTPTHF submitted 2023-10-04 cs.CV cs.NAmath.NA

classification cs.CVcs.NAmath.NA
keywords dataconditiongeometryminimalpointransaccomputationalestimation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Higher-Order Group Synchronization

    stat.ML 2025-05 conditional novelty 6.0 of 10

    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)...

  2. Numerically Computing Galois Groups of Minimal Problems

    cs.CV 2025-07 conditional novelty 4.0 of 10

    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.

Pith tools