paper-with-me

홈 › 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 epipolar geometry connecting overlapping views. Solvability studies under which conditions the cameras are uniquely determined by the graph. In this paper we propose a novel framework for analyzing solvability problems based on Algebraic Geometry, demonstrating its potential in understanding structure-from-motion graphs and proving a conjecture that was previously proposed.

📄 PDF Abstract BibTeX arXiv:2504.03637

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

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…

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…

A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks

2026-06-24 · Tal Weissblat arxiv

A Graph Neural Network (GNN) framework for predicting the solvability of finite groups from their Cayley graph representations was introduced in [1]. In the present work, we generalize this approach and develop a propert…

Graph Representation LearningGraph Neural Network

Graph Neural Networks for Predicting Solvability of Finite Groups

2026-05-30 · Tal Weissblat arxiv

We present a Graph Neural Network (GNN) framework for the classification of finite groups according to their solvability. Using undirected Cayley graph representations, the proposed framework learns to distinguish solvab…

Graph Neural Network