no code implementations • ECCV 2020 • Timothy Duff, Kathlén Kohn, Anton Leykin, Tomas Pajdla
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.
1 code implementation • CVPR 2022 • Petr Hruby, Timothy Duff, Anton Leykin, Tomas Pajdla
The hard minimal problems arise from relaxing the original geometric optimization problem into a minimal problem with many spurious solutions.
no code implementations • 4 Jan 2021 • Justin Chen, Yairon Cid-Ruiz, Marc Härkönen, Robert Krone, Anton Leykin
A primary ideal in a polynomial ring can be described by the variety it defines and a finite set of Noetherian operators, which are differential operators with polynomial coefficients.
Commutative Algebra Algebraic Geometry 14-04, 14Q15, 13N05, 65L80, 65D05
no code implementations • 10 Mar 2020 • Timothy Duff, Kathlén Kohn, Anton Leykin, Tomas Pajdla
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.
1 code implementation • 24 Mar 2019 • Timothy Duff, Kathlén Kohn, Anton Leykin, Tomas Pajdla
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras.
1 code implementation • 23 Mar 2019 • Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret Regan, David da Costa de Pinho, Elias Tsigaridas, Charles Wampler, Jonathan Hauenstein, Benjamin Kimia, Anton Leykin, Tomas Pajdla
We present a method for solving two minimal problems for relative camera pose estimation from three views, which are based on three view correspondences of i) three points and one line and the novel case of ii) three points and two lines through two of the points.