Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap
文献类型：期刊论文
| 作者 | Wang, Yanhui2; Yu, Bibo2; Zhu, Fuxiao2; Zhang, Jianchen2; Huang, Chong1 |
| 刊名 | SOFT COMPUTING
 |
| 出版日期 | 2020-10-15 |
| 页码 | 19 |
| 关键词 | OSM Progressive matching Hierarchical stroke mesh (HSM) Hierarchical partition Multi-scale matching constraint rules |
| ISSN号 | 1432-7643 |
| DOI | 10.1007/s00500-020-05371-z |
| 通讯作者 | Huang, Chong(huangch@lreis.ac.cn) |
| 英文摘要 | Spatial feature matching is the key to detecting incremental changes in spatial data and extracting the updated information. The accuracy of spatial feature matching can depend on the structural organization of the data being compared; inconsistent data structures make comparison more difficult. OpenStreetMap (OSM) road network data, for example, is updated frequently to the point of being unstable, making the matching process used in information extraction susceptible to interference. To use OSM for comparison with other road data sources, this problem must be addressed. This paper proposes a new multi-scale dynamic matching algorithm based on a hierarchical stroke mesh (HSM) to detect matches between OSM data and professional surveying and mapping data and to update the change information. By improving the integrity and continuity of the stroke generation method and its algorithm for evaluating the importance of information, the algorithm proposed in this paper identifies the spatial hierarchy contained in the road network and abstracts the road network. The result is the HSM. The algorithm is based on multi-scale matching constraint rules designed from coarse to fine in terms of both resolution and granularity. It is used to detect one-to-one or one-to-many mapping relationships among different mesh levels (mesh, mesh boundary segment, and mesh inner segment). This allows progressive iterative matching between the older survey data and the newer OSM data. The results show that the HSM algorithm proposed in this paper can detect incremental changes between the two vector data sources quickly and accurately. Compared with others, this algorithm can effectively improve matching accuracy while sacrificing little performance. |
| 资助项目 | National Key R&D Program of China[2018YFB0505400] ; National Natural Science Foundation of China[41771157] ; Great Wall Scholars Program[CITTCD20190328] ; Key Research Projects of National Statistical Science of China[2018LZ27] ; Research project of Beijing Municipal Education Committee[KM201810028014] ; Young Yanjing Scholar Project ; Academy for Multidisciplinary Studies |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000577861300002 |
| 出版者 | SPRINGER |
| 资助机构 | National Key R&D Program of China ; National Natural Science Foundation of China ; Great Wall Scholars Program ; Key Research Projects of National Statistical Science of China ; Research project of Beijing Municipal Education Committee ; Young Yanjing Scholar Project ; Academy for Multidisciplinary Studies |
| 源URL | [http://ir.igsnrr.ac.cn/handle/311030/157079]  |
| 专题 | 中国科学院地理科学与资源研究所 |
| 通讯作者 | Huang, Chong |
| 作者单位 | 1.Chinese Acad Sci, Inst Geog Sci & Nat Resources Res, State Key Lab Resources & Environm Informat Syst, Beijing 100101, Peoples R China 2.Capital Normal Univ, Educ Minist, 3D Informat Collect & Applicat Key Lab, Beijing 100048, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wang, Yanhui,Yu, Bibo,Zhu, Fuxiao,et al. Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap[J]. SOFT COMPUTING,2020:19. |
| APA | Wang, Yanhui,Yu, Bibo,Zhu, Fuxiao,Zhang, Jianchen,&Huang, Chong.(2020).Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap.SOFT COMPUTING,19. |
| MLA | Wang, Yanhui,et al."Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap".SOFT COMPUTING (2020):19. |
入库方式： OAI收割
来源：地理科学与资源研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。