An Area Partitioning and Subgraph Growing (APSG) Approach to the Conflation of Road Networks.

Hoa-Hung Nguyen,Han-You Jeong

doi:10.3390/s22041501

Abstract

A road network represents a set of road objects in a geographic area and their interconnections, and it is an essential component of intelligent transportation systems (ITS) enabling emerging new applications such as dynamic route guidance, driving assistance systems, and autonomous driving. As the digitization of geospatial information becomes prevalent, a number of road networks with a wide variety of characteristics may coexist. In this paper, we present an area partitioning and subgraph growing (APSG) approach to the conflation of two road networks with a large difference in the level of details and representation rules. Our area partitioning (AP) scheme partitions the geographic area using the Network Voronoi Area Diagram (NVAD) of the low-detailed road network. Next, a subgraph of the high-detailed road network corresponding to a complex intersection is extracted and aggregated into a supernode so that high precision can be achieved via 1:1 road object matching. For the unmatched road objects due to missing road objects and different representation rules, we also propose a subgraph growing (SG) scheme that sequentially inserts a new road object while keeping the consistency of its connectivity to the matched road objects by the AP scheme. From the numerical results at Yeouido, Seoul, Korea, we show that our APSG scheme can achieve an outstanding matching performance in terms of the precision, recall, and F1-score.

Highlights

Geographic information systems (GIS) provide solutions for capturing, manipulating, analyzing, and visualizing the geospatial data for many application fields, such as transportation, agriculture, commerce, etc. [1,2]
We present an area partitioning and subgraph growing (APSG) approach to the road network conflation (RNC) that consists of two schemes: the area partitioning (AP) scheme for the road network matching (RNM) and the subgraph growing (SG) scheme for the unmatched node-link map (NLM) objects by the AP scheme
If we look at how a true OSM road network (ORN) subgraph is matched to which NLM object, we can classify the matching result into three different cases, as follows: First, a matching scheme successfully finds the NLM object that corresponds to the true ORN subgraph, and the matching result becomes correct match (CM)

Summary

Introduction

Geographic information systems (GIS) provide solutions for capturing, manipulating, analyzing, and visualizing the geospatial data for many application fields, such as transportation, agriculture, commerce, etc. [1,2]. Geographic information systems (GIS) provide solutions for capturing, manipulating, analyzing, and visualizing the geospatial data for many application fields, such as transportation, agriculture, commerce, etc. As the digitization of geospatial information has recently become prevalent, some portal sites or mobile service providers have constructed proprietary GIS that combines authoritative GIS, aerial photos, mobile-mapping service (MMS), crowdsourcing data, etc. The current traffic situation on the road segment is indexed by the corresponding identifier in the road network and broadcast as public transportation data (PTD), which enables novel ITS applications, such as dynamic route guidance [9,10,11,12]

Objectives

Results

Conclusion