Minimal Problems for the Calibrated Trifocal Variety

11/18/2016
by   Joe Kileel, et al.
0

We determine the algebraic degree of minimal problems for the calibrated trifocal variety in computer vision. We rely on numerical algebraic geometry and the homotopy continuation software Bertini.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2022

Snapshot of Algebraic Vision

In this survey article, we present interactions between algebraic geomet...
research
05/10/2021

Galois/monodromy groups for decomposing minimal problems in 3D reconstruction

We consider Galois/monodromy groups arising in computer vision applicati...
research
05/16/2012

The ideal of the trifocal variety

Techniques from representation theory, symbolic computational algebra, a...
research
03/11/2009

Free actions and Grassmanian variety

An algebraic notion of representational consistency is defined. A theore...
research
03/28/2020

On the inverses of Kasami and Bracken-Leander exponents

We explicitly determine the binary representation of the inverse of all ...
research
12/03/2022

Average degree of the essential variety

The essential variety is an algebraic subvariety of dimension 5 in real ...
research
09/07/2023

Algebra and Geometry of Camera Resectioning

We study algebraic varieties associated with the camera resectioning pro...

Please sign up or login with your details

Forgot password? Click here to reset