Pictures of Combinatorial Cubes

07/20/2017
by   André Wagner, et al.
0

We prove that the 8-point algorithm always fails to reconstruct a unique fundamental matrix F independent on the camera positions, when its input are image point configurations that are perspective projections of the vertices of a combinatorial cube in R^3. We give an algorithm that improves the 7- and 8-point algorithm in such a pathological situation. Additionally we analyze the regions of focal point positions where a reconstruction of F is possible at all, when the world points are the vertices of a combinatorial cube in R^3.

READ FULL TEXT

page 2

page 7

research
03/20/2021

Discrete Helly-type theorems for pseudohalfplanes

We prove discrete Helly-type theorems for pseudohalfplanes, which extend...
research
06/08/2020

Near-Perfect Recovery in the One-Dimensional Latent Space Model

Suppose a graph G is stochastically created by uniformly sampling vertic...
research
02/24/2016

On the Accuracy of Point Localisation in a Circular Camera-Array

Although many advances have been made in light-field and camera-array im...
research
12/16/2020

A fast semi-discrete optimal transport algorithm for a unique reconstruction of the early Universe

We leverage powerful mathematical tools stemming from optimal transport ...
research
06/12/2015

New Results for Domineering from Combinatorial Game Theory Endgame Databases

We have constructed endgame databases for all single-component positions...
research
01/04/2018

Enumerating combinatorial triangulations of the hexahedron

Most indirect hexahedral meshing methods rely on 10 patterns of subdivis...
research
01/19/2021

Local Complexity of Polygons

Many problems in Discrete and Computational Geometry deal with simple po...

Please sign up or login with your details

Forgot password? Click here to reset