Euclidean Upgrade from a Minimal Number of Segments

04/25/2013
by   Tanja Schilling, et al.
0

In this paper, we propose an algebraic approach to upgrade a projective reconstruction to a Euclidean one, and aim at computing the rectifying homography from a minimal number of 9 segments of known length. Constraints are derived from these segments which yield a set of polynomial equations that we solve by means of Gröbner bases. We explain how a solver for such a system of equations can be constructed from simplified template data. Moreover, we present experiments that demonstrate that the given problem can be solved in this way.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2020

Efficient Segment Folding is Hard

We introduce a computational origami problem which we call the segment f...
research
11/28/2017

HomotopyContinuation.jl - a package for solving systems of polynomial equations in Julia

This paper is gives a short introduction into HomotopyContinuation.jl, a...
research
07/01/2023

Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets

The Euclidean Steiner Minimal Tree problem takes as input a set 𝒫 of poi...
research
05/14/2017

Post-Route Alleviation of Dense Meander Segments in High-Performance Printed Circuit Boards

Length-matching is an important technique to balance delays of bus signa...
research
05/14/2017

ILP-based Alleviation of Dense Meander Segments with Prioritized Shifting and Progressive Fixing in PCB Routing

Length-matching is an important technique to bal- ance delays of bus sig...
research
04/05/2018

The Geometry of SDP-Exactness in Quadratic Optimization

Consider the problem of minimizing a quadratic objective subject to quad...
research
07/08/2010

Improved RANSAC performance using simple, iterative minimal-set solvers

RANSAC is a popular technique for estimating model parameters in the pre...

Please sign up or login with your details

Forgot password? Click here to reset