Browse > Article
http://dx.doi.org/10.7848/ksgpc.2013.31.4.285

Road network data matching using the network division technique  

Huh, Yong (Engineering Research Institute, Seoul National Univ.)
Son, Whamin (Dept. of Civil and Environmental Engineering, Seoul National Univ.)
Lee, Jeabin (Department of Civil Engineering, Mokpo National Univ.)
Publication Information
Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography / v.31, no.4, 2013 , pp. 285-292 More about this Journal
Abstract
This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.
Keywords
Network matching; Network division; Intersection-based graph clustering; Iterative Closest Point; Hausdorff Distance;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Besl, P. and McKay, N. (1992), A method for registration of 3-D shapes, IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 14, No. 2, pp. 239-256.   DOI   ScienceOn
2 Huh, Y., Yu, Y. and Heo, J. (2011), Detecting conjugate-point pairs for map alignment between two polygon datasets, Computers, Environment and Urban Systems, Vol. 35, No. 3, pp. 250-262.   DOI   ScienceOn
3 Li, L. and Goodchild, M. (2011), An optimisation model for linear feature matching in geographical data conflation. International Journal of Image and Data Fusion, Vol. 2, No. 4, pp. 309-328.   DOI
4 Mantel, D. and Lipeck, U. (2004), Matching cartographic objects in spatial databases. Proceedings of the XXth Congress of the ISPRS, Istanbul, Turkey, pp. 172-176.
5 Min, D. Zhilin, L. and Xiaoyong, C. (2007), Extended Hausdorff distance for spatial objects in GIS, International Journal of Geographical Information Science, Vol. 21, No. 4, pp. 459-475.   DOI   ScienceOn
6 Rosen, B. and Saalfeld, A. (1985), Match criteria for automatic alignment, Proceedings of Auto-Carto 7, 11-14 March, Washington, D.C., pp. 1-20.
7 Rucklidge, W. (1996), Efficient visual recognition using the Hausdorff distance, Springer, New York, N.Y., 95 p.
8 Saalfeld, A. (1988), Conflation automated map compilation, International Journal of Geographical Information Science, Vol. 2, No. 3, pp. 217-228.   DOI
9 Stigmar, H. (2005), Matching route data and topographic data in a real-time environment. Proceeding of the Xth Scandinavian research conference on geographical information science, Stockholm, Sweden, pp. 89-107.
10 Timpf, S. (1998), Hierarchical structures in map series, Ph.D The technical university of vienna
11 Walter, V., and Fritsch, D. (1999), Matching spatial data sets: a statistical approach, International Journal of Geographical Information Science, Vol. 13, No. 5, pp. 445-473.   DOI   ScienceOn
12 Zhang, M. and Meng, L. (2007), An iterative road-matching approach for the integration of postal data. Computers, Environment and Urban Systems, Vol. 31, No.5, pp. 597- 615.   DOI   ScienceOn
13 Yang, B., Zhang, Y. and Luan, X. (2013), A probabilistic relaxation approach for matching road networks, International Journal of Geographical Information Science, Vol. 27, No, 2, pp. 319-338.   DOI