arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.03341cs.CVcs.AI

基于几何的在线矢量化高精地图构建

Online Vectorized HD Map Construction using Geometry

School of Computer Science and Technology, Beijing Institute of Technology(北京理工大学计算机科学与技术学院);The Chinese University of Hong Kong(香港中文大学);Tencent AI Lab(腾讯AI实验室)

Zhixin Zhang, Yiyuan Zhang, Xiaohan Ding, Fusheng Jin, Xiangyu Yue

AI总结:

针对在线矢量化高精地图构建中道路实例形状与关系探究不足的问题,提出GeMap方法,通过几何损失与解耦自注意力学习欧氏形状与关系,在多个数据集上达SOTA,首次在Argoverse 2上突破70% mAP。

摘要:

在线矢量化高精(HD)地图的构建对下游预测与规划至关重要。现有研究已为该任务建立了较强的基线,但城市道路系统中实例的形状与关系(如平行、垂直或矩形形态)仍未得到充分探究。本文提出GeMap(几何地图),可端到端学习地图实例的欧氏形状与关系,超越基础感知范畴。具体而言,我们设计了一种基于角度与距离线索的几何损失,对刚性变换具有鲁棒性;同时解耦自注意力机制,以独立处理欧氏形状与关系。该方法在NuScenes和Argoverse 2数据集上取得了新的state-of-the-art性能。值得注意的是,其在大规模Argoverse 2数据集上达到71.8%的mAP,较MapTR V2提升4.4%,且首次突破70% mAP阈值。代码可在https://github.com/cnzzx/GeMap获取。

英文摘要:

The construction of online vectorized High-Definition (HD) maps is critical for downstream prediction and planning. Recent efforts have built strong baselines for this task, however, shapes and relations of instances in urban road systems are still under-explored, such as parallelism, perpendicular, or rectangle-shape. In our work, we propose GeMap ($\textbf{Ge}$ometry $\textbf{Map}$), which end-to-end learns Euclidean shapes and relations of map instances beyond basic perception. Specifically, we design a geometric loss based on angle and distance clues, which is robust to rigid transformations. We also decouple self-attention to independently handle Euclidean shapes and relations. Our method achieves new state-of-the-art performance on the NuScenes and Argoverse 2 datasets. Remarkably, it reaches a 71.8% mAP on the large-scale Argoverse 2 dataset, outperforming MapTR V2 by +4.4% and surpassing the 70% mAP threshold for the first time. Code is available at https://github.com/cnzzx/GeMap.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑