The Art of Solving Minimal Problems

Result code in IS VaVaI

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

Alternative codes found

RIV/68407700:21730/19:00346796

Result on the web

<a href="http://cmp.felk.cvut.cz/minimal-cvpr-2019/" target="_blank" >http://cmp.felk.cvut.cz/minimal-cvpr-2019/</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

The Art of Solving Minimal Problems

Original language description

One of the success stories of computer vision is using robust estimation schemes such as RANSAC in multiple view geometry estimation. With a hypothesis and test framework, one can efficiently handle large amounts of outliers in the measured data. Outliers are always present to some (and often to a large) extent due to the ambiguous feature matching process. A key element in such a framework is the ability to estimate the model from a small or minimal subset of data points - a so-called minimal problem. A classic example is the 5-point algorithm for estimating the relative pose between two cameras, given only image point measurements. Minimal solvers play an important role in many computer vision problems such as 3D Reconstruction, Visual Localization, Augmented/Mixed Reality, Visual Odometry or Robotics. The state-of-the-art approach to minimal problem solving is based on solving polynomial equations robustly and efficiently. This is a difficult topic since it is often formulated in a very abstract mathematical language. The goal of this tutorial is to explain the principles behind solving minimal problems and give practical means for engineers and researchers (whose main competences may lie elsewhere), to apply the most powerful methods that have been developed in the last ten years. We will present and practically demonstrate how to formulate and solve minimal problems with freely available software that will be distributed to the participants of the tutorial.

Czech name

—

Czech description

—

Type

W - Workshop organization

CEP classification

—

OECD FORD branch

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

Project

<a href="/en/project/EF17_050%2F0008025" target="_blank" >EF17_050/0008025: International Mobility of Researchers ? MSCA-IF in CTU</a><br>

Continuities

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

Publication year

2019

Confidentiality

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

Event location

Long Beach

Event country

US - UNITED STATES

Event starting date

—

Event ending date

—

Total number of attendees

70

Foreign attendee count

70

Type of event by attendee nationality

WRD - Celosvětová akce