基于图卷积自编码器的道路网相似度计算方法

A Road Network Similarity Calculation Method Based on Graph Convolutional Autoencoder

  • 摘要: 道路网空间相似关系计算在空间数据匹配与查询、空间数据多尺度表达与评价及地图综合质量评价等领域均有广泛应用。现有方法存在对空间信息利用不足且特征因子权重设定过于主观等问题,因此引入图卷积自编码器,通过自监督训练尽可能实现原始输入图的重构,克服传统方法局限,进一步提升相似度计算的准确性。基于图卷积自编码器的道路网相似度计算方法,首先进行道路网图建模及节点特征提取,通过交点转边、边转节点的方式建立道路网的对偶图,在此基础上遵循结构的整体与部分关系原则,从全局、局部及连接特征3个方面将道路网空间特征信息赋予对偶图节点,获取道路网图结构的定量化表达;然后进行图自编码器学习,利用图卷积自编码器对道路网图的节点特征和结构信息进行聚合与更新,形成对道路网的深度认知,进而获取道路网空间信息的特征编码,实现道路网结构的量化表征;最后计算道路网相似度,通过平均池化将复杂的高维度特征空间映射至低维易度量空间,生成一组特征向量,并采用余弦相似度计算其相似性。试验结果表明,所提模型输出的相似度具有较高的敏感性与一致性,与道路网实际变化情况吻合度较好,且其评价结果与人类的空间认知规律较为吻合。

     

    Abstract:
    Objectives The calculation of spatial similarity relationship of road networks has wide applications in the fields of spatial data matching and querying, spatial data multi-scale expression and evaluation, and quality evaluation of cartographic generalization. However, the existing similarity calculation methods of road networks have the problems of insufficient utilization of spatial information and subjective setting of the weights of feature factors.
    Methods This paper proposes a road network similarity calculation model based on graph convolutional autoencoder (GCAE). The proposed model employs a self-supervised training strategy to achieve end-to-end learning and strives to reconstruct the original input graph as accurately as possible. As a result, it effectively mitigates the limitations of conventional methods and further improves the accuracy of similarity computation. First, a dual graph of the road network is constructed by converting intersections to edges and edges to nodes. Following the principle of whole-part structural relationships, spatial feature information of the road network is assigned to the dual graph nodes from three aspects, including global, local, and connectivity features, thereby obtaining a quantitative representation of the road network graph structure. Then, GCAE is employed to aggregate and update the node features and structural information of the road network graph, forming a deep understanding of the road network. This process yields a feature encoding of the spatial information, achieving a quantifiable representation of the road network structure. Finally, the complex high-dimensional feature space is mapped by average pooling to a low-dimensional, easily measurable space, generating a set of feature vectors. Cosine similarity is then applied to compute the similarity between road networks.
    Results The experimental results demonstrate that the similarity values generated by the proposed model exhibit high sensitivity and consistency, align closely with actual road network changes, and correspond well with human spatial cognitive patterns.
    Conclusions The proposed model offers a high degree of automation and yields intuitive, well-founded results, effectively mitigating the need for handcrafted features and rule-based designs in road network similarity calculation.

     

/

返回文章
返回