Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction

DOI10.1137/21M1422872MaRDI QIDQ5886835

Margaret H. Regan, Timothy Duff, Tomáš Pajdla, Unnamed Author

Publication date: 11 April 2023

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.04460

zbMATH Keywords

Galois groups3D reconstructionmonodromy groupsnumerical algebraic geometryminimal problemsalgebraic vision

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Computational aspects of higher-dimensional varieties (14Q15) Machine vision and scene understanding (68T45) Numerical algebraic geometry (65H14)

Related Items (1)

Using monodromy to recover symmetries of polynomial systems

Uses Software

• GAP
• Macaulay2
• Bertini
• FIVEPOINT
• HomotopyContinuation
• GitHub
• MonodromySolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Centralizers of transitive permutation groups and applications to Galois theory
• Critical points via monodromy and local methods
• Numerical computation of Galois groups
• Using symmetries in the eigenvalue method for polynomial systems
• Separating invariants
• Galois groups of enumerative problems
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Homotopy continuation in Macaulay2
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• The Chow form of the essential variety in computer vision
• Algebraic Geometry. I: Complex projective varieties.
• Solving decomposable sparse systems
• On the existence of epipolar matrices
• Real monodromy action
• Adaptive strategies for solving parameterized systems using homotopy continuation
• PnP problem revisited
• Four points in two or three calibrated views: theory and practice
• Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Galois groups of Schubert problems via homotopy computation
• The ideal of the trifocal variety
• Efficient Recovery of Essential Matrix From Two Affine Correspondences
• Two Hilbert Schemes in Computer Vision
• Algebraic Geometry and Kinematics
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Minimal Problems for the Calibrated Trifocal Variety
• Solving polynomial systems via homotopy continuation and monodromy

This page was built for publication: Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction