Abstract
This paper derives formulas for least-squares transformations between point-sets in ℝd. We consider affine transformations, with optional constraints for linearity, scaling, and orientation. We base the derivations hierarchically on reductions, and use trace manipulation to achieve short derivations. For the unconstrained problems, we provide a new formula which maximizes the orthogonality of the transform matrix. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Rutanen, K., Gómez-Herrero, G., Eriksson, S. L., & Egiazarian, K. (2013). Least-squares transformations between point-sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7944 LNCS, pp. 501–511). https://doi.org/10.1007/978-3-642-38886-6_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
