利用改进的Hausdorff距离匹配多尺度线要素  

Multi-scale Linear Feature Matching Using Improved Hausdorff Distance

作　　者：铁占琦 TIE Zhanqi(Henan Nonferrous Metals Geology and Mineral Resources Bureau,Zhengzhou 450000,China)

机构地区：[1]河南省有色金属地质矿产局,河南郑州450000

出　　处：《地理空间信息》2024年第5期62-65,共4页Geospatial Information

基　　金：2021年度河南省财政地质勘查资助项目(2021-6)。

摘　　要：传统Hausdorff距离对噪声较敏感,在进行多尺度线要素匹配时,易导致漏匹配和误匹配。为提高匹配正确率,提出了一种改进的Hausdorff距离算法。针对部分匹配问题,采用曲线分割算法,以短曲线分割长曲线;针对点位分布差异问题,采用曲线加密算法,以匹配曲线的中间节点进行双向加密;针对曲线点集自身的噪声问题,以距离集合的中位数作为相似性指标,判断匹配要素是否为同名要素。选取不同尺度的行政区划界线和道路网数据进行匹配,以验证该算法。结果表明,该算法具有较好的匹配效果。In the matching process of multi-scale linear feature,traditional Hausdorff distance is prone to be affected by noisy data.In order to improve the robustness of algorithm,we proposed an improved Hausdorff distance algorithm.Considering the problem of partial matching,we used the curve segmentation algorithm to segment the long curve with short curve.Aiming at the difference problem of point distribution,we used the curve encryption algorithm to gather the curve with the center node.With respect to the noise magnitude of curve points set,taking the median of distance set as the similarity index,we judged whether the matching features were the same.We selected different scales of administrative boundaries and road network data to validate the performance of proposed algorithm.The result indicates that the algorithm can effectively solve the matching problem of multi-scale linear feature.

关 键 词：多尺度线要素 要素匹配 HAUSDORFF距离 相似性指标 

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