GLane3D : Detecting Lanes with Graph of 3D Keypoints

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Öztürk, Halil İbrahim, Kalfaoğlu, Muhammet Esat, Kilinc, Ozsel
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915219196870656
author Öztürk, Halil İbrahim
Kalfaoğlu, Muhammet Esat
Kilinc, Ozsel
author_facet Öztürk, Halil İbrahim
Kalfaoğlu, Muhammet Esat
Kilinc, Ozsel
contents Accurate and efficient lane detection in 3D space is essential for autonomous driving systems, where robust generalization is the foremost requirement for 3D lane detection algorithms. Considering the extensive variation in lane structures worldwide, achieving high generalization capacity is particularly challenging, as algorithms must accurately identify a wide variety of lane patterns worldwide. Traditional top-down approaches rely heavily on learning lane characteristics from training datasets, often struggling with lanes exhibiting previously unseen attributes. To address this generalization limitation, we propose a method that detects keypoints of lanes and subsequently predicts sequential connections between them to construct complete 3D lanes. Each key point is essential for maintaining lane continuity, and we predict multiple proposals per keypoint by allowing adjacent grids to predict the same keypoint using an offset mechanism. PointNMS is employed to eliminate overlapping proposal keypoints, reducing redundancy in the estimated BEV graph and minimizing computational overhead from connection estimations. Our model surpasses previous state-of-the-art methods on both the Apollo and OpenLane datasets, demonstrating superior F1 scores and a strong generalization capacity when models trained on OpenLane are evaluated on the Apollo dataset, compared to prior approaches.
format Preprint
id arxiv_https___arxiv_org_abs_2503_23882
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle GLane3D : Detecting Lanes with Graph of 3D Keypoints
Öztürk, Halil İbrahim
Kalfaoğlu, Muhammet Esat
Kilinc, Ozsel
Computer Vision and Pattern Recognition
Accurate and efficient lane detection in 3D space is essential for autonomous driving systems, where robust generalization is the foremost requirement for 3D lane detection algorithms. Considering the extensive variation in lane structures worldwide, achieving high generalization capacity is particularly challenging, as algorithms must accurately identify a wide variety of lane patterns worldwide. Traditional top-down approaches rely heavily on learning lane characteristics from training datasets, often struggling with lanes exhibiting previously unseen attributes. To address this generalization limitation, we propose a method that detects keypoints of lanes and subsequently predicts sequential connections between them to construct complete 3D lanes. Each key point is essential for maintaining lane continuity, and we predict multiple proposals per keypoint by allowing adjacent grids to predict the same keypoint using an offset mechanism. PointNMS is employed to eliminate overlapping proposal keypoints, reducing redundancy in the estimated BEV graph and minimizing computational overhead from connection estimations. Our model surpasses previous state-of-the-art methods on both the Apollo and OpenLane datasets, demonstrating superior F1 scores and a strong generalization capacity when models trained on OpenLane are evaluated on the Apollo dataset, compared to prior approaches.
title GLane3D : Detecting Lanes with Graph of 3D Keypoints
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2503.23882