GLane3D : Detecting Lanes with Graph of 3D Keypoints
Halil İbrahim Öztürk, Muhammet Esat Kalfaoğlu, Ozsel Kilinc
TL;DR
GLane3D tackles 3D lane detection with a camera-only system by modeling lanes as a directed graph of 3D keypoints and learning robust keypoint connections. It introduces multiple proposals per keypoint, a PointNMS stage to balance recall and efficiency, and a directed adjacency learning mechanism that enables lane extraction from BEV graphs, aided by a PV-to-BEV projection with a customized BEV geometry. The method balances recall and speed through a total proposal budget $N = S × n$ and an efficient matching/loss scheme, showing state-of-the-art F1 scores on OpenLane and Apollo with strong cross-dataset generalization, including camera-only and camera+LiDAR fusion variants. The IPM-based BEV sampling densifies near-ego regions, improving localization, while cross-dataset tests demonstrate GLane3D's robust generalization beyond the training domain. Overall, GLane3D offers a practical, scalable solution for real-time 3D lane detection with strong generalization capabilities across diverse driving scenarios.
Abstract
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.
