paper-with-me

홈 › Papers

Optimizing the Viewing Graph for Structure-From-Motion

2015-12-01 · ICCV 2015 12 · Chris Sweeney, Torsten Sattler, Tobias Hollerer, Matthew Turk, Marc Pollefeys

The viewing graph represents a set of views that are related by pairwise relative geometries. In the context of Structure-from-Motion (SfM), the viewing graph is the input to the incremental or global estimation pipeline. Much effort has been put towards developing robust algorithms to overcome potentially inaccurate relative geometries in the viewing graph during SfM. In this paper, we take a fundamentally different approach to SfM and instead focus on improving the quality of the viewing graph before applying SfM. Our main contribution is a novel optimization that improves the quality of the relative geometries in the viewing graph by enforcing loop consistency constraints with the epipolar point transfer. We show that this optimization greatly improves the accuracy of relative poses in the viewing graph and removes the need for filtering steps or robust algorithms typically used in global SfM methods. In addition, the optimized viewing graph can be used to efficiently calibrate cameras at scale. We combine our viewing graph optimization and focal length calibration into a global SfM pipeline that is more efficient than existing approaches. To our knowledge, ours is the first global SfM pipeline capable of handling uncalibrated image sets.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

An Algebraic Geometry Approach to Viewing Graph Solvability

2025-04-04 · Federica Arrigoni, Kathlén Kohn, Andrea Fusiello, Tomas Pajdla

The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the …

Viewing Graph Solvability in Practice

2023-01-01 · ICCV 2023 1 · Federica Arrigoni, Tomas Pajdla, Andrea Fusiello

We present an advance in understanding the projective Structure-from-Motion, focusing in particular on the viewing graph: such a graph has cameras as nodes and fundamental matrices as edges. We propose a practical me…

Solving Viewing Graph Optimization for Simultaneous Position and Rotation Registration

2021-08-29 · Seyed-Mahdi Nasiri, Reshad Hosseini, Hadi Moradi

A viewing graph is a set of unknown camera poses, as the vertices, and the observed relative motions, as the edges. Solving the viewing graph is an essential step in a Structure-from-Motion procedure, where a set of rela…

PositionTranslation

Viewing Graph Solvability via Cycle Consistency

2021-01-01 · ICCV 2021 10 · Federica Arrigoni, Andrea Fusiello, Elisa Ricci, Tomas Pajdla

In structure-from-motion the viewing graph is a graph where vertices correspond to cameras and edges represent fundamental matrices. We provide a new formulation and an algorithm for establishing whether a viewing gr…

On the Solvability of Viewing Graphs

2018-08-08 · ECCV 2018 9 · Matthew Trager, Brian Osserman, Jean Ponce

A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a "viewing graph". Whether or not these fundamental matrices are generically sufficient to recover the global c…