# Four Points in Two or Three Calibrated Views: Theory and Practice

- First Online:

- Received:
- Revised:
- Accepted:

DOI: 10.1007/s11263-005-4265-x

- Cite this article as:
- Nistér, D. & Schaffalitzky, F. Int J Comput Vision (2006) 67: 211. doi:10.1007/s11263-005-4265-x

- 9 Citations
- 198 Downloads

## Abstract

Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that the epipole in each view is then constrained to lie on a curve of degree ten. We derive the equation for the curve and establish many of the curve’s properties. For example, we show that the curve has four branches through each of the image points and that it has four additional points on each conic of the pencil of conics through the four image points. We show how to compute the four curve points on each conic in closed form. We show that orientation constraints allow only parts of the curve and find that there are impossible configurations of four corresponding point pairs. We give a novel algorithm that solves for the essential matrix given three corresponding points and one of the epipoles. We then use the theory to create the most efficient solution yet to the notoriously difficult problem of solving for the pose of three views given four corresponding points. The solution is a search over a one-dimensional parameter domain, where each point in the search can be evaluated in closed form. The intended use for the solution is in a hypothesise-and-test architecture to solve for structure and motion.