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

by   Patrick Erik Bradley, et al.

A p-adic variation of the Ran(dom) Sa(mple) C(onsensus) method for solving the relative pose problem in stereo vision is developped. From two 2-adically encoded images a random sample of five pairs of corresponding points is taken, and the equations for the essential matrix are solved by lifting solutions modulo 2 to the 2-adic integers. A recently devised p-adic hierarchical classification algorithm imitating the known LBG quantisation method classifies the solutions for all the samples after having determined the number of clusters using the known intra-inter validity of clusterings. In the successful case, a cluster ranking will determine the cluster containing a 2-adic approximation to the "true" solution of the problem.


page 1

page 2

page 3

page 4


A dyadic solution of relative pose problems

A hierarchical interval subdivision is shown to lead to a p-adic encodin...

Stereo relative pose from line and point feature triplets

Stereo relative pose problem lies at the core of stereo visual odometry ...

Isolating clusters of zeros of analytic systems using arbitrary-degree inflation

Given a system of analytic functions and an approximation to a cluster o...

The Cost of Troubleshooting Cost Clusters with Inside Information

Decision theoretical troubleshooting is about minimizing the expected co...

Inference in Cluster Randomized Trials with Matched Pairs

This paper considers the problem of inference in cluster randomized tria...

Efficiency of the Multisection Method

We study the efficiency of the multisection method for univariate nonlin...

Please sign up or login with your details

Forgot password? Click here to reset