Noisy road network matching

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

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルGeographic Information Science - 5th International Conference, GIScience 2008, Proceedings
出版社Springer Verlag
ページ38-54
ページ数17
ISBN(印刷版)3540874720, 9783540874720
DOI
出版ステータスPublished - 2008
外部発表はい
イベント5th International Conference on Geographic Information Science, GIScience 2008 - Park City, UT, United States
継続期間: 2008 9月 232008 9月 26

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5266 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other5th International Conference on Geographic Information Science, GIScience 2008
国/地域United States
CityPark City, UT
Period08/9/2308/9/26

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Noisy road network matching」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル