Point-Based Registration with Known Correspondence: Closed Form Optimal Solutions and Properties

Abstract

Point-based registration with known correspondence is often used as either a stand-alone method or a part of a more complex algorithm. The goal of this type of registration is to align two sets of points with the same number of corresponding points using a selected transformation type. Presented are closed form solutions for the transformation parameters that optimally align two point sets in the least squares sense for the following transformation types: rigid, similarity, rigid with nonuniform scales, and a linear combination of basis functions. It is shown that those registration methods whose underlying transformations form a group satisfy the identity, symmetry, transitivity, and distortion properties.