Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStr
- PDF / 2,270,097 Bytes
- 19 Pages / 595.276 x 790.866 pts Page_size
- 48 Downloads / 180 Views
(0123456789().,-volV)(0123456789().,-volV)
METHODOLOGIES AND APPLICATION
Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap Yanhui Wang1
•
Bibo Yu1 • Fuxiao Zhu1 • Jianchen Zhang1 • Chong Huang2
Springer-Verlag GmbH Germany, part of Springer Nature 2020
Abstract 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. Keywords OSM Progressive matching Hierarchical stroke mesh (HSM) Hierarchical partition Multi-scale matching constraint rules
1 Introduction
Communicated by V. Loia. & Chong Huang [email protected] 1
3D Information Collection and Application Key Lab of Education Ministry, Capital Normal University, Beijing 100048, China
2
State Key Lab of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing 100101, China
A city’s road network is the skeleton and lifeline of the entire urban area. Maintaining the currency of multi-scale road network data is the fundamental premise of effective, intelligent traffic management and mobile location services (Safra et al. 2013). However, due to reasons of production, management, and policy, the timeliness of road network updates has not been satisfactory and urban road network data often lags behind (Wu et al. 2017).
Data Loading...
