The road network similarity calculation based on autoencoders and its application in map generalization quality evaluation

Spatial similarity underpins multi-scale data representation and cartographic quality assessment. However, evaluating the similarity of structurally intricate road networks using conventional approaches often falls short due to inadequate spatial feature extraction and subjective weighting. To address this, we introduce a graph convolutional autoencoder (GCAE) model for road network similarity computation. The model learns deep spatial representations via self-supervised training, combining graph convolutions for feature extraction with autoencoders for graph reconstruction. Similarity is quantified using latent-space cosine similarity and validated against geometric and topological baselines, as well as human perception. Furthermore, we construct a multi-scale road network standard library to mathematically model the relationship between similarity and scale variation, serving as a benchmark for cartographic quality evaluation. Applied to Chengdu and Hefei, the framework assesses map generalization quality via deviation and evaluation-set methods. The results align closely with geographic evolution and human judgment, delivering objective, robust metrics that significantly enhance the intelligence of automated map generalization.

Institutions

Publication Details

Journal
Cartography and Geographic Information Science
Published
2026-08-25
DOI
https://doi.org/10.1080/15230406.2026.2715787
Primary Topic
Automated Road and Building Extraction
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The road network similarity calculation based on autoencoders and its application in map generalization quality evaluation

Cartography and Geographic Information Science
Automated Road and Building Extraction
article

The road network similarity calculation based on autoencoders and its application in map generalization quality evaluation

article en

Abstract

Spatial similarity underpins multi-scale data representation and cartographic quality assessment. However, evaluating the similarity of structurally intricate road networks using conventional approaches often falls short due to inadequate spatial feature extraction and subjective weighting. To address this, we introduce a graph convolutional autoencoder (GCAE) model for road network similarity computation. The model learns deep spatial representations via self-supervised training, combining graph convolutions for feature extraction with autoencoders for graph reconstruction. Similarity is quantified using latent-space cosine similarity and validated against geometric and topological baselines, as well as human perception. Furthermore, we construct a multi-scale road network standard library to mathematically model the relationship between similarity and scale variation, serving as a benchmark for cartographic quality evaluation. Applied to Chengdu and Hefei, the framework assesses map generalization quality via deviation and evaluation-set methods. The results align closely with geographic evolution and human judgment, delivering objective, robust metrics that significantly enhance the intelligence of automated map generalization.

Cartography and Geographic Information Science
Lanzhou Jiaotong University (CN), Cardiff University (GB)
National Natural Science Foundation of China, Natural Science Foundation of Gansu Province
Sustainable cities and communities
Openalex Percentile: Top 99%
Automated Road and Building Extraction
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.