基于高斯牛顿法的DEM匹配算法  

DEM Co-registration Algorithm Based on Gauss-Newton Method

作　　者：张同刚[1,2] 王昆仑[3] 金国清 

机构地区：[1]西南交通大学地球科学与环境工程学院,四川成都610031 [2]西南交通大学高速铁路运营安全空间信息技术国家地方联合工程实验室,四川成都610031 [3]四川省水利水电勘测设计研究院,四川成都610072 [4]中铁第五勘测设计院集团有限公司,北京102600

出　　处：《西南交通大学学报》2017年第3期584-592,共9页Journal of Southwest Jiaotong University

基　　金：长江学者和创新团队发展计划资助项目(IRT13092)

摘　　要：为提升DEM(digital elevation model)匹配效率,建立了一种基于高斯牛顿法的快速DEM匹配算法.该算法采用高斯牛顿法替代最小二乘法来进行DEM匹配模型的目标方程求解,加速了目标方程求解的迭代过程.新算法匹配过程中,匹配参数沿梯度最大方向逼近目标值,迭代次数大幅度减少,具有更稳定的迭代收敛性,显著提高了算法的执行效率.通过多组模拟试验对新算法进行了测试,并与具有代表性的最近点迭代算法进行了比较.结果表明:新算法对匹配参数的收敛速率平均提高了42.1%,完成匹配所需的总时间平均减少了74.9%.To improve the efficiency of DEM （digital elevation model） co-registration, a fast algorithm based on Gauss-Newton method was proposed. This algorithm uses Gauss-Newton method instead of the least squares method, to solve the objective equation of the DEM co-registration model, and greatly accelerates the iterative convergence. During the iterations of the new algorithm, matching parameters approach the target values by following the direction of maximal gradient, which significantly reduces the number of iterations. Moreover, the iterative convergence is more stable and the algorithm operation efficiency is greatly enhanced. The new algorithm was tested with several groups of simulated datasets, and compared with the representative iterative closest points （ ICP） algorithm. The experimental results show that the average convergence rate of the proposed algorithm is improved by 42. 1% , and the computation time for matching is reduced by about 74. 9% .

关 键 词：DEM匹配 算法 高斯牛顿法 迭代收敛性 执行效率 

分 类 号：P225.1[天文地球—大地测量学与测量工程]