共查询到19条相似文献，搜索用时 156 毫秒
1.
传统的Bursa七参数模型坐标转换方法在大旋转角应用中存在不足,且未考虑到随机误差。基于EIV模型的多元总体最小二乘方法,不仅考虑了系数矩阵和观测值的随机误差,而且直接通过奇异值分解求解坐标旋转矩阵,大大简化了计算步骤,无须迭代计算。推导了多元总体最小二乘的坐标转换公式,设计了转换算法,并利用模拟数据对大角度三维坐标转换进行了验证。结果表明:多元总体最小二乘方法比基于Gauss-Markov(GM)模型的最小二乘方法的精度更高,且无须迭代计算,计算过程更加高效。 相似文献
2.
3.
文中提出的空间相似变换方程的最小二乘直接解法及给出的算法程序伪代码，同经典的线性化展开迭代最小二乘解法进行比较，具有效率高，稳定收敛等优点，且无需设置计算的初始参数，可直接给出最小二乘解，仿真实验证明本方法可用于大地坐标变换以及摄影测量模型的绝对定向。 相似文献
4.
激光跟踪仪转站实质是就是三维坐标转换,转站前后坐标误差必然存在,导致系数矩阵中必然存在随机误差。为消除系数矩阵中携带的随机误差对激光跟踪仪转站精度的影响,提高激光跟踪仪转站的精度,文章采用基于EIV(Error-in-Variable)模型的多变量整体最小二乘求解转换参数。多变量整体最小二乘在考虑观测矩阵结构性的基础上同时对观测矩阵与系数矩阵进行改正,其思路是将旋转参数、尺度参数和平移参数分开求解,避免了计算转换参数循环迭代的过程。实验结果表明,多变量整体最小二乘获得的参数估计值比最小二乘平差法获得的参数估计值更加接近设计值,提高了转站的精度。 相似文献
5.
针对加权总体最小二乘平差模型中系数矩阵具有结构性的问题,该文设计了一种顾及系数矩阵结构性的加权总体最小二乘迭代解法:首先,利用非线性最小二乘平差方法将总体最小二乘模型线性化;然后,采用结构矩阵的方法顾及系数矩阵的重复元素和常数项,通过间接平差的原理推导了顾及系数矩阵结构性的加权总体最小二乘迭代公式,可适用于加权总体最小二乘的参数估计;最后,通过算例分析并与其他算法进行比较,验证了该算法的有效性和可行性。 相似文献
6.
为了提高基于无人机影像重建三维场景的效率,提出了应用广义迭代重加权最小二乘法的全局式三维重建方法。首先,介绍了广义迭代重加权最小二乘法的基本思想和具体步骤;接着,将全局旋转矩阵的求解转化为李代数中旋转向量的求解问题,利用结合范数优化和迭代重加权最小二乘的方法求出全局旋转最优解;然后,根据极线几何约束条件,解算相机在全局坐标系下的相对平移方向向量,在广义迭代重加权最小二乘架构下,利用二次规划法求出相机全局位置最优解;最后,对影像位姿参数和重构三维点进行光束法平差优化。实验结果表明该方法在提高重建效率的同时,能够更真实地恢复场景的几何形态。 相似文献
7.
基于贝叶斯理论的线性与非线性模型反演方法（Fukuda-Johnson，F-J）已广泛应用于地球物理模型的线性-非线性参数反演。但F-J方法的反演结果可能受马尔可夫链蒙特卡洛采样（Markov chain Monte Carlo，MCMC）经验参数选择的影响，而反复调试合适的经验参数需耗费大量计算时间。对线性与非线性模型进行线性化后，也可以利用迭代最小二乘方法反演，但该方法难以选择合适的初始值。为提高参数反演计算效率和避免参数初值选择影响，提出了一种以F-J方法模型解为初始值的迭代最小二乘方法。该方法只需计算一次F-J方法模型解和有限次最小二乘迭代，既提高了F-J方法的反演效率，又能获得迭代最小二乘全局最优解。针对模拟数据实验和实际数据算例，分别采用F-J方法、随机生成初始值的迭代最小二乘方法和以F-J方法结果为初值的迭代最小二乘方法进行参数反演。结果表明，直接使用F-J方法时，MCMC采样参数会影响反演结果；直接进行迭代最小二乘反演时，初始值选取不当会导致迭代无法收敛到正确的结果；以F-J方法的结果作为迭代最小二乘方法的初始值进行反演，可以充分发挥F-J方法的全局最优性和迭代最小二乘方法计算量小、稳定性好的优势。 相似文献
8.
Bursa模型用于局部区域坐标变换的病态问题及其解法 总被引：17，自引：0，他引：17
GPS应用经常涉及坐标变换。用局部区域的GPS网数据求解的3维坐标变换模型的转换参数时,求得的转换参数特别是平移参数的精度较差。这是由于GPS网的范围太小,引起平移参数与旋转参数间存在强相关性,导致解算模型病态。正则化解法是求解病态方程的有效工具,本文探讨用正则化方法解算小范围GPS网3维坐标变换的转换参数,以提高转换参数的解算精度,扩大参数的使用范围;给出只对平移参数进行正则化的计算模型。500次模拟计算结果表明:正则化解参数转换外围点坐标的精度在统计上明显优于最小二乘解;且随外推距离增大,精度几乎成线性降低。 相似文献
9.
《武汉大学学报(信息科学版)》2016,(4)
大旋转角坐标变换模型的迭代解法依赖于初值的确定。用四元数构造旋转矩阵,建立了三维坐标变换的牛顿迭代公式,并提出了一种初值构造算法。利用实测数据和模拟数据对该算法进行了验证,并与其他算法进行比较。结果表明,该初值构造算法使得基于四元数的大旋转角坐标变换模型更加稳健。 相似文献
10.
针对测绘领域中函数模型为非线性函数的线性组合的特殊结构,本文提出了基于Moore-Penrose广义逆和立体矩阵的可分离非线性最小二乘解算方法。该方法首先利用变量投影算法消除可分离非线性模型中的线性参数,将包含两类参数的原非线性优化问题转化为仅含有非线性参数的最小二乘问题。然后,基于Moore-Penrose广义逆矩阵的微分和立体矩阵理论计算最小二乘目标函数的一阶导数,进而采用非线性优化的LM方法求解非线性参数的最优估值。最后,根据最小二乘方法求解线性参数的最优估值。通过指数函数模型拟合和机载LiDAR全波形参数求解试验与传统参数不分离优化方法进行对比,结果表明,基于Moore-Penrose广义逆和立体矩阵的可分离非线性最小二乘解算方法对待求参数初值依赖性低,同时避免了迭代过程中线性参数导致的病态问题,算法稳定性好,为测绘领域中可分离非线性最小二乘问题的解算提供了一种思路,也拓展了可分离非线性最小二乘方法的应用。 相似文献
11.
A Quaternion-based Geodetic Datum Transformation Algorithm 总被引：1，自引：1，他引：1
This paper briefly introduces quaternions to represent rotation parameters and then derives the formulae to compute quaternion, translation and scale parameters in the Bursa–Wolf geodetic datum transformation model from two sets of co-located 3D coordinates. The main advantage of this representation is that linearization and iteration are not needed for the computation of the datum transformation parameters. We further extend the formulae to compute quaternion-based datum transformation parameters under constraints such as the distance between two fixed stations, and develop the corresponding iteration algorithm. Finally, two numerical case studies are presented to demonstrate the applications of the derived formulae. 相似文献
12.
The representation of similarity transformation in three-dimensional (3D) space, especially of orientation, is a crucial issue in navigation, geodesy, photogrammetry, robot arm manipulation, etc. Considering the large amount of computer resources required by iterative algorithms designed for spatial similarity transformation, the high dependence on initial values of unknown parameters, and the instability of solving transformation parameters for large-angle registration, a closed-form solution for pairwise light detection and ranging (LiDAR) point cloud registration is proposed. In this solution, dual-number quaternions are used to represent the 3D rotation. The relationship between the rotation matrix-based representation of similarity transformation and the dual quaternion-based representation is described first. Considering that the same features from two neighboring stations coincide after pairwise registration, a dual quaternion-based error norm, which is associated with the sum of the position errors, is constructed. Based on theory of least squares and by extreme value analysis of the error norm, detailed derivations of the model and the main formulas are obtained. Once the similarities between the same features from the two neighboring LiDAR stations are constructed, the rotation matrix, the scale parameter, and the translation vector are simultaneously derived. Two experiments are conducted to verify the feasibility and effectiveness of the proposed algorithm. The proposed algorithm has the advantages of simplicity and ease of implementation, making it better than the traditional methods that use matrices to describe spatial rotation. Moreover, it solves the transformation parameters without the initial estimates of unknown parameters, making it better than iterative algorithms. Most importantly, in contrast to unit quaternion-based algorithms, the proposed algorithm solves seven unknown parameters simultaneously. Therefore, it effectively avoids the accumulation of introduced error in calculation and the negative impact from the inappropriate choice of initial values. 相似文献
13.
传统的后方交会最小二乘解法需要良好的外方位元素初值。在无初值或者初值不够精确的情况下,最小二乘迭代不容易收敛。在近景摄影测量或者计算机视觉等领域,往往不提供良好的初值,无法适用传统的后方交会解法。针对上述情况,本文提出了一种基于单应性矩阵的后方交会直接解法,在不需要初值的情况下,获取外方位元素的直接解。该方法根据单应性矩阵所描述的平面几何关系,利用单应性矩阵内在的约束条件,将后方交会问题转换为一个二元二次方程组的求解问题。该方法受舍入误差影响小,在无偶然误差的情况下,解算精度能达到10–9量级,能够避免传统直接解法计算复杂的问题,为传统的平差迭代解法提供良好的初值。此外,在多个控制点共面的情况下,该方法能够直接获得外方位元素的精确解。实验结果表明:在各种不同倾角拍摄的情况下,该方法均能够获得稳定的外方位元素,为后续的后方交会最小二乘算法提供良好的初值。采用本文方法计算的初值参与平差,能够达到与人工给定初值平差一致的精度,且迭代收敛速度是人工给定初值平差的2倍以上。在控制点共面的情况下,该方法的反投影精度能够达到亚像素级,且精度优于大部分主流的直接解法。 相似文献
14.
The weighted Procrustes algorithm is presented as a very effective tool for solving the three-dimensional datum transformation
problem. In particular, the weighted Procrustes algorithm does not require any initial datum parameters for linearization
or any iteration procedure. As a closed-form algorithm it only requires the values of Cartesian coordinates in both systems
of reference. Where there is some prior information about the variance–covariance matrix of the two sets of Cartesian coordinates,
also called pseudo-observations, the weighted Procrustes algorithm is able to incorporate such a quality property of the input
data by means of a proper choice of weight matrix. Such a choice is based on a properly designed criterion matrix which is
discussed in detail. Thanks to the weighted Procrustes algorithm, the problem of incorporating the stochasticity measures
of both systems of coordinates involved in the seven parameter datum transformation problem [conformal group ℂ7(3)] which is free of linearization and any iterative procedure can be considered to be solved. Illustrative examples are
given.
Received: 7 January 2002 / Accepted: 9 September 2002
Correspondence to: E. W. Grafarend 相似文献
15.
Parameter estimation in 3D affine and similarity transformation: implementation of variance component estimation 总被引：1，自引：0，他引：1
A. R. Amiri-Simkooei 《Journal of Geodesy》2018,92(11):1285-1297
Three-dimensional (3D) coordinate transformations, generally consisting of origin shifts, axes rotations, scale changes, and skew parameters, are widely used in many geomatics applications. Although in some geodetic applications simplified transformation models are used based on the assumption of small transformation parameters, in other fields of applications such parameters are indeed large. The algorithms of two recent papers on the weighted total least-squares (WTLS) problem are used for the 3D coordinate transformation. The methodology can be applied to the case when the transformation parameters are generally large of which no approximate values of the parameters are required. Direct linearization of the rotation and scale parameters is thus not required. The WTLS formulation is employed to take into consideration errors in both the start and target systems on the estimation of the transformation parameters. Two of the well-known 3D transformation methods, namely affine (12, 9, and 8 parameters) and similarity (7 and 6 parameters) transformations, can be handled using the WTLS theory subject to hard constraints. Because the method can be formulated by the standard least-squares theory with constraints, the covariance matrix of the transformation parameters can directly be provided. The above characteristics of the 3D coordinate transformation are implemented in the presence of different variance components, which are estimated using the least squares variance component estimation. In particular, the estimability of the variance components is investigated. The efficacy of the proposed formulation is verified on two real data sets. 相似文献
16.
A new method through Gauss–Helmert model of adjustment is presented for the solution of the similarity transformations, either 3D or 2D, in the frame of errors-in-variables (EIV) model. EIV model assumes that all the variables in the mathematical model are contaminated by random errors. Total least squares estimation technique may be used to solve the EIV model. Accounting for the heteroscedastic uncertainty both in the target and the source coordinates, that is the more common and general case in practice, leads to a more realistic estimation of the transformation parameters. The presented algorithm can handle the heteroscedastic transformation problems, i.e., positions of the both target and the source points may have full covariance matrices. Therefore, there is no limitation such as the isotropic or the homogenous accuracy for the reference point coordinates. The developed algorithm takes the advantage of the quaternion definition which uniquely represents a 3D rotation matrix. The transformation parameters: scale, translations, and the quaternion (so that the rotation matrix) along with their covariances, are iteratively estimated with rapid convergence. Moreover, prior least squares (LS) estimation of the unknown transformation parameters is not required to start the iterations. We also show that the developed method can also be used to estimate the 2D similarity transformation parameters by simply treating the problem as a 3D transformation problem with zero (0) values assigned for the z-components of both target and source points. The efficiency of the new algorithm is presented with the numerical examples and comparisons with the results of the previous studies which use the same data set. Simulation experiments for the evaluation and comparison of the proposed and the conventional weighted LS (WLS) method is also presented. 相似文献
17.
18.
分离系统差的地面网与卫星网之间转换的数学模型及其解算方法 总被引：2，自引：0，他引：2
本文分析了地面网所含系统差之后,指出只需要两个参数就可描述地面网的定向系统差。若分别考虑地面水平网的尺度参数K_L和高程网的尺度参数K_H,则地面网与卫星网间转换的数学模型中参数的个数为10个。若假定K_L=K_H,则参数需要9个。导出了含有9个和10个未知参数的模型。提出采用部分参数带权的相关平差法解决九参数和十参数模型的法方程式系数阵秩亏问题。最后,利用我国实际数据检核了这些模型。计算表明,这种方法能有效地将坐标系的定向参数和地面网的定向系统差参数分开。揭示了我国地面水平网的尺度参数与高程网的尺度参数不一致,并给出了它们的参考值。 相似文献
19.
采用罗德里格矩阵公式,在不考虑尺度因子的情况下,建立了基于罗德里格矩阵的六参数坐标转换模型,推导了高精度参数初值计算方法,最小二乘迭代法平差公式。通过实测数据验证,通过实测数据计算,表明该算法具有精度高、稳定性强、适用性广等优点。 相似文献