arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.06876cs.CVcs.RO

HARP-NeXt:用于3D LiDAR语义分割的高速精确距离-点融合网络

HARP-NeXt: High-Speed and Accurate Range-Point Fusion Network for 3D LiDAR Semantic Segmentation

Paris-Saclay University, CEA, List(巴黎-萨克雷大学,CEA,List);Mines Paris, PSL University, Centre for Robotics (CAOR)(巴黎矿业学院,PSL大学,机器人中心(CAOR))

Samir Abou Haidar, Alexandre Chariot, Mehdi Darouich, Cyril Joly, Jean-Emmanuel Deschaud

AI总结:

提出HARP-NeXt,一种高速精确的LiDAR语义分割网络,通过新型预处理、Conv-SE-NeXt块和多尺度距离-点融合,在nuScenes和SemanticKITTI上实现速度-精度最佳权衡,比PTv3快24倍。

摘要:

LiDAR语义分割对于自动驾驶车辆和移动机器人至关重要,需要高精度和实时处理,尤其是在资源受限的嵌入式系统上。以往的最先进方法常常面临精度与速度之间的权衡。基于点的方法和基于稀疏卷积的方法精度高但速度慢,原因在于邻域搜索和3D卷积的复杂性。基于投影的方法速度较快,但在2D投影过程中会丢失关键的几何信息。此外,许多近期方法依赖测试时增强(TTA)来提升性能,这进一步降低了推理速度。而且,所有方法中的预处理阶段都增加了执行时间,并对嵌入式平台提出了较高要求。因此,我们提出了HARP-NeXt,一种高速且精确的LiDAR语义分割网络。我们首先提出了一种新颖的预处理方法,显著降低了计算开销。然后,我们设计了Conv-SE-NeXt特征提取块,无需在每个网络阶段进行深层堆叠即可高效捕获表示。我们还采用了多尺度距离-点融合骨干网络,利用多个抽象层次的信息来保留必要的几何细节,从而提升精度。在nuScenes和SemanticKITTI基准上的实验表明,与所有最先进方法相比,HARP-NeXt实现了更优的速度-精度权衡,并且在不依赖集成模型或TTA的情况下,与排名第一的PTv3相当,同时运行速度快24倍。代码可在https://github.com/SamirAbouHaidar/HARP-NeXt获取。

英文摘要:

LiDAR semantic segmentation is crucial for autonomous vehicles and mobile robots, requiring high accuracy and real-time processing, especially on resource-constrained embedded systems. Previous state-of-the-art methods often face a trade-off between accuracy and speed. Point-based and sparse convolution-based methods are accurate but slow due to the complexity of neighbor searching and 3D convolutions. Projection-based methods are faster but lose critical geometric information during the 2D projection. Additionally, many recent methods rely on test-time augmentation (TTA) to improve performance, which further slows the inference. Moreover, the pre-processing phase across all methods increases execution time and is demanding on embedded platforms. Therefore, we introduce HARP-NeXt, a high-speed and accurate LiDAR semantic segmentation network. We first propose a novel pre-processing methodology that significantly reduces computational overhead. Then, we design the Conv-SE-NeXt feature extraction block to efficiently capture representations without deep layer stacking per network stage. We also employ a multi-scale range-point fusion backbone that leverages information at multiple abstraction levels to preserve essential geometric details, thereby enhancing accuracy. Experiments on the nuScenes and SemanticKITTI benchmarks show that HARP-NeXt achieves a superior speed-accuracy trade-off compared to all state-of-the-art methods, and, without relying on ensemble models or TTA, is comparable to the top-ranked PTv3, while running 24$\times$ faster. The code is available at https://github.com/SamirAbouHaidar/HARP-NeXt

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

↑