Search Results for author:
Found 7 papers, 3 papers with code
PL₁P - Point-line Minimal Problems under Partial Visibility in Three Views
We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at most one point.
Learning to Solve Hard Minimal Problems
The hard minimal problems arise from relaxing the original geometric optimization problem into a minimal problem with many spurious solutions.
Galois/monodromy groups for decomposing minimal problems in 3D reconstruction
We consider three classical cases--3-point absolute pose, 5-point relative pose, and 4-point homography estimation for calibrated cameras--where the decomposition and symmetries may be naturally understood in terms of the Galois/monodromy group.
PL${}_{1}$P -- Point-line Minimal Problems under Partial Visibility in Three Views
We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at most one point.
PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras.
PLMP -- Point-Line Minimal Problems in Complete Multi-View Visibility
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras.
Trifocal Relative Pose from Lines at Points and its Efficient Solution
We present a new minimal problem for relative pose estimation mixing point features with lines incident at points observed in three views and its efficient homotopy continuation solver.
