Skip to main content
Log in

Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • An X, Sun Q, Xiao Q et al (2011) A shape multilevel description method and application in measuring geometry similarity of multi-scale spatial data. Acta Geodaetica Cartogr Sin 40(4):495–501,508

    Google Scholar 

  • Chehreghan A, Abbaspour RA (2018) A geometric-based approach for road matching on multi-scale datasets using a genetic algorithm. Cartogr Geogr Inf Sci 45(3):255–269

    Article  Google Scholar 

  • Fan H, Yang B, Zipf A et al (2016) A polygon-based approach for matching openstreetmap road networks with regional transit authority data. Int J Geogr Inf Sci 30(4):748–764

    Article  Google Scholar 

  • Fu Z, Yang Y, Gao X et al (2016) An Optimization algorithm for multi-characteristics road network matching. Acta Geod Cartogr Sinia 45(5):608–615

    Google Scholar 

  • Goesseln GV, Sester M (2003) Change detection and integration of topographic updates from ATKIS to geoscientific data sets. In: Proceedings of international conference on next generation geospatial information. International conference on next generation geospatial information, Boston

  • Guo QS, Xu XL, Wang Y et al (2020) Combined matching approach of road networks under different scales considering constraints of cartographic generalization. IEEE ACCESS 8:944–956

    Article  Google Scholar 

  • Huang B, Zhong W, Zhai R et al (2018) Hierarchical area partitioning method of urban road networks matching. Acta Geod Cartogr Sinia 47(11):1526–1536

    Google Scholar 

  • Jovanovic U, Shayanfar E, Schonfeld PM (2018) Selecting and Scheduling Link and Intersection Improvements in Urban Networks. Transport Res Rec 2672(51):1–11

    Article  Google Scholar 

  • Liu H, Qian H, Wang X et al (2015) Road networks global matching method using analytical hierarchy process. Geomat Inf Sci Wuhan Univ 40(5):644–651

    Google Scholar 

  • Liu C, Qian H, Wang X et al (2016) A linkage matching method for road networks considering the similarity of upper and lower spatial relation. Acta Geod Cartogr Sinia 45(11):1371–1383

    Google Scholar 

  • Ma C, Sun Q, Xu Q (2017) An approach for volunteered geographic information quality evaluation based on reference data. Geomat Spat Inf Technol 3:1–5

    Google Scholar 

  • Safra E, Kanza Y, Sagiv Y et al (2013) Ad hoc matching of vectorial road networks. Int J Geogr Inf Sci 27(1):114–153

    Article  Google Scholar 

  • Senaratne H, Mobasheri A, Ahmed L et al (2017) A review of volunteered geographic information quality assessment methods. Int J Geogr Inf Sci 31(1):139–167

    Article  Google Scholar 

  • Teng W, Wang Y (2019) Real-time map matching: a new algorithm integrating spatio-temporal proximity and improved weighted circle. Open Geosci 11(1):288–297

    Article  Google Scholar 

  • Teng W, Wang Y, Yu B et al (2020) ICCIU: a new real-time lane-level positioning algorithm. IEEE Access. 8(1):44957–44966

    Article  Google Scholar 

  • Thomson RC (2006) The’ stroke’ concept in geographic network generalization and analysis. In: Riedl A, Kainz W, Elmes GA (eds) Progress in spatial data handling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-35589-8_43

  • Tian W, Zhu X, Guo W (2014) A VGI vector road data increment distinguishing research based on multilevel spreading algorithm. Geomat Inf Sci Wuhan Univ 39(08):963–967+973

    Google Scholar 

  • Wang Y, Yin C, Ding Y (2015) Multi-scale extraction for the road network incremental information in navigation electronic map. J Southwest Jiaotong Univ 4:590–596

    Google Scholar 

  • Wang Y, Zhang Q, Guan H (2018) Incrementally detecting change types of spatial area object: a hierarchical matching method considering change process. ISPRS Int J Geo-Inf 7(2):1–14

    Google Scholar 

  • Wu T, Xiang L, Gong J (2017) Renewal of road networks using map-matching technique of trajectories. Acta Geod Cartogr Sinia 46(4):507–515

    Google Scholar 

  • Wu Q, Wu Z, Zhang L (2019) GPS trajectory agglomeration and refined road network extraction. Acta Geod Cartogr Sinia 48(4):502–511

    Google Scholar 

  • Xing H, Meng Y, Chen J (2018) Employing incremental outlines for OpenStreetMap data updating. ISPRS Int J Geo-Inf 7(7):e 277

    Article  Google Scholar 

  • Xu Y, Xie Z, Chen Z et al (2017) Shape similarity measurement model for holed polygons based on position graphs and fourier descriptors. Int J Geogr Inf Sci 31(2):253–279

    Article  Google Scholar 

  • Yang B, Yi Zhang, Luan X (2013a) A probabilistic relaxation approach for matching road networks. Int J Geogr Inf Sci 27(2):319–338

    Article  Google Scholar 

  • Yang M, Ai T, Zhou Q (2013b) A method of road network generalization considering stroke properties of road object. Acta Geod Cartogr Sinia 42(04):581–587+594

    Google Scholar 

  • Yang W, Ai T, Lu W (2018) A method for extracting road boundary information from crowdsourcing vehicle GPS trajectories. Sensors 18(4):1261

    Article  Google Scholar 

  • Yin C, Wang Y (2014) Target geometry matching threshold in incremental updating of road networks based on OSTU. Geomat Inf Sci Wuhan Univ 39(9):1061–1067

    Google Scholar 

  • Zhang Y, Yang B, Luan X (2012) Automatic Matching Urban Road Networks Using Probabilistic Relaxation[J]. Acta Geodaetica et Cartographica Sinica 41(6):933–939

    Google Scholar 

  • Zhang J, Wang Y, Zhao W (2018) An improved probabilistic relaxation method for matching multi-scale road networks. Int J Digital Earth 11(6):635–655

    Article  Google Scholar 

  • Zhou Q, Li Z (2012) A comparative study of various strategies to concatenate road segments into strokes for map generalization. Int J Geogr Inf Sci 26(4):691–715

    Article  MathSciNet  Google Scholar 

  • Zhu F, Wang Y (2017) On the comprehensive evaluation of the data quality for OSM road network from the perspective of multi-level and multi-granularity. J Geo-Inf Sci 19(11):1422–1432

    Google Scholar 

Download references

Funding

National Key R&D Program of China (Grant No. 2018YFB0505400); National Natural Science Foundation of China (Grant No. 41771157); the Great Wall Scholars Program (Grant No. CIT&TCD20190328); Key Research Projects of National Statistical Science of China (Grant No. 2018LZ27); Research project of Beijing Municipal Education Committee (Grant No. KM201810028014); Young Yanjing Scholar Project (Grant No. Capital Normal University); Academy for Multidisciplinary Studies(Grant No. Capital Normal University).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chong Huang.

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Yu, B., Zhu, F. et al. Hierarchical stroke mesh: a new progressive matching method for detecting multi-scale road network changes using OpenStreetMap. Soft Comput 25, 3155–3173 (2021). https://doi.org/10.1007/s00500-020-05371-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05371-z

Keywords

Navigation