A dyadic solution of relative pose problems

by   Patrick Erik Bradley, et al.

A hierarchical interval subdivision is shown to lead to a p-adic encoding of image data. This allows in the case of the relative pose problem in computer vision and photogrammetry to derive equations having 2-adic numbers as coefficients, and to use Hensel's lifting method to their solution. This method is applied to the linear and non-linear equations coming from eight, seven or five point correspondences. An inherent property of the method is its robustness.


page 1

page 2

page 3

page 4


A Line-Point Unified Solution to Relative Camera Pose Estimation

In this work we present a unified method of relative camera pose estimat...

A p-adic RanSaC algorithm for stereo vision using Hensel lifting

A p-adic variation of the Ran(dom) Sa(mple) C(onsensus) method for solvi...

Applications of the Backus-Gilbert method to linear and some non linear equations

We investigate the use of a functional analytical version of the Backus-...

A Non-Iterative Solution to the Four-Point Three-Views Pose Problem in Case of Collinear Cameras

We give a non-iterative solution to a particular case of the four-point ...

An Algorithmic Solution to the Five-Point Pose Problem Based on the Cayley Representation of Rotations

We give a new algorithmic solution to the well-known five-point relative...

Average degree of the essential variety

The essential variety is an algebraic subvariety of dimension 5 in real ...

HiPE: Hierarchical Initialization for Pose Graphs

Pose graph optimization is a non-convex optimization problem encountered...

Please sign up or login with your details

Forgot password? Click here to reset