scholarly journals PERFORMING 3D SIMILARITY TRANSFORMATION WITH LARGE ROTATION ANGLES USING CONSTRAINED MULTIVARIATE TOTAL LEAST SQUARES

2020 ◽  
Vol 26 (4) ◽  
Author(s):  
Wuyong Tao ◽  
Xianghong Hua ◽  
Shaoquan Feng

Abstract: 3D similarity transformation is frequently encountered operation in the field of geodetic data processing, and there are many applications that involve large rotation angles. In previous studies, the errors of the coefficient matrix were usually neglected and a least squares algorithm was applied to calculate the transformation parameters. However, the coefficient matrix is composed of the point coordinates in source coordinate system, i.e., the coefficient matrix is also contaminated by errors. Therefore, a total least squares algorithm should be applied. In this paper, a new method is proposed to address the 3D similarity transformation problem with large rotation angles. Firstly, the scale factor and rotation matrix are put together as the parameter matrix to avoid the rank-defect problem. Then, the translation vector is removed and the multivariate model is constructed. Finally, the constraints are introduced according to the properties of the parameter matrix and the constrained multivariate total least squares algorithm is derived to obtain the transformation parameters. The experimental results show that the proposed method has a high computational efficiency.

2020 ◽  
Author(s):  
Jianqing Cai ◽  
Dalu Dong ◽  
Nico Sneeuw

<p>A newly developed Converted Total Least Squares (CTLS) algorithm is introduced, which is to take the stochastic design matrix elements as virtual observations, and to transform the TLS problem into a traditional Least Squares problem. This new algorithm has the advantages that it can not only easily consider the weight of observations and the weight of stochastic design matrix, but also deal with TLS problem without complicated iteration processing, which enriches the TLS algorithm and solves the bottleneck restricting the application of TLS solutions. The notable development of the CTLS reveals also that CTLS estimator is identical to Gauss-Helmert model estimator in dealing with EIV model, especially in the case of similarity coordinate transformation. CTLS has been successfully applied to the estimation of the transformation parameters, their rates and related transformed residuals between actual ITRF realizations of ITRF2014 and ITRF2008 with obvious improvement of their accuracies.</p>


2012 ◽  
Vol 239-240 ◽  
pp. 1352-1355
Author(s):  
Jing Zhou ◽  
Yin Han Gao ◽  
Chang Yin Liu ◽  
Ji Zhi Li

The position estimation of optical feature points of visual system is the focus factor of the precision of system. For this problem , to present the Total Least Squares Algorithm . Firstly , set up the measurement coordinate system and 3D model between optical feature points, image points and the position of camera according to the position relation ; Second , build the matrix equations between optical feature points and image points ; Then apply in the total least squares to have an optimization calculation ; Finally apply in the coordinate measuring machining to have a simulation comparison experiment , the results indicate that the standard tolerance of attitude coordinate calculated by total least squares is 0.043mm, it validates the effectiveness; Compare with the traditional method based on three points perspective theory, measure the standard gauge of 500mm; the standard tolerance of traditional measurement system is 0.0641mm, the standard tolerance of Total Least Squares Algorithm is 0.0593mm; The experiment proves the Total Least Squares Algorithm is effective and has high precision.


2012 ◽  
Vol 2 (2) ◽  
pp. 98-106 ◽  
Author(s):  
B. Schaffrin ◽  
F. Neitzel ◽  
S. Uzun ◽  
V. Mahboub

Modifying Cadzow's algorithm to generate the optimal TLS-solution for the structured EIV-Model of a similarity transformationIn 2005, Felus and Schaffrin discussed the problem of a Structured Errors-in-Variables (EIV) Model in the context of a parameter adjustment for a classical similarity transformation. Their proposal, however, to perform a Total Least-Squares (TLS) adjustment, followed by a Cadzow step to imprint the proper structure, would not always guarantee the identity of this solution with the optimal Structured TLS solution, particularly in view of the residuals. Here, an attempt will be made to modify the Cadzow step in order to generate the optimal solution with the desired structure as it would, for instance, also result from a traditional LS-adjustment within an iteratively linearized Gauss-Helmert Model (GHM). Incidentally, this solution coincides with the (properly) Weighted TLS solution which does not need a Cadzow step.


2014 ◽  
Vol 522-524 ◽  
pp. 1211-1214
Author(s):  
Qing Wu Meng ◽  
Lu Meng

The coordinate transformation models based on least square method and total least square are built and discussed. The least square model only includes the errors of observation vectors, the total least square model simultaneously takes into consideration to the errors of observation vectors and the errors of coefficient matrix. The both models are verified and compared in experiment. The experimental results showed that the model of total least square is more in line with actual, and more reasonable than by least square theoretically, and the coordinate transformation solution result of total least square with least square is more near.


Sign in / Sign up

Export Citation Format

Share Document