Acta Geodaetica et Cartographica Sinica ›› 2024, Vol. 53 ›› Issue (4): 736-749.doi: 10.11947/j.AGCS.2024.20230316

• Cartography and Geoinformation • Previous Articles     Next Articles

A building aggregation method based on deep clustering of graph vertices

Zhanlong CHEN1,2,3(), Xiechun LU1(), Yongyang XU2,3   

  1. 1.Key Laboratory of Geological Survey and Evaluation of Ministry of Education, China University of Geosciences, Wuhan 430074, China
    2.School of Computer Science, China University of Geoscience, Wuhan 430078, China
    3.National Engineering Research Center of Geographic Information System, Wuhan 430078, China
  • Received:2023-08-07 Revised:2024-02-04 Published:2024-05-13
  • Contact: Xiechun LU E-mail:chenzl@cug.edu.cn;xiechunlu@cug.edu.cn
  • About author:CHEN Zhanlong (1980—), male, PhD, professor, majors in spatial analysis algorithms, spatial reasoning, geographic information system software and application development. E-mail: chenzl@cug.edu.cn
  • Supported by:
    Key Projects of Foundation Improvement Program;The National Natural Science Foundation of China(41871305);The Opening Fund of Key Laboratory of Geological Survey and Evaluation of Ministry of Education(CUG2022ZR06)

Abstract:

Building element aggregation is pivotal for simplifying spatial structures in cartographic generalization. Conventional rule-based aggregation methods often cannot simultaneously consider the morphological and distributional characteristics of the features, because they are heavily influenced by preset algorithm parameters and lack flexibility in the cartographic generalizing process. To fill these limitations, this paper proposes a building aggregation model based on deep clustering of graph vertices. The model utilizes the Delaunay triangulation network to construct a representation graph model of building groups and combines an autoencoder and graph convolutional network to learn the subdivided triangles’ geometric shapes and spatial distribution features. A self-supervised learning approach is employed to cluster and classify the triangles into the categories of “retain” and “delete”. Consequently, it aggregates buildings intelligently in an end-to-end manner without relying on predefined samples. The experimental results demonstrate that the proposed method reduces reliance on preset aggregation parameters while simultaneously considering building elements’ morphology and distribution features. The aggregation process exhibits a certain degree of flexibility, resulting in aggregated buildings better aligning with the requirements of map visualization.

Key words: cartographic generalization, building aggregation, graph neural network, self-supervised learning

CLC Number: