Three-view Focal Length Recovery From Homographies

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00388100" target="_blank" >RIV/68407700:21230/25:00388100 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/CVPR52734.2025.01074" target="_blank" >https://doi.org/10.1109/CVPR52734.2025.01074</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Three-view Focal Length Recovery From Homographies

Popis výsledku v původním jazyce

In this paper, we propose a novel approach for recovering focal lengths from three-view homographies. By examining the consistency of normal vectors between two homographies, we derive new explicit constraints between the focal lengths and homographies using an elimination technique. We demonstrate that three-view homographies provide two additional constraints, enabling the recovery of one or two focal lengths. We discuss four possible cases, including three cameras having an unknown equal focal length, three cameras having two different unknown focal lengths, three cameras where one focal length is known, and the other two cameras have equal or different unknown focal lengths. All the problems can be converted into solving polynomials in one or two unknowns, which can be efficiently solved using Sturm sequence or hidden variable technique. Evaluation using both synthetic and real data shows that the proposed solvers are both faster and more accurate than methods relying on existing two-view solvers. The code and data are available on https://github. com/kocurvik/hf.

Název v anglickém jazyce

Three-view Focal Length Recovery From Homographies

Popis výsledku anglicky

In this paper, we propose a novel approach for recovering focal lengths from three-view homographies. By examining the consistency of normal vectors between two homographies, we derive new explicit constraints between the focal lengths and homographies using an elimination technique. We demonstrate that three-view homographies provide two additional constraints, enabling the recovery of one or two focal lengths. We discuss four possible cases, including three cameras having an unknown equal focal length, three cameras having two different unknown focal lengths, three cameras where one focal length is known, and the other two cameras have equal or different unknown focal lengths. All the problems can be converted into solving polynomials in one or two unknowns, which can be efficiently solved using Sturm sequence or hidden variable technique. Evaluation using both synthetic and real data shows that the proposed solvers are both faster and more accurate than methods relying on existing two-view solvers. The code and data are available on https://github. com/kocurvik/hf.

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/GM22-23183M" target="_blank" >GM22-23183M: Nová generace algoritmů pro řešení problémů geometrie kamer</a><br>

Návaznosti

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

Rok uplatnění

2025

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

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

ISBN

979-8-3315-4365-5

ISSN

1063-6919

e-ISSN

2575-7075

Počet stran výsledku

10

Strana od-do

11505-11514

Název nakladatele

IEEE Computer Society

Místo vydání

Los Alamitos

Místo konání akce

Nashville

Datum konání akce

11. 6. 2025

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

WRD - Celosvětová akce

Kód UT WoS článku

001601106700490