LAUSR

ABSTRACT The growth of georeferenced data sources calls for advanced matching methods to improve the reliability of geospatial data processing, such as map conflation. Existing matching methods mainly focus on similarity measures at the entity scale or area scale. A measure that combines entity-scale and area-scale similarities can provide sound matching results under various circumstances. In this paper, we propose a georeferenced-graph model that integrates multiscale similarities for data matching. Specifically, a match of correspondent data objects is identified by the entity-scale measure under the constraint of the area-scale measure. Nodes in the proposed georeferenced graph model represent polygons by their centroids, whereas the links in the graph connect the nodes (i.e. centroids) according to pre-defined rules. Then, we develop an algorithm to identify many-to-many matches. We demonstrate the proposed graph model and algorithm in real-world experiments using OpenStreetMap data. The experimental results show that the proposed georeferenced-graph model can effectively integrate the context and the location-and-form distance of geospatial data matches across different datasets.