基于结构化空间关系信息的结点层次匹配方法  

A Hierarchical Approach for Nodes Matching Based on Structural Spatial Relations

作　　者：邓敏[1] 徐凯[1] 赵彬彬[1,2] 徐锐[1] 

机构地区：[1]中南大学信息物理工程学院,长沙市麓山南路932号410083 [2]长沙理工大学交通运输工程学院,长沙市赤岭路45号410076

出　　处：《武汉大学学报（信息科学版）》2010年第8期913-916,1000,共5页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(40871180;40501053);湖南省自然科学基金资助项目(07JJ6075)

摘　　要：提出了一种基于结构化空间关系信息的结点层次匹配方法。指出了在结点匹配中存在的不足,在此基础上,顾及结点及其连接弧段的结构特征,结合距离、拓扑和方向三类约束,对候选匹配点进行逐层筛选,以得到最佳匹配结果。实验表明,该匹配方法是一种行之有效的方法。A hierarchical approach is proposed to match the corresponding nodes from two different datasets.In this approach,node types are first of all distinguished and described,and the limitations of existing description methods are pointed out.On this basis,structural properties of node and its linked segments are considered to build the three geometric constraints,including distance,topology,and direction.They are further used to filter the candidates for matching reference nodes.Indeed,this process is of a hierarchy.Hence,it is also called a hierarchical approach.An experiment is employed to illustrate the rationality of the approach proposed in this paper.

关 键 词：结点 匹配 层次性 结构化空间关系 

分 类 号：P208[天文地球—地图制图学与地理信息工程]