Detecting Corresponding Vertex Pairs between Planar Tessellation Datasets with Agglomerative Hierarchical Cell-Set Matching

PLoS One. 2016 Jun 27;11(6):e0157913. doi: 10.1371/journal.pone.0157913. eCollection 2016.

Abstract

This paper proposes a method to detect corresponding vertex pairs between planar tessellation datasets. Applying an agglomerative hierarchical co-clustering, the method finds geometrically corresponding cell-set pairs from which corresponding vertex pairs are detected. Then, the map transformation is performed with the vertex pairs. Since these pairs are independently detected for each corresponding cell-set pairs, the method presents improved matching performance regardless of locally uneven positional discrepancies between dataset. The proposed method was applied to complicated synthetic cell datasets assumed as a cadastral map and a topographical map, and showed an improved result with the F-measures of 0.84 comparing to a previous matching method with the F-measure of 0.48.

MeSH terms

  • Algorithms*
  • Datasets as Topic*
  • Maps as Topic

Grants and funding

This research was supported by a grant (15CHUD-C061156-05) from National Spatial Information Research Program funded by the Ministry of Land, Infrastructure, and Transport of Korean government and Korea Cadastral Surveying Corp. Korea Cadastral Surveying Corp. provided support in the form of salaries for some authors [YH, WP], but did not have any additional role in the study design, data collection and analysis, decision to publish, or preparation of the manuscript. The specific roles of the authors are articulated in the author contribution section.