Learning and Aggregating Lane Graphs for Urban Automated Driving
- URL: http://arxiv.org/abs/2302.06175v1
- Date: Mon, 13 Feb 2023 08:23:35 GMT
- Title: Learning and Aggregating Lane Graphs for Urban Automated Driving
- Authors: Martin B\"uchner, Jannik Z\"urn, Ion-George Todoran, Abhinav Valada,
Wolfram Burgard
- Abstract summary: Lane graph estimation is an essential and highly challenging task in automated driving and HD map learning.
We propose a novel bottom-up approach to lane graph estimation from aerial imagery that aggregates multiple overlapping graphs into a single consistent graph.
We make our large-scale urban lane graph dataset and code publicly available at http://urbanlanegraph.cs.uni-freiburg.de.
- Score: 26.34702432184092
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Lane graph estimation is an essential and highly challenging task in
automated driving and HD map learning. Existing methods using either onboard or
aerial imagery struggle with complex lane topologies, out-of-distribution
scenarios, or significant occlusions in the image space. Moreover, merging
overlapping lane graphs to obtain consistent large-scale graphs remains
difficult. To overcome these challenges, we propose a novel bottom-up approach
to lane graph estimation from aerial imagery that aggregates multiple
overlapping graphs into a single consistent graph. Due to its modular design,
our method allows us to address two complementary tasks: predicting
ego-respective successor lane graphs from arbitrary vehicle positions using a
graph neural network and aggregating these predictions into a consistent global
lane graph. Extensive experiments on a large-scale lane graph dataset
demonstrate that our approach yields highly accurate lane graphs, even in
regions with severe occlusions. The presented approach to graph aggregation
proves to eliminate inconsistent predictions while increasing the overall graph
quality. We make our large-scale urban lane graph dataset and code publicly
available at http://urbanlanegraph.cs.uni-freiburg.de.
Related papers
- LaneGraph2Seq: Lane Topology Extraction with Language Model via
Vertex-Edge Encoding and Connectivity Enhancement [34.017743757153866]
Intricate road structures are often depicted using lane graphs, which include centerline curves and connections forming a Directed Acyclic Graph (DAG)
We introduce LaneGraph2Seq, a novel approach for lane graph extraction.
Our method demonstrates superior performance compared to state-of-the-art techniques in lane graph extraction.
arXiv Detail & Related papers (2024-01-31T05:44:01Z) - Prior Based Online Lane Graph Extraction from Single Onboard Camera
Image [133.68032636906133]
We tackle online estimation of the lane graph from a single onboard camera image.
The prior is extracted from the dataset through a transformer based Wasserstein Autoencoder.
The autoencoder is then used to enhance the initial lane graph estimates.
arXiv Detail & Related papers (2023-07-25T08:58:26Z) - AutoGraph: Predicting Lane Graphs from Traffic Observations [35.73868803802196]
We propose to use the motion patterns of traffic participants as lane graph annotations.
Based on the location of these tracklets, we predict the successor lane graph from an initial position.
In a subsequent stage, we show how the individual successor predictions can be aggregated into a consistent lane graph.
arXiv Detail & Related papers (2023-06-27T12:11:22Z) - Online Lane Graph Extraction from Onboard Video [133.68032636906133]
We use the video stream from an onboard camera for online extraction of the surrounding's lane graph.
Using video, instead of a single image, as input poses both benefits and challenges in terms of combining the information from different timesteps.
A single model of this proposed simple, yet effective, method can process any number of images, including one, to produce accurate lane graphs.
arXiv Detail & Related papers (2023-04-03T12:36:39Z) - Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming [48.99614465020678]
We introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming.
This mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales.
We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently.
arXiv Detail & Related papers (2021-11-20T22:45:53Z) - Edge but not Least: Cross-View Graph Pooling [76.71497833616024]
This paper presents a cross-view graph pooling (Co-Pooling) method to better exploit crucial graph structure information.
Through cross-view interaction, edge-view pooling and node-view pooling seamlessly reinforce each other to learn more informative graph-level representations.
arXiv Detail & Related papers (2021-09-24T08:01:23Z) - Lane Graph Estimation for Scene Understanding in Urban Driving [34.82775302794312]
We propose a novel approach for lane geometry estimation from bird's-eye-view images.
We train a graph estimation model on multimodal bird's-eye-view data processed from the popular NuScenes dataset.
Our model shows promising performance for most evaluated urban scenes and can serve as a step towards automated generation of HD lane annotations for autonomous driving.
arXiv Detail & Related papers (2021-05-01T08:38:18Z) - Line Graph Neural Networks for Link Prediction [71.00689542259052]
We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications.
In this formalism, a link prediction problem is converted to a graph classification task.
We propose to seek a radically different and novel path by making use of the line graphs in graph theory.
In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
arXiv Detail & Related papers (2020-10-20T05:54:31Z) - Second-Order Pooling for Graph Neural Networks [62.13156203025818]
We propose to use second-order pooling as graph pooling, which naturally solves the above challenges.
We show that direct use of second-order pooling with graph neural networks leads to practical problems.
We propose two novel global graph pooling methods based on second-order pooling; namely, bilinear mapping and attentional second-order pooling.
arXiv Detail & Related papers (2020-07-20T20:52:36Z)
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.