Matching authority and VGI road networks using an extended node-based matching algorithm |
| |
| Authors: | Ehsan Abdolmajidi Ali Mansourian Julian Will Lars Harrie |
| |
| Institution: | 1. GIS Center, Department of Physical Geography and Ecosystem Science, Lund University, S?lvegatan 12, 22362 Lund, Swedenehsan.abdolmajidi@nateko.lu.se;3. GIS Center, Department of Physical Geography and Ecosystem Science, Lund University, S?lvegatan 12, 22362 Lund, Sweden |
| |
| Abstract: | The amount of volunteered geographic information (VGI) has increased over the past decade, and several studies have been conducted to evaluate the quality of VGI data. In this study, we evaluate the completeness of the road network in the VGI data set OpenStreetMap (OSM). The evaluation is based on an accurate and efficient network-matching algorithm. The study begins with a comparison of the two main strategies for network matching: segment-based and node-based matching. The comparison shows that the result quality is comparable for the two strategies, but the node-based result is considerably more computationally efficient. Therefore, we improve the accuracy of node-based algorithm by handling topological relationships and detecting patterns of complicated network components. Finally, we conduct a case study on the extended node-based algorithm in which we match OSM to the Swedish National Road Database (NVDB) in Scania, Sweden. The case study reveals that OSM has a completeness of 87% in the urban areas and 69% in the rural areas of Scania. The accuracy of the matching process is approximately 95%. The conclusion is that the extended node-based algorithm is sufficiently accurate and efficient for conducting surveys of the quality of OSM and other VGI road data sets in large geographic regions. |
| |
| Keywords: | geographic data volunteered geographic information (VGI) OpenStreetMap (OSM) node-based matching segment-based matching pattern detection Swedish National Road Database (NVDB) |
|
|
