Matching and aligning features in overlayed coverages
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Finding corresponding objects when integrating several geo-spatial datasets
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Object fusion in geographic information systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
An Integrative Approach to Geospatial Data Fusion
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
Conflation of road network and geo-referenced image using sparse matching
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Gaze map matching: mapping eye tracking data to geographic vector features
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
Integration of two road maps is finding a matching between pairs of objects that represent, in the maps, the same real-world road. Several algorithms were proposed in the past for road-map integration; however, these algorithms are not efficient and some of them even require human feedback. Thus, they are not suitable for many important applications (e.g., Web services) where efficiency, in terms of both time and space, is crucial. This paper presents two efficient algorithms for integrating maps in which roads are represented as polylines. The main novelty of these algorithms is in using only the locations of the endpoints of the polylines rather than trying to match whole lines. Experiments on real-world data are given, showing that our approach of integration based on matching merely endpoints is efficient and accurate (that is, it provides high recall and precision).