A weighted adjustment of a similarity transformation between two point sets containing errors

Abstract

Abstract:For an adjustment of a similarity transformation, it is often appropriate to consider that both the source and the target coordinates of the transformation are affected by errors. For the least squares adjustment of this problem, a direct solution is possible in the cases of speci c weighing schemas of the coordinates. Such a problem is considered in the present contribution and a direct solution is generally derived for the m-dimensional space. The applied weighing schema allows (fully populated) pointwise weight matrices for the source and target coordinates, both weight matrices have to be proportional to each other. Additionally, the solutions of two borderline cases of this weighting schema are derived, which only consider errors in the source or target coordinates. The investigated solution of the rotation matrix of the adjustment is independent of the scaling between the weight matrices of the source and the target coordinates. The mentioned borderline cases, therefore, have the same solution of the rotation matrix. The direct solution method is successfully tested on an example of a 3D similarity transformation using a comparison with an iterative solution based on the Gauß-Helmert model.

Self-Supervised Flow Estimation using Geometric Regularization with Applications to Camera Image and Grid Map Sequences

“…To estimate the rotational component, the authors suggest an orthonormal matrix decomposition, maximizing the similarity between transformed correspondences. An analytical and robust approach using a weighted Least-Squares was presented by Marx [11] to mitigate the influence of false correspondences on the final result.…”

A Method for the Precise Coordinate Determination of an Inaccessible Location

“…In addition, the properties of this method have also been analysed in the literature, e.g., [19][20][21][22]. Various authors have also studied related issues, including similarity transformation problems under the GHM, proposed alternative solutions [23,24], and compared with other similar approaches, e.g., Gauss-Newton [25]. Also, some more advanced topics, including the GHM with a singular dispersion matrix [26], parameter estimation within the GHM using the Pareto optimality [27] or robust parameter estimation of the non-linear GHM [28], have been investigated.…”

Analytical dual quaternion algorithm of the weighted three-dimensional coordinate transformation

“…So far, a large number of algorithms of three-dimensional coordinate transformation have been presented (cf., e.g., Aydin et al 2018;Grafarend and Awange 2003;Kanatani and Niitsuma 2012;Kurt 2018;Ligas and Prochniewicz 2019;Mahboub 2016;Marx 2017;Mercan et al 2018;Mihajlović and Cvijetinović 2017;Păun et al 2017;Shen et al 2006;Uygur et al 2020;Walker et al 1991;Wang et al 2014;Zeng 2015;Yi 2010, 2011;Zeng et al 2016Zeng et al , 2018Zeng et al , 2019. They can be classified into iterative algorithm or analytical algorithm.…”