skip to main content
10.1145/1463434.1463493acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
poster

An automatic approach to integrate routing-relevant information from different resources

Authors Info & Claims
Published:05 November 2008Publication History

ABSTRACT

With the growing demand on multi-purpose or multi-modal navigation, the route calculation becomes more and more complex. The currently operational route planning algorithms reveal rather limited performances due to unavailable or insufficient interoperation among the underlying datasets that are separately maintained in different spatial databases. This paper introduces an operational approach to integrate routing-relevant information from different data sources. It involves three processes: (a) automatic matching to identify the corresponding road objects between different datasets; (b) interaction to refine the result of automatic matching; and (c) transferring the routing-relevant information from one dataset to another. In process (a), our Delimited Stroke Oriented (DSO) algorithm is employed to achieve the automatic data matching. It has revealed a high matching rate and certainty. However uncertain matching problems occur in areas where topological conditions are too complicated or inconsistent. The remaining unmatched or wrongly matched objects are treated in process (b) with the help of a series of our interaction tools plugged in Arc GIS 9.0. On the basis of the refined matching results, process (c) is dedicated to automatic integration of the routing-relevant information from different data sources. In large test areas from a number of federal states in Germany, the proposed automatic approach has been successfully applied to transfer the routing-relevant information from the dataset of Tele Atlas to DLM De. The enriched DLM De thus gains added value for route calculations.

References

  1. Butenuth, M., Gösseln, G.v., Tiedge, M., Heipke C., Lipeck, U., Sester M. 2007. Integration of heterogeneous geospatial data in a federated database. ISPRS Journal of Photogrammetry & Remote Sensing 62 (2007) 328--346Google ScholarGoogle Scholar
  2. Gösseln, G.v. & Sester, M. 2004: Intergration of geoscientific data sets and the German digital map using a matching approach, XXth ISPRS Congress, 12--23 July 2004 Istanbul, Turkey, 1249--1254Google ScholarGoogle Scholar
  3. Stigmar, H. 2006: Some Aspects of Mobile Map Services, Licentiate Dissertation, ISSN 1652--4810, Lund University, SwedenGoogle ScholarGoogle Scholar
  4. Volz, S. 2006: An iterative approach for matching multiple representations of street data. Hampe, M., Sester, M. and Harrie, L. (eds.): ISPRS Vol. XXXVI., ISPRS Workshop - Multiple representation and interoperability of spatial data; Feb. 22--24, 2006, Hannover, GermanyGoogle ScholarGoogle Scholar
  5. Walter, V. & Fritsch, D. 1999: Matching Spatial Data Sets: a Statistical Approach, International Journal for Geographical Information Science, Vol. 13, No. 5, 445--473Google ScholarGoogle ScholarCross RefCross Ref
  6. Zhang M. & Meng L. 2007: An iterative road-matching approach for the integration of postal data, Computers, Environment and Urban Systems, volume 31/5 pp. 598--616, ElsevierGoogle ScholarGoogle Scholar
  7. Zhang M. & Meng L. 2008. Delimited Stroke Oriented Algorithm - Working principle and implementation for the matching of road networks. Journal of Geographic Information Science (in press)Google ScholarGoogle Scholar

Index Terms

  1. An automatic approach to integrate routing-relevant information from different resources

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
        November 2008
        559 pages
        ISBN:9781605583235
        DOI:10.1145/1463434

        Copyright © 2008 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 5 November 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        Overall Acceptance Rate220of1,116submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader