Point-baaed 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Skrinjar, O. (2006). Point-based registration with known correspondence: Closed form optimal solutions and properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4057 LNCS, pp. 315–321). Springer Verlag. https://doi.org/10.1007/11784012_38
Mendeley helps you to discover research relevant for your work.