An iterative approach based on contextual information for matching multi‐scale polygonal object datasets
- 11 June 2020
- journal article
- research article
- Published by Wiley in Transactions in GIS
- Vol. 24 (4) , 1047-1072
Abstract
Object matching facilitates spatial data integration, updating, evaluation, and management. However, data to be matched often originate from different sources and present problems with regard to positional discrepancies and different levels of detail. To resolve these problems, this article designs an iterative matching framework that effectively combines the advantages of the contextual information and an artificial neural network. The proposed method can correctly aggregate one‐to‐many (1:N) and many‐to‐many (M:N) potential matching pairs using contextual information in the presence of positional discrepancies and a high spatial distribution density. This method iteratively detects new landmark pairs (matched pairs), based on the prior landmark pairs as references, until all landmark pairs are obtained. Our approach has been experimentally validated using two topographic datasets at 1:50 and 1:10k. It outperformed a method based on a back‐propagation neural network. The precision increased by 4.5% and the recall increased by 21.6%, respectively.Keywords
Funding Information
- National Natural Science Foundation of China (41201409)
- National Natural Science Foundation of China (41561084)
- National Natural Science Foundation of China (41661083)
This publication has 43 references indexed in Scilit:
- A polygon-based approach for matching OpenStreetMap road networks with regional transit authority dataInternational Journal of Geographical Information Science, 2015
- Integration of heterogeneous geospatial data in a federated databaseISPRS Journal of Photogrammetry and Remote Sensing, 2007
- Finding corresponding objects when integrating several geo-spatial datasets2005
- Object Fusion in Geographic Information Systems2004
- Argument free clustering for large spatial point-data sets via boundary extraction from Delaunay DiagramComputers, Environment and Urban Systems, 2002
- ON DELETION IN DELAUNAY TRIANGULATIONSInternational Journal of Computational Geometry & Applications, 2002
- A rubber sheeting algorithm for non-rectangular mapsComputers & Geosciences, 2000
- Landmarks as Navigational Aids on Street MapsCartography and Geographic Information Systems, 1996
- An efficiently computable metric for comparing polygonal shapesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Computing Dirichlet tessellationsThe Computer Journal, 1981