Let P= P 1,…, P m and Q= Q 1,…, Q n be two patterns of points. Each pairing (Pi, Qj) of a
point of P with a point of Q defines a relative displacement δij of the two patterns. We can …

Identifying corresponding points between two recordings of a point set has always been an
important problem in stereo vision applications. We describe this matching problem in terms …

We investigate in this article the rigid registration of large sets of points, generally sampled
from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estimation …

We propose a non-iterative solution to the P n P problem—the estimation of the pose of a
calibrated camera from n 3D-to-2D point correspondences—whose computational …

Feature-based methods for non-rigid registration frequently encounter the correspondence
problem. Regardless of whether points, lines, curves or surface parameterizations are used …

The determination of camera position and orientation from known correspondences of 3D
reference points and their images is known as pose estimation in computer vision and space …

Accurate and robust correspondence calculations are very important in many medical and
biological applications. Often, the correspondence calculation forms part of a rigid …