Noisy road network matching

Yago Diez, Mario A. Lopez, J. Antoni Sellarès

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Let and be two road networks represented in vector form and covering rectangular areas R and R′, respectively, not necessarily parallel to each other, but with R′ ∈ R. We assume that and use different coordinate systems at (possibly) different, but known scales. Let and denote sets of "prominent" road points (e.g., intersections) associated with and , respectively. The positions of road points on both sets may contain a certain amount of "noise" due to errors and the finite precision of measurements. We propose an algorithm for determining approximate matches, in terms of the bottleneck distance, between and a subset of . We consider the characteristics of the problem in order to achieve a high degree of efficiency. At the same time, so as not to compromise the usability of the algorithm, we keep the complexity required for the data as low as possible. As the algorithm that guarantees to find a possible match is expensive due to the inherent complexity of the problem, we propose a lossless filtering algorithm that yields a collection of candidate regions that contain a subset S of such that may match a subset of S. Then we find possible approximate matchings between and subsets of S using the matching algorithm. We have implemented the proposed algorithm and report results that show the efficiency of our approach.

Original languageEnglish
Title of host publicationGeographic Information Science - 5th International Conference, GIScience 2008, Proceedings
PublisherSpringer Verlag
Pages38-54
Number of pages17
ISBN (Print)3540874720, 9783540874720
DOIs
Publication statusPublished - 2008
Event5th International Conference on Geographic Information Science, GIScience 2008 - Park City, UT, United States
Duration: 2008 Sep 232008 Sep 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5266 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Geographic Information Science, GIScience 2008
CountryUnited States
CityPark City, UT
Period08/9/2308/9/26

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Noisy road network matching'. Together they form a unique fingerprint.

Cite this