Acta Geodaetica et Cartographica Sinica ›› 2026, Vol. 55 ›› Issue (1): 169-180.doi: 10.11947/j.AGCS.2026.20250296

• Cartography and Geoinformation • Previous Articles    

A self-supervised matching method for polygonal geographic entity based on a three-branch attention network

Zhuang SUN1,2(), Po LIU1,2, Liang ZHAI1,2(), Yu HE3, Zutao ZHANG1   

  1. 1.Chinese Academy of Surveying and Mapping, Beijing 100036, China
    2.State Key Laboratory of Spatial Datum, Beijing 100036, China
    3.School of Future Technology, China University of Geosciences, Wuhan 430074, China
  • Received:2025-08-12 Revised:2026-01-05 Published:2026-02-13
  • Contact: Liang ZHAI E-mail:13236856636@163.com;zhailiang@casm.ac.cn
  • About author:SUN Zhuang (2000—), male, postgraduate, majors in data association of geographic entity. E-mail: 13236856636@163.com
  • Supported by:
    Fundamental Research Funds of Chinese Academy of Surveying and Mapping(AR2414);3D Real Scene China Construction Project(A2505)

Abstract:

Geographic entity are important data outputs of 3D realistic geospatial scenes. Due to scale differences in the spatial expression of polygonal entities with the same name across datasets from different scenarios, geographic entity matching technology is required to support data fusion and updating. Aiming at the current situation that existing polygonal entity matching methods still have room for optimization in breaking away from manual dependence and realizing refined and differentiated modeling of multiple matching relationships (1∶1, 1∶M, MN), this paper proposes a self-supervised matching method for polygonal geographic entity based on a three-branch attention network. First, it calculates the similarity of four types of features: size, distance, shape, and direction. For each type of feature, the standard deviation is computed based on the number of matched entity pairs under different thresholds. A loss function is constructed using this standard deviation to train the model and obtain decision thresholds, and entity pairs whose similarity meets the decision thresholds are converted into pseudo-labels. Second, a matching network with a three-branch structure is built to handle 1∶1, 1∶M, and MN matching relationships respectively. This network integrates the attention mechanism and gradient-weighted class activation mapping (Grad-CAM) to adaptively assign weights to each feature. Finally, two types of data—construction land and engineering project land in Huangshan city, Anhui province—are selected as experimental data to conduct verification on the pseudo-labels, feature weight assignment, and the three-branch network framework respectively. The experimental results show that compared with existing methods, the proposed method in this paper does not require manual annotation, can adaptively achieve matching for multiple matching relationships (1∶1, 1∶M, MN), and achieves a precision (P) of 94.98%, recall (R) of 94.22%, and F1 score of 94.60%. Its effectiveness is verified, and it can provide strong support for the fusion and updating of polygonal geographic entity data.

Key words: polygonal geographic entity matching, pseudo-labels, self-supervised learning, attention mechanism

CLC Number: