Fine-Grained Representation for Lane Topology Reasoning

• URL: http://arxiv.org/abs/2511.12590v2
• Date: Tue, 18 Nov 2025 16:06:07 GMT
• Title: Fine-Grained Representation for Lane Topology Reasoning
• Authors: Guoqing Xu, Yiheng Li, Yang Yang,
• Abstract summary: We propose a Fine-Grained lane topology reasoning framework (TopoFG)<n>It divides the procedure from bird's-eye-view (BEV) features to topology prediction via fine-grained queries.<n>It achieves new state-of-the-art performance, with an OLS of 48.0 on subsetA and 45.4 on subsetB.
• Score: 9.999635859285341
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Precise modeling of lane topology is essential for autonomous driving, as it directly impacts navigation and control decisions. Existing methods typically represent each lane with a single query and infer topological connectivity based on the similarity between lane queries. However, this kind of design struggles to accurately model complex lane structures, leading to unreliable topology prediction. In this view, we propose a Fine-Grained lane topology reasoning framework (TopoFG). It divides the procedure from bird's-eye-view (BEV) features to topology prediction via fine-grained queries into three phases, i.e., Hierarchical Prior Extractor (HPE), Region-Focused Decoder (RFD), and Robust Boundary-Point Topology Reasoning (RBTR). Specifically, HPE extracts global spatial priors from the BEV mask and local sequential priors from in-lane keypoint sequences to guide subsequent fine-grained query modeling. RFD constructs fine-grained queries by integrating the spatial and sequential priors. It then samples reference points in RoI regions of the mask and applies cross-attention with BEV features to refine the query representations of each lane. RBTR models lane connectivity based on boundary-point query features and further employs a topological denoising strategy to reduce matching ambiguity. By integrating spatial and sequential priors into fine-grained queries and applying a denoising strategy to boundary-point topology reasoning, our method precisely models complex lane structures and delivers trustworthy topology predictions. Extensive experiments on the OpenLane-V2 benchmark demonstrate that TopoFG achieves new state-of-the-art performance, with an OLS of 48.0 on subsetA and 45.4 on subsetB.

Related papers

• TopoMaskV3: 3D Mask Head with Dense Offset and Height Predictions for Road Topology Understanding [6.043109546012043]
  TopoMaskV3 is a robust, standalone 3D predictor via two novel dense prediction heads.<n>We are the first to address geographic data leakage in road topology evaluation.<n>TopoMaskV3 achieves state-of-the-art 28.5 OLS on a geographically disjoint benchmark.
  arXiv  Detail & Related papers  (2026-03-02T07:33:46Z)
• FedTopo: Topology-Informed Representation Alignment in Federated Learning under Non-I.I.D. Conditions [35.0734004020033]
  FedTopo is a framework that integrates Topological-Guided Block Screening (TGBS) and Topological Embedding (TE)<n>Experiments on Fashion-MNIST, CIFAR-10, and CIFAR-100 under four non-I.I.D. partitions show that FedTopo accelerates convergence and improves accuracy over strong baselines.
  arXiv  Detail & Related papers  (2025-11-16T14:40:58Z)
• RATopo: Improving Lane Topology Reasoning via Redundancy Assignment [20.251109000921044]
  Lane topology reasoning plays a critical role in autonomous driving.<n>We propose RATopo, a Redundancy Assignment strategy for lane Topology reasoning.
  arXiv  Detail & Related papers  (2025-08-21T06:06:02Z)
• RelTopo: Multi-Level Relational Modeling for Driving Scene Topology Reasoning [74.58385332488227]
  Road topology reasoning is critical for autonomous driving, enabling effective navigation and adherence to traffic regulations.<n>Existing methods typically focus on either lane detection or Lane-to-Lane (L2L) topology reasoning, often textitneglecting Lane-to-Traffic-element (L2T) relationships to optimize these tasks jointly.<n>We argue that relational modeling is beneficial for both perception and reasoning, as humans naturally leverage contextual relationships for road element recognition and their connectivity inference.
  arXiv  Detail & Related papers  (2025-06-16T14:40:28Z)
• Topological Schrödinger Bridge Matching [4.496256885343707]
  We propose the Topological Schr"odinger Bridge problem (TSBP) for matching signal distributions on a topological domain.<n>We show that the optimal process follows the forward-backward dynamics governed by some unknowns.<n>We develop TSB-based models for matching topological signals by parameterizing the unknowns in the optimal process as neural networks and learning them through likelihood training.
  arXiv  Detail & Related papers  (2025-04-07T07:45:21Z)
• Topo2Seq: Enhanced Topology Reasoning via Topology Sequence Learning [26.59766596428789]
  We introduce Topo2Seq, a novel approach for enhancing topology reasoning via topology sequences learning.<n>The core concept of Topo2Seq is a randomized order prompt-to-sequence learning between lane segment decoder and topology sequence decoder.<n>We show that Topo2Seq learns powerful long-range perception and accurate topological reasoning from the topology sequence decoder.
  arXiv  Detail & Related papers  (2025-02-13T05:21:02Z)
• TopoSD: Topology-Enhanced Lane Segment Perception with SDMap Prior [70.84644266024571]
  We propose to train a perception model to "see" standard definition maps (SDMaps) We encode SDMap elements into neural spatial map representations and instance tokens, and then incorporate such complementary features as prior information. Based on the lane segment representation framework, the model simultaneously predicts lanes, centrelines and their topology.
  arXiv  Detail & Related papers  (2024-11-22T06:13:42Z)
• A Refreshed Similarity-based Upsampler for Direct High-Ratio Feature Upsampling [54.05517338122698]
  A popular similarity-based feature upsampling pipeline has been proposed, which utilizes a high-resolution feature as guidance.<n>We propose an explicitly controllable query-key feature alignment from both semantic-aware and detail-aware perspectives.<n>We develop a fine-grained neighbor selection strategy on HR features, which is simple yet effective for alleviating mosaic artifacts.
  arXiv  Detail & Related papers  (2024-07-02T14:12:21Z)
• TopoLogic: An Interpretable Pipeline for Lane Topology Reasoning on Driving Scenes [27.930213859199473]
  We propose an interpretable method for lane topology reasoning based on lane geometric distance and lane query similarity. Our approach significantly outperforms the existing state-of-the-art methods on the mainstream benchmark OpenLane-V2. Our proposed geometric distance topology reasoning method can be incorporated into well-trained models without re-training.
  arXiv  Detail & Related papers  (2024-05-23T16:15:17Z)
• Hierarchical Spatial Proximity Reasoning for Vision-and-Language Navigation [1.2473780585666772]
  Most Vision-and-Language Navigation (VLN) algorithms are prone to making inaccurate decisions due to their lack of visual common sense and limited reasoning capabilities. We propose a Hierarchical Spatial Proximity Reasoning (HSPR) method to help the agent build a knowledge base of hierarchical spatial proximity. We validate our approach with experiments on publicly available datasets including REVERIE, SOON, R2R, and R4R.
  arXiv  Detail & Related papers  (2024-03-18T07:51:22Z)
• Joint Bayesian Inference of Graphical Structure and Parameters with a Single Generative Flow Network [59.79008107609297]
  We propose in this paper to approximate the joint posterior over the structure of a Bayesian Network. We use a single GFlowNet whose sampling policy follows a two-phase process. Since the parameters are included in the posterior distribution, this leaves more flexibility for the local probability models.
  arXiv  Detail & Related papers  (2023-05-30T19:16:44Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)
• Average Outward Flux Skeletons for Environment Mapping and Topology Matching [15.93458380913065]
  We consider how to extract a road map of an initially-unknown 2-dimensional environment via an online procedure that robustly computes a retraction of its boundaries. The proposed algorithm results in smooth safe paths for the robot's navigation needs.
  arXiv  Detail & Related papers  (2021-11-27T06:29:57Z)
• DAGMapper: Learning to Map by Discovering Lane Topology [84.12949740822117]
  We focus on drawing the lane boundaries of complex highways with many lanes that contain topology changes due to forks and merges. We formulate the problem as inference in a directed acyclic graphical model (DAG), where the nodes of the graph encode geometric and topological properties of the local regions of the lane boundaries. We show the effectiveness of our approach on two major North American Highways in two different states and show high precision and recall as well as 89% correct topology.
  arXiv  Detail & Related papers  (2020-12-22T21:58:57Z)

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.