Segment Anything Model for Road Network Graph Extraction

• URL: http://arxiv.org/abs/2403.16051v3
• Date: Sat, 13 Apr 2024 01:19:39 GMT
• Title: Segment Anything Model for Road Network Graph Extraction
• Authors: Congrui Hetang, Haoru Xue, Cindy Le, Tianwei Yue, Wenping Wang, Yihui He,
• Abstract summary: We propose SAM-Road, an adaptation of the Segment Anything Model (SAM) for extracting large-scale, vectorized road network graphs from satellite imagery. With its simple, straightforward, and minimalist design, SAM-Road achieves comparable accuracy with the state-of-the-art method RNGDet++.
• Score: 27.789980798493463
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose SAM-Road, an adaptation of the Segment Anything Model (SAM) for extracting large-scale, vectorized road network graphs from satellite imagery. To predict graph geometry, we formulate it as a dense semantic segmentation task, leveraging the inherent strengths of SAM. The image encoder of SAM is fine-tuned to produce probability masks for roads and intersections, from which the graph vertices are extracted via simple non-maximum suppression. To predict graph topology, we designed a lightweight transformer-based graph neural network, which leverages the SAM image embeddings to estimate the edge existence probabilities between vertices. Our approach directly predicts the graph vertices and edges for large regions without expensive and complex post-processing heuristics, and is capable of building complete road network graphs spanning multiple square kilometers in a matter of seconds. With its simple, straightforward, and minimalist design, SAM-Road achieves comparable accuracy with the state-of-the-art method RNGDet++, while being 40 times faster on the City-scale dataset. We thus demonstrate the power of a foundational vision model when applied to a graph learning task. The code is available at https://github.com/htcr/sam_road.

Related papers

• LineGraph2Road: Structural Graph Reasoning on Line Graphs for Road Network Extraction [0.0]
  LineGraph2Road is a framework that improves connectedness prediction by formulating it as binary classification over edges in a constructed global but sparse Euclidean graph.<n>We evaluate it on three benchmarks: City-scale, SpaceNet, and Global-scale, and show that it achieves state-of-the-art results on two key metrics, TOPO-F1 and APLS.
  arXiv  Detail & Related papers  (2026-02-26T18:02:44Z)
• Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees [50.78679002846741]
  We introduce a novel approach for learning cross-task generalities in graphs. We propose task-trees as basic learning instances to align task spaces on graphs. Our findings indicate that when a graph neural network is pretrained on diverse task-trees, it acquires transferable knowledge.
  arXiv  Detail & Related papers  (2024-12-21T02:07:43Z)
• Towards Satellite Image Road Graph Extraction: A Global-Scale Dataset and A Novel Method [42.3609654615897]
  We collect a global-scale satellite road graph extraction dataset, i.e. Global-Scale dataset. We develop a novel road graph extraction model, i.e. SAM-Road++, which adopts a node-guided resampling method. Experiments demonstrate the validity of the collected Global-Scale dataset and the proposed SAM-Road++ method.
  arXiv  Detail & Related papers  (2024-11-23T10:26:07Z)
• Graph Transformers for Large Graphs [57.19338459218758]
  This work advances representation learning on single large-scale graphs with a focus on identifying model characteristics and critical design constraints. A key innovation of this work lies in the creation of a fast neighborhood sampling technique coupled with a local attention mechanism. We report a 3x speedup and 16.8% performance gain on ogbn-products and snap-patents, while we also scale LargeGT on ogbn-100M with a 5.9% performance improvement.
  arXiv  Detail & Related papers  (2023-12-18T11:19:23Z)
• InstaGraM: Instance-level Graph Modeling for Vectorized HD Map Learning [8.556482588459899]
  Online high-definition (HD) map construction plays a significant role in accurate estimation of the pose. Recent advancements in online HD map construction have predominantly investigated on vectorized representation. We propose a novel HD map learning framework that leverages graph modeling.
  arXiv  Detail & Related papers  (2023-01-10T08:15:35Z)
• RNGDet++: Road Network Graph Detection by Transformer with Instance Segmentation and Multi-scale Features Enhancement [19.263691277963368]
  The graph structure of road networks is critical for downstream tasks of autonomous driving systems, such as global planning, motion prediction and control. In the past, the road network graph is usually manually annotated by human experts, which is time-consuming and labor-intensive. Previous works either post-process semantic segmentation maps or propose graph-based algorithms to directly predict the road network graph. Previous works suffer from hard-coded processing algorithms and inferior final performance. Since the new proposed approach is improved from RNGDet, it is named RNGDet++.
  arXiv  Detail & Related papers  (2022-09-21T07:06:46Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• RNGDet: Road Network Graph Detection by Transformer in Aerial Images [19.141279413414082]
  Road network graphs provide critical information for autonomous vehicle applications. manually annotating road network graphs is inefficient and labor-intensive. We propose a novel approach based on transformer and imitation learning named RNGDet.
  arXiv  Detail & Related papers  (2022-02-16T01:59:41Z)
• MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs [55.66953093401889]
  Masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data. Taking insights from self-supervised learning, we randomly mask a large proportion of edges and try to reconstruct these missing edges during training.
  arXiv  Detail & Related papers  (2022-01-07T16:48:07Z)
• Road Extraction from Overhead Images with Graph Neural Networks [18.649284163019516]
  We propose a method that directly infers the final road graph in a single pass. The key idea consists in combining a Fully Convolutional Network in charge of locating points of interest and a Graph Neural Network which predicts links between these points. We evaluate our method against existing works on the popular RoadTracer dataset and achieve competitive results.
  arXiv  Detail & Related papers  (2021-12-09T21:10:27Z)
• SPIN Road Mapper: Extracting Roads from Aerial Images via Spatial and Interaction Space Graph Reasoning for Autonomous Driving [64.10636296274168]
  Road extraction is an essential step in building autonomous navigation systems. Using just convolution neural networks (ConvNets) for this problem is not effective as it is inefficient at capturing distant dependencies between road segments in the image. We propose a Spatial and Interaction Space Graph Reasoning (SPIN) module which when plugged into a ConvNet performs reasoning over graphs constructed on spatial and interaction spaces projected from the feature maps.
  arXiv  Detail & Related papers  (2021-09-16T03:52:17Z)
• Road Scene Graph: A Semantic Graph-Based Scene Representation Dataset for Intelligent Vehicles [72.04891523115535]
  We propose road scene graph,a special scene-graph for intelligent vehicles. It provides not only object proposals but also their pair-wise relationships. By organizing them in a topological graph, these data are explainable, fully-connected, and could be easily processed by GCNs.
  arXiv  Detail & Related papers  (2020-11-27T07:33:11Z)
• Sat2Graph: Road Graph Extraction through Graph-Tensor Encoding [25.55895733077606]
  In this paper, we propose a new method, Sat2Graph, which combines the advantages of the two prior categories into a unified framework. The key idea in Sat2Graph is a novel encoding scheme, graph-tensor encoding (GTE), which encodes the road graph into a tensor representation. We find that Sat2Graph surpasses prior methods on two widely used metrics, TOPO and APLS.
  arXiv  Detail & Related papers  (2020-07-19T01:04:19Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.