Research map / Graph learning / GNN architectures
An Algebraic Geometry Approach to Viewing Graph Solvability
Federica Arrigoni, Kathlén Kohn, Andrea Fusiello, Tomáš Pajdla
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use node-based Jacobian formulation instead of edge-based solvability matrix | finite solvability test · Real SfM graphs, Alamo to Piccadilly | total time (s): 25889.20 -> 2361.20 (Piccadilly) | Improved |
| use node-based Jacobian formulation instead of edge-based solvability matrix | finite solvability test · Real SfM graphs, Skansen Kronan to Roman Forum | total time (s): 913.57 -> 158.16 (Roman Forum) | Improved |
| use node-based Jacobian formulation on small graphs | finite solvability test · Real SfM graphs, small (Gustav Vasa) | total time (s): 0.10 -> 0.37 | No clear effect |
| use new Jacobian-based test instead of Arrigoni et al. | finite solvability test · Random graphs, 20 nodes, 8000 samples | agreement of outputs: same output on all 8000 samples | No clear effect |
| use new Jacobian-based test instead of Arrigoni et al. | finite solvability test · Real SfM graphs | number of components: 4 -> 4 (Tower of London) | No clear effect |
| lower edge density of random graphs | finite solvability · Random graphs, 20 nodes | # finite solvable out of 1000: 1000 -> 253 (60% to 20% density) | Hurt |
| lower edge density of random graphs | finite solvability · Random graphs, 20 nodes | number of components: [1, 1] -> [10, 25] (60% to 5% density) | Hurt |
| use node-based unknowns (12n) instead of edge-based (16m) | matrix size · Formulation comparison | # columns: 16m -> 12n | Improved |
| use direct formulation rows 10m+n+15 instead of 23m-11n+15 | matrix size · Formulation comparison | # rows: 23m - 11n + 15 -> 10m + n + 15 | Improved |
Closest papers by meaning
- A Direct Approach to Viewing Graph Solvability (ECCV 2024 · similarity 0.95)
- Viewing Graph Solvability via Cycle Consistency (ICCV 2021 · similarity 0.95)
- Revisiting Viewing Graph Solvability: An Effective Approach Based on Cycle Consistency (TPAMI 2022 · similarity 0.95)
- Viewing Graph Solvability in Practice (ICCV 2023 · similarity 0.94)
- On the Solvability of Viewing Graphs (ECCV 2018 · similarity 0.93)
- Solvability of the Viewing Graph Under the Affine Camera Model (CVPR 2026 · similarity 0.93)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
