Optimizing Elimination Templates by Greedy Parameter Search

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F22%3A00364414" target="_blank" >RIV/68407700:21730/22:00364414 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/CVPR52688.2022.01530" target="_blank" >https://doi.org/10.1109/CVPR52688.2022.01530</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CVPR52688.2022.01530" target="_blank" >10.1109/CVPR52688.2022.01530</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizing Elimination Templates by Greedy Parameter Search

Popis výsledku v původním jazyce

We propose a new method for constructing elimination templates for efficient polynomial system solving of minimal problems in structure from motion, image matching, and camera tracking. We first construct a particular affine parameterization of the elimination templates for systems with a finite number of distinct solutions. Then, we use a heuristic greedy optimization strategy over the space of parameters to get a template with a small size. We test our method on 34 minimal problems in computer vision. For all of them, we found the templates either of the same or smaller size compared to the state-of-the-art. For some difficult examples, our templates are, e.g., 2.1, 2.5, 3.8, 6.6 times smaller. For the problem of refractive absolute pose estimation with unknown focal length, we have found a template that is 20 times smaller. Our experiments on synthetic data also show that the new solvers are fast and numerically accurate. We also present a fast and numerically accurate solver for the problem of relative pose estimation with unknown common focal length and radial distortion.

Název v anglickém jazyce

Optimizing Elimination Templates by Greedy Parameter Search

Popis výsledku anglicky

We propose a new method for constructing elimination templates for efficient polynomial system solving of minimal problems in structure from motion, image matching, and camera tracking. We first construct a particular affine parameterization of the elimination templates for systems with a finite number of distinct solutions. Then, we use a heuristic greedy optimization strategy over the space of parameters to get a template with a small size. We test our method on 34 minimal problems in computer vision. For all of them, we found the templates either of the same or smaller size compared to the state-of-the-art. For some difficult examples, our templates are, e.g., 2.1, 2.5, 3.8, 6.6 times smaller. For the problem of refractive absolute pose estimation with unknown focal length, we have found a template that is 20 times smaller. Our experiments on synthetic data also show that the new solvers are fast and numerically accurate. We also present a fast and numerically accurate solver for the problem of relative pose estimation with unknown common focal length and radial distortion.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF15_003%2F0000468" target="_blank" >EF15_003/0000468: Inteligentní strojové vnímání</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceeding 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

ISBN

978-1-6654-6946-3

ISSN

1063-6919

e-ISSN

2575-7075

Počet stran výsledku

11

Strana od-do

15733-15743

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

New Orleans, Louisiana

Datum konání akce

19. 6. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000870783001053