Neighbor-aware informal settlement mapping with graph convolutional networks

• URL: http://arxiv.org/abs/2509.26171v1
• Date: Tue, 30 Sep 2025 12:25:25 GMT
• Title: Neighbor-aware informal settlement mapping with graph convolutional networks
• Authors: Thomas Hallopeau, Joris Guérin, Laurent Demagistri, Christovam Barcellos, Nadine Dessay,
• Abstract summary: We propose a graph-based framework that incorporates local geographical context into the classification process.<n>Experiments are conducted on a case study in Rio de Janeiro using spatial cross-validation.<n>Our method outperforms standard baselines, improving Kappa coefficient by 17 points over individual cell classification.
• Score: 1.226598527858578
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mapping informal settlements is crucial for addressing challenges related to urban planning, public health, and infrastructure in rapidly growing cities. Geospatial machine learning has emerged as a key tool for detecting and mapping these areas from remote sensing data. However, existing approaches often treat spatial units independently, neglecting the relational structure of the urban fabric. We propose a graph-based framework that explicitly incorporates local geographical context into the classification process. Each spatial unit (cell) is embedded in a graph structure along with its adjacent neighbors, and a lightweight Graph Convolutional Network (GCN) is trained to classify whether the central cell belongs to an informal settlement. Experiments are conducted on a case study in Rio de Janeiro using spatial cross-validation across five distinct zones, ensuring robustness and generalizability across heterogeneous urban landscapes. Our method outperforms standard baselines, improving Kappa coefficient by 17 points over individual cell classification. We also show that graph-based modeling surpasses simple feature concatenation of neighboring cells, demonstrating the benefit of encoding spatial structure for urban scene understanding.

Related papers

• Population synthesis with geographic coordinates [1.6419687521433917]
  It is increasingly important to generate synthetic populations with explicit coordinates rather than coarse geographic areas.<n>We propose a population synthesis algorithm that maps spatial coordinates into a more regular latent space.<n>We demonstrate the method by generating synthetic homes with the same statistical properties of real homes in 121 datasets.
  arXiv  Detail & Related papers  (2025-10-08T13:36:13Z)
• Urban Forms Across Continents: A Data-Driven Comparison of Lausanne and Philadelphia [7.693465097015469]
  This study presents a data-driven framework to identify and compare urban typologies across geographically and culturally distinct cities.<n>We extracted multidimensional features related to topography, multimodality, green spaces, and points of interest for the cities of Lausanne, Switzerland, and Philadelphia, USA.<n>The results reveal coherent and interpretable urban typologies within each city, with some cluster types emerging across both cities despite their differences in scale, density, and cultural context.
  arXiv  Detail & Related papers  (2025-05-05T18:13:22Z)
• Explainable Hierarchical Urban Representation Learning for Commuting Flow Prediction [1.5156879440024378]
  Commuting flow prediction is an essential task for municipal operations in the real world. We develop a heterogeneous graph-based model to generate meaningful region embeddings for predicting different types of inter-level OD flows. Our proposed model outperforms existing models in terms of a uniform urban structure.
  arXiv  Detail & Related papers  (2024-08-27T03:30:01Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• Effective Urban Region Representation Learning Using Heterogeneous Urban Graph Attention Network (HUGAT) [0.0]
  We propose heterogeneous urban graph attention network (HUGAT) for learning the representations of urban regions. In our experiments on NYC data, HUGAT outperformed all the state-of-the-art models.
  arXiv  Detail & Related papers  (2022-02-18T04:59:20Z)
• Neural Embeddings of Urban Big Data Reveal Emergent Structures in Cities [7.148078723492643]
  We propose using a neural embedding model-graph neural network (GNN)- that leverages the heterogeneous features of urban areas. Using large-scale high-resolution mobility data sets from millions of aggregated and anonymized mobile phone users in 16 metropolitan counties in the United States, we demonstrate that our embeddings encode complex relationships among features related to urban components. We show that embeddings generated by a model trained on a different county can capture 50% to 60% of the emergent spatial structure in another county.
  arXiv  Detail & Related papers  (2021-10-24T07:13:14Z)
• Methodological Foundation of a Numerical Taxonomy of Urban Form [62.997667081978825]
  We present a method for numerical taxonomy of urban form derived from biological systematics. We derive homogeneous urban tissue types and, by determining overall morphological similarity between them, generate a hierarchical classification of urban form. After framing and presenting the method, we test it on two cities - Prague and Amsterdam.
  arXiv  Detail & Related papers  (2021-04-30T12:47:52Z)
• Spatial-Spectral Clustering with Anchor Graph for Hyperspectral Image [88.60285937702304]
  This paper proposes a novel unsupervised approach called spatial-spectral clustering with anchor graph (SSCAG) for HSI data clustering. The proposed SSCAG is competitive against the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-04-24T08:09:27Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)
• Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification [63.56018768401328]
  We propose a Multi-level Graph Convolutional Network (GCN) with Automatic Graph Learning method (MGCN-AGL) for HSI classification. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions. Our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level.
  arXiv  Detail & Related papers  (2020-09-19T09:26:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.