中文摘要：

对道路之间存在1∶N匹配关系的矢量道路网自动匹配问题进行研究。针对现有方法中大多数是基于局部寻优策略来寻找匹配道路,当同名道路存在较大距离偏差,又存在1∶N匹配关系时,很容易导致误匹配的问题,改局部寻优策略为全局寻优策略,通过综合利用道路结点和道路弧段的特征信息,建立道路网匹配的最优化模型,并利用概率松弛法求解最优解,从而获得道路结点的匹配关系,以此为基础再获得道路弧段之间的匹配关系。试验表明：本文方法更具全局一致性,具有较高的准确率;即使在同名道路存在较大位置偏差甚至是非均匀偏差时,也可取得较为满意的结果,避免各种局部寻优方法难以准确设定权值的难题。

英文摘要：

Automated matching for road networks plays an important role in map registration,map updating and change detection,and this paper carries out research on the problem of matching different levels of road network automatically.Because the great majority of the existing methods for matching road network are based on finding optimal solution locally,which will cause mismatch often occurred when homonymous road features differ greatly in their locations and there is 1∶1 or 1∶N corresponding relationship between them,so in order to solve such a problem,this paper constructs global optimization model of matching road network through analyzing locations,shape and topological structure of road junctions and road arcs,and this model not only considers local similarity between road nodes but also takes matching situations of their adjacent nodes into account.The optimal solution is found by using probability relaxation method,and matching relationship between road nodes and between road arcs can be obtained finally.In probability relaxation method,topological structure similarity between nodes is chosen as the initial probability,and shape similarity between road arcs is chosen as compatibility function.Many experiments indicate that our method can ensure that matching results agree with each other globally,and has a higher accuracy as a result,furthermore,as a strong constraint condition,global optimization can ensure that our method still gets a satisfactory result even when homonymous features differ greatly in their locations and there is 1∶N matching relationship between roads,and avoids the difficult problem of setting proper weights to some degree.