为了选择一种更适合数字高程模型匹配的算法,首先回顾了目前广泛使用的两种3维表面匹配算法--最小高差算法和最近点迭代算法的发展,并给出了二者共同的逻辑框架;然后从理论上对二者的差异进行了定性分析;最后通过试验进行了定量比较.试验结果表明：与ICP算法相比,LZD算法的计算效率高于前者约9倍.但其拉入范围略小,迭代速度也比ICP算法慢了约一倍,然而,如果表面姿态差异越小,则LZD算法迭代收敛就越快.因此,对于表面姿态差异较小的DEM匹配而言,LZD算法更加适合.

To select an appropriate algorithm for DEM matching,this paper reviews the development of the two popular 3D surface matching algorithms,least z-difference(LZD) and iterative closest point(ICP),and describes their common logical framework.Then the two algorithms are evaluated qualitatively through theoretic analysis.Finally,the quantitative comparison is performed by a set of tests.The experimental results show that the computational efficiency of LZD is about 9 times higher than ICP.But its pull-in range is slight smaller,and its iterative convergence rate is about 1 time slower than ICP.However,the closer the two DEM are,the faster LZD converges.Therefore,LZD is more appropriate for DEM matching with small pose different.