Solutions to Minimal Generalized Relative Pose Problems
نویسندگان
چکیده
We present a method to obtain the solutions to the generalized 6-point relative pose problem. The problem is to find the relative positions of two generalized cameras so that six corresponding image rays meet in space. Here, a generalized camera is a camera that captures some arbitrary set of rays and does not adhere to the central perspective projection model. The cameras are assumed to be calibrated, which means that we know the image rays in Euclidean camera coordinate systems. Mathematically, the problem is therefore, given two Euclidean configurations consisting of six lines each, to find a rigid transformation of the first six lines so that each transformed line intersects its corresponding line from the second set. We show that the problem has 64 solutions in general and solve it by computing a matrix on closed form and then extracting its eigen-vectors. Hence we present a solver that corresponds to the intrinsic degree of difficulty of this minimal problem. Our numerical experiments show that the presented solver can be used in a RANSAC-implementation.
منابع مشابه
Duality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملPolynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems
In this paper we provide new fast and simple solutions to two important minimal problems in computer vision, the five-point relative pose problem and the six-point focal length problem. We show that these two problems can easily be formulated as polynomial eigenvalue problems of degree three and two and solved using standard efficient numerical algorithms. Our solutions are somewhat more stable...
متن کاملUPnP: An Optimal O(n) Solution to the Absolute Pose Problem with Universal Applicability
A large number of absolute pose algorithms have been presented in the literature. Common performance criteria are computational complexity, geometric optimality, global optimality, structural degeneracies, and the number of solutions. The ability to handle minimal sets of correspondences, resulting solution multiplicity, and generalized cameras are further desirable properties. This paper prese...
متن کاملMinimal Solvers for Generalized Pose and Scale Estimation from Two Rays and One Point
Estimating the poses of a moving camera with respect to a known 3D map is a key problem in robotics and Augmented Reality applications. Instead of solving for each pose individually, the trajectory can be considered as a generalized camera. Thus, all poses can be jointly estimated by solving a generalized PnP (gPnP) problem. In this paper, we show that the gPnP problem for camera trajectories p...
متن کاملClosed-Form Solutions to Minimal Absolute Pose Problems with Known Vertical Direction
In this paper we provide new simple closed-form solutions to two minimal absolute pose problems for the case of known vertical direction. In the first problem we estimate absolute pose of a calibrated camera from two 2D-3D correspondences and a given vertical direction. In the second problem we assume camera with unknown focal length and radial distortion and estimate its pose together with the...
متن کامل