Linear Solution to the Minimal Absolute Pose Rolling Shutter Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00335892" target="_blank" >RIV/68407700:21230/19:00335892 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/19:00335892

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-20893-6_17" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-20893-6_17</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-20893-6_17" target="_blank" >10.1007/978-3-030-20893-6_17</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Linear Solution to the Minimal Absolute Pose Rolling Shutter Problem

Popis výsledku v původním jazyce

This paper presents new efficient solutions to the rolling shutter camera absolute pose problem. Unlike the state-of-the-art polynomial solvers, we approach the problem using simple and fast linear solvers in an iterative scheme. We present several solutions based on fixing different sets of variables and investigate the performance of them thoroughly. We design a new alternation strategy that estimates all parameters in each iteration linearly by fixing just the non-linear terms. Our best 6-point solver, based on the new alternation technique, shows an identical or even better performance than the state-of-the-art R6P solver and is two orders of magnitude faster. In addition, a linear non-iterative solver is presented that requires a non-minimal number of 9 correspondences but provides even better results than the state-of-the-art R6P. Moreover, all proposed linear solvers provide a single solution while the state-of-the-art R6P provides up to 20 solutions which have to be pruned by expensive verification.

Název v anglickém jazyce

Linear Solution to the Minimal Absolute Pose Rolling Shutter Problem

Popis výsledku anglicky

This paper presents new efficient solutions to the rolling shutter camera absolute pose problem. Unlike the state-of-the-art polynomial solvers, we approach the problem using simple and fast linear solvers in an iterative scheme. We present several solutions based on fixing different sets of variables and investigate the performance of them thoroughly. We design a new alternation strategy that estimates all parameters in each iteration linearly by fixing just the non-linear terms. Our best 6-point solver, based on the new alternation technique, shows an identical or even better performance than the state-of-the-art R6P solver and is two orders of magnitude faster. In addition, a linear non-iterative solver is presented that requires a non-minimal number of 9 correspondences but provides even better results than the state-of-the-art R6P. Moreover, all proposed linear solvers provide a single solution while the state-of-the-art R6P provides up to 20 solutions which have to be pruned by expensive verification.

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

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2019

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

ACCV 2018: Proceedings of the 14th Asian Conference on Computer Vision, Part III

ISBN

978-3-030-20892-9

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

16

Strana od-do

265-280

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Perth

Datum konání akce

4. 12. 2018

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

WRD - Celosvětová akce

Kód UT WoS článku

000492903100017