Matching of road data with different scales for updating

Yungang Hu, Jun Chen, Zhilin Li, Renliang Zhao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

GIS data can be updated using the larger scale GIS data based on map generalization. Matching is a critical first step for extracting updates in this process. This paper presents an approach for road data matching based on level analysis. Matches of objects between road networks are divided into three levels, i.e. decomposed level, basic level and abstracted level. The matching of edge end point as the decomposed level, the node matching as the basic level, and the route matching and between node and edge matching as the abstracted level are discovered. Based on the order relationship of three matching levels and the interdependent among them, matches of objects are accomplished by a set of algorithms developed. Meanwhile during this process, the exceptional matching can be as the index for manual checking to improve the matching accuracy. Matches of objects meet the requirement for searching data unmatched. The experiment results of matching road data at 1:10,000 and 1:50,000 show higher matching accuracy.
Original languageEnglish
Title of host publicationGeoinformatics 2007
Subtitle of host publicationGeospatial Information Science
Volume6753
EditionPART 1
DOIs
Publication statusPublished - 26 Nov 2007
EventGeoinformatics 2007: Geospatial Information Science - Nanjing, China
Duration: 25 May 200727 May 2007

Conference

ConferenceGeoinformatics 2007: Geospatial Information Science
Country/TerritoryChina
CityNanjing
Period25/05/0727/05/07

Keywords

  • Map generalization
  • Node matching
  • Road matching
  • Route matching
  • Updating data

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this