The absolute orientation problem involves finding the Euclidean transformation which minimises the sum of the squared errors between two pointsets. In the standard form of the problem a confidence may be attached to each of the errors via a set of positive scalar weights. In this paper we consider a generalisation of the standard problem in which the components of the error vectors are coupled via a set of weight matrices. We show how problems of this type arise and derive two distinct forms of the problem. We present a closed-form solution to the first form of the 3-D problem and iterative solutions to the second form of the 2-D problem and both forms of the 3-D problem. © 1996 IEEE.
|Title of host publication
|Proceedings - International Conference on Pattern Recognition|Proc. Int. Conf. Pattern Recognit.
|Number of pages
|Published - 1996
|13th International Conference on Pattern Recognition, ICPR 1996 - Vienna
Duration: 1 Jul 1996 → …
|13th International Conference on Pattern Recognition, ICPR 1996
|1/07/96 → …
- Peer Reviewed Conference