1 code implementation • 1 Jul 2023 • Evgeniy Martyushev, Snehal Bhayani, Tomas Pajdla
The important property of an elimination template is that it applies to all polynomial systems in the family.
no code implementations • 16 Jan 2023 • Snehal Bhayani, Janne Heikkilä, Zuzana Kukelova
Most state-of-the-art efficient polynomial solvers are based on the action matrix method that has been automated and highly optimized in recent years.
no code implementations • 29 Sep 2022 • Snehal Bhayani, Viktor Larsson, Torsten Sattler, Janne Heikkila, Zuzana Kukelova
In this paper we study the problem of estimating the semi-generalized pose of a partially calibrated camera, i. e., the pose of a perspective camera with unknown focal length w. r. t.
1 code implementation • ICCV 2021 • Snehal Bhayani, Torsten Sattler, Daniel Barath, Patrik Beliansky, Janne Heikkila, Zuzana Kukelova
In this paper, we propose the first minimal solutions for estimating the semi-generalized homography given a perspective and a generalized camera.
no code implementations • 17 Jul 2020 • Snehal Bhayani, Zuzana Kukelova, Janne Heikkilä
The existing state-of-the-art methods for solving such systems are either based on Gr\"obner bases and the action matrix method, which have been extensively studied and optimized in the recent years or recently proposed approach based on a sparse resultant computation using an extra variable.
1 code implementation • CVPR 2020 • Snehal Bhayani, Zuzana Kukelova, Janne Heikkilä
Our new method can be fully automatized and incorporated into existing tools for automatic generation of efficient polynomial solvers and as such it represents a competitive alternative to popular Gr\"obner basis methods for minimal problems in computer vision.