Generalized total least squares prediction algorithm for universal 3D similarity transformation

详细信息    查看全文

• 作者：Bin Wang^a ; ^b ; ^{binwangsgg@whu.edu.cn} ; Jiancheng Li^a ; Chao Liu^c ; Jie Yu^d
• 关键词：3D similarity transformation ; Errors&ndash ; in&ndash ; variables model ; Total least squares prediction ; Gauss&ndash ; Newton approach
• 刊名：Advances in Space Research
• 出版年：2017
• 出版时间：1 February 2017
• 年：2017
• 卷：59
• 期：3
• 页码：815-823
• 全文大小：1462 K
• 卷排序：59

文摘

Three–dimensional (3D) similarity datum transformation is extensively applied to transform coordinates from GNSS-based datum to a local coordinate system. Recently, some total least squares (TLS) algorithms have been successfully developed to solve the universal 3D similarity transformation problem (probably with big rotation angles and an arbitrary scale ratio). However, their procedures of the parameter estimation and new point (non-common point) transformation were implemented separately, and the statistical correlation which often exists between the common and new points in the original coordinate system was not considered. In this contribution, a generalized total least squares prediction (GTLSP) algorithm, which implements the parameter estimation and new point transformation synthetically, is proposed. All of the random errors in the original and target coordinates, and their variance–covariance information will be considered. The 3D transformation model in this case is abstracted as a kind of generalized errors–in–variables (EIV) model and the equation for new point transformation is incorporated into the functional model as well. Then the iterative solution is derived based on the Gauss–Newton approach of nonlinear least squares. The performance of GTLSP algorithm is verified in terms of a simulated experiment, and the results show that GTLSP algorithm can improve the statistical accuracy of the transformed coordinates compared with the existing TLS algorithms for 3D similarity transformation.