GLD-Road:A global-local decoding road network extraction model for remote sensing images

• URL: http://arxiv.org/abs/2506.09553v1
• Date: Wed, 11 Jun 2025 09:36:25 GMT
• Title: GLD-Road:A global-local decoding road network extraction model for remote sensing images
• Abstract summary: Road networks are crucial for mapping, autonomous driving, and disaster response.<n>We propose GLD-Road, a two-stage model combining global efficiency and local precision.<n> Experiments show GLD-Road outperforms state-of-the-art methods.
• Score: 7.430139032391173
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Road networks are crucial for mapping, autonomous driving, and disaster response. While manual annotation is costly, deep learning offers efficient extraction. Current methods include postprocessing (prone to errors), global parallel (fast but misses nodes), and local iterative (accurate but slow). We propose GLD-Road, a two-stage model combining global efficiency and local precision. First, it detects road nodes and connects them via a Connect Module. Then, it iteratively refines broken roads using local searches, drastically reducing computation. Experiments show GLD-Road outperforms state-of-the-art methods, improving APLS by 1.9% (City-Scale) and 0.67% (SpaceNet3). It also reduces retrieval time by 40% vs. Sat2Graph (global) and 92% vs. RNGDet++ (local). The experimental results are available at https://github.com/ucas-dlg/GLD-Road.

Related papers

• Beyond Endpoints: Path-Centric Reasoning for Vectorized Off-Road Network Extraction [9.833728353188132]
  We release WildRoad, a global off-road road network dataset constructed efficiently with a dedicated interactive annotation tool.<n>We introduce MaGRoad, a path-centric framework that aggregates multi-scale visual evidence along candidate paths to infer connectivity robustly.<n>MaGRoad achieves state-of-the-art performance on our challenging WildRoad benchmark while generalizing well to urban datasets.
  arXiv  Detail & Related papers  (2025-12-11T08:29:27Z)
• Blurred Encoding for Trajectory Representation Learning [56.642548506419]
  Tray representation learning (TRL) maps trajectories to vector embeddings and facilitates tasks such as trajectory classification and similarity search.<n>State-of-the-art (SOTA) TRL methods transform raw GPS trajectories to grid or road trajectories to capture high-level travel semantics.<n>But they lose fine-grained spatial-temporal details as multiple GPS points are grouped into a single grid cell or road segment.<n>We propose the BLUrred jector method, dubbed BLUE, which gradually reduces the precision of GPS coordinates to create hierarchical patches.
  arXiv  Detail & Related papers  (2025-11-12T03:51:57Z)
• Loopy-SLAM: Dense Neural SLAM with Loop Closures [53.11936461015725]
  We introduce Loopy-SLAM that globally optimize poses and the dense 3D model. We use frame-to-model tracking using a data-driven point-based submap generation method and trigger loop closures online by performing global place recognition. Evaluation on the synthetic Replica and real-world TUM-RGBD and ScanNet datasets demonstrate competitive or superior performance in tracking, mapping, and rendering accuracy when compared to existing dense neural RGBD SLAM methods.
  arXiv  Detail & Related papers  (2024-02-14T18:18:32Z)
• Sketch and Refine: Towards Fast and Accurate Lane Detection [69.63287721343907]
  Lane detection is a challenging task due to the complexity of real-world scenarios. Existing approaches, whether proposal-based or keypoint-based, suffer from depicting lanes effectively and efficiently. We present a "Sketch-and-Refine" paradigm that utilizes the merits of both keypoint-based and proposal-based methods. Experiments show that our SRLane can run at a fast speed (i.e., 278 FPS) while yielding an F1 score of 78.9%.
  arXiv  Detail & Related papers  (2024-01-26T09:28:14Z)
• R2S100K: Road-Region Segmentation Dataset For Semi-Supervised Autonomous Driving in the Wild [11.149480965148015]
  Road Region dataset (R2S100K) is a large-scale dataset and benchmark for training and evaluation of road segmentation. R2S100K comprises 100K images extracted from a large and diverse set of video sequences covering more than 1000 KM of roadways. We present an Efficient Data Sampling method (EDS) based self-training framework to improve learning by leveraging unlabeled data.
  arXiv  Detail & Related papers  (2023-08-11T21:31:37Z)
• Unsupervised Learning for Solving the Travelling Salesman Problem [28.62497359169851]
  We propose UTSP, an unsupervised learning framework for solving the Travelling Salesman Problem (TSP) We train a Graph Neural Network (GNN) using a surrogate loss. The GNN outputs a heat map representing the probability for each edge to be part of the optimal path. We then apply local search to generate our final prediction based on the heat map.
  arXiv  Detail & Related papers  (2023-03-19T02:30:27Z)
• 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)
• A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems [58.348679046591265]
  Given a node-weighted graph, find a set of independent (mutually nonadjacent) nodes whose node-weight sum is maximum. Some of the graphs airsing in this application are large, having hundreds of thousands of nodes and hundreds of millions of edges. We develop a new local search algorithm, which is a metaheuristic in the greedy randomized adaptive search framework.
  arXiv  Detail & Related papers  (2022-03-28T21:34:16Z)
• 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)
• Waypoint Planning Networks [66.72790309889432]
  We propose a hybrid algorithm based on LSTMs with a local kernel - a classic algorithm such as A*, and a global kernel using a learned algorithm. We compare WPN against A*, as well as related works including motion planning networks (MPNet) and value networks (VIN) It is shown that WPN's search space is considerably less than A*, while being able to generate near optimal results.
  arXiv  Detail & Related papers  (2021-05-01T18:02:01Z)
• Road Network Metric Learning for Estimated Time of Arrival [93.0759529610483]
  In this paper, we propose the Road Network Metric Learning framework for Estimated Time of Arrival (ETA) It consists of two components: (1) a main regression task to predict the travel time, and (2) an auxiliary metric learning task to improve the quality of link embedding vectors. We show that our method outperforms the state-of-the-art model and the promotion concentrates on the cold links with few data.
  arXiv  Detail & Related papers  (2020-06-24T04:45:14Z)
• Experiments on route choice set generation using a large GPS trajectory set [9.139729923546247]
  In this paper, different path generation algorithms are evaluated using a large GPS trajectory dataset. An initial analysis is performed by generating a single route based on the shortest path. A modified link penalty method, which accounts for preference of using higher hierarchical roads, provides a route set with 97% coverage.
  arXiv  Detail & Related papers  (2020-05-22T13:44:49Z)

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.