Methods and Implementations of Road-Network Matching

Meng Zhang · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · 2009

Data matching is one of the fundamental measures that helps make different data sets interoperable. This thesis is devoted to a new contextual matching approach for road networks. This automatic matching process is based on the Delimited-Stroke-Oriented algorithm and flanked by three assistant methodologies: matching guided by ‘structure’, matching guided by ‘semantics’, and matching guided by ‘spatial index’: Being supported by the extendable delimited strokes, network-based matching and the three assistant methodologies, the contextual matching approach is able to handle geometrical, topological and semantic information in a large matching environment and provide a considerably improved matching performance in terms of ‘automatic matching rate and certainty’, ‘high computing speed’, and ‘robustness and generic nature’. Due to its large potentials of enriching mega data sets, the contextual matching approach is being commercialized.

Read the paper · More papers on PaperTik