DOI QR코드

DOI QR Code

Development of polygon object set matching algorithm between heterogeneous digital maps - using the genetic algorithm based on the shape similarities

형상 유사도 기반의 유전 알고리즘을 활용한 이종 수치지도 간의 면 객체 집합 정합 알고리즘 개발

  • 허용 (서울대학교 공학연구소) ;
  • 이재빈 (목포대학교 토목공학과)
  • Received : 2012.12.10
  • Accepted : 2013.02.25
  • Published : 2013.02.28

Abstract

This paper proposes a matching algorithm to find corresponding polygon feature sets between heterogeneous digital maps. The algorithm finds corresponding sets in terms of optimizing their shape similarities based on the assumption that the feature sets describing the same entities in the real world are represented in similar shapes. Then, by using a binary code, it is represented that a polygon feature is chosen for constituting a corresponding set or not. These codes are combined into a binary string as a candidate solution of the matching problem. Starting from initial candidate solutions, a genetic algorithm iteratively optimizes the candidate solutions until it meets a termination condition. Finally, it presents the solution with the highest similarity. The proposed method is applied for the topographical and cadastral maps of an urban region in Suwon, Korea to find corresponding polygon feature sets for block areas, and the results show its feasibility. The results were assessed with manual detection results, and showed overall accuracy of 0.946.

본 연구는 유전 알고리즘을 이용하여 다대다 면 객체 정합을 수행하는 방법을 제안한다. 동일한 지형 지물을 표현하는 객체 집합의 형상은 서로 동일하다는 가정 하에 형상 유사도를 최적화하는 객체 집합을 두 지도 사이에서 탐색함으로써 정합을 수행한다. 이 때 어떤 객체가 객체 집합에 포함되는지의 여부를 이진 부호로 표현하고, 이진 부호들을 결합한 이진 문자열로 후보해를 표현한다. 초기 후보해들로 해집단을 생성한 뒤, 유전 알고리즘에 의하여 점진적으로 해집단의 품질을 개선함으로써 최적해를 탐색하였다. 제안된 방법을 평가하기 위하여 수원시 도심지역의 수치지형도와 지적도에서 가구계 대응 면 객체 집합을 탐색하였으며 제안된 알고리즘의 효용성을 확인할 수 있었다. 또한 수작업에 의한 탐색결과를 이용하여 평가한 결과 0.946의 정확도를 얻었다.

Keywords

Acknowledgement

Supported by : 한국연구재단

References

  1. Bel Hadj Ali, A. (2002), Moment representation of polygons for the assessment of their shape quality, Journal of Geographical Systems, Vol. 4 No. 3, pp. 209-232. https://doi.org/10.1007/s101090100067
  2. Burrough, P.A. and Frank, A.U. (1996), Geographic Objects with Indeterminate Boundaries, GISDATA Series vol. 2, Taylor & Francis, London, UK
  3. Butenuth, M., von Gosseln, G., Tiedge, M., Heipke, C., Lipeck, U. and Sester, M. (2007), Integration of heterogeneous geospatial data in a federated database, ISPRS Journal of Photogrammetry and Remote Sensing, Vol. 62, No. 5, pp. 328-346. https://doi.org/10.1016/j.isprsjprs.2007.04.003
  4. Huh, Y., Yu, K. and Heo, J. (2011), Detecting conjugatepoint pairs for map alignment between two polygon datasets, Environment and Urban Systems, Vol. 35, No. 3, pp. 250-262. https://doi.org/10.1016/j.compenvurbsys.2010.08.001
  5. 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.
  6. Moon, B. (2008), IT Cookbook 81: Genetic algorithm with evolutionary approach, Hanbit Media Inc., Seoul, Korea
  7. Reimann, C., Filzmoser, P. and Garrett, R. G. (2005), Background and threshold:Cr itical comparison of methods of determination, Science of the Total Environment, Vol. 345, No. 1-3, pp. 1-6. https://doi.org/10.1016/j.scitotenv.2004.10.014
  8. Stigmar, H. (2005), Matching route data and topographic data in a real-time environment, Processing of the Xth Scandinavian research conference on geographical information science, Stockholm, Sweden, pp. 89-107.
  9. 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. https://doi.org/10.1080/136588199241157
  10. Zhang, M. and Meng, L. (2007), An iterative roadmatching approach for the integration of postal data. Computers, Environment and Urban Systems, Vol. 31, No.5, pp. 597-615. https://doi.org/10.1016/j.compenvurbsys.2007.08.008

Cited by

  1. 계층적 매칭 기법을 이용한 수치지도 건물 폴리곤 데이터의 자동 정합에 관한 연구 vol.33, pp.1, 2015, https://doi.org/10.7848/ksgpc.2015.33.1.45