提出开放世界激光点云全景分割新方法,兼顾已知与未知类别
Lidar Panoptic Segmentation in an Open World

- 采用无类别点聚类与分层过分割,构建点段层次树
- 通过加权树切割实现分割,对已知和未知类别均表现优异
- 适合应对自动驾驶中不断出现的新物体类型
激光点云全景分割(LPS)对自动驾驶安全部署至关重要。LPS需识别并分割点云中的语义类别,包括可数的物体类(如行人、车辆)和无定形区域类(如植被、道路),且需区分每个物体实例。现有方法假设语义类别固定,但现实中类别会随机器人遭遇新类而演化。为此,本文研究开放世界下的激光点云全景分割(LiPSOW):在预定义类别的数据集上训练,测试其对包含新物体和新区域类别的更大数据集的泛化能力。结果表明,以往依赖类别特定实例分割的方法在已知类别上表现最佳,但基于无类别自底向上聚类的方法在未知类别上更优。本文提出折中方案:先进行无类别点聚类与分层过分割,再通过二值点段分类(类似区域提议网络),最后独立于语义分类,通过加权层次树切割获得最终分割。该统一方法在已知与未知类别上均表现强劲。
原文摘要 · Abstract (English)
Addressing Lidar Panoptic Segmentation (LPS ) is crucial for safe deployment of autonomous vehicles. LPS aims to recognize and segment lidar points w.r.t. a pre-defined vocabulary of semantic classes, including thing classes of countable objects (e.g., pedestrians and vehicles) and stuff classes of amorphous regions (e.g., vegetation and road). Importantly, LPS requires segmenting individual thing instances (e.g., every single vehicle). Current LPS methods make an unrealistic assumption that the semantic class vocabulary is fixed in the real open world, but in fact, class ontologies usually evolve over time as robots encounter instances of novel classes that are considered to be unknowns w.r.t. the pre-defined class vocabulary. To address this unrealistic assumption, we study LPS in the Open World (LiPSOW): we train models on a dataset with a pre-defined semantic class vocabulary and study their generalization to a larger dataset where novel instances of thing and stuff classes can appear. This experimental setting leads to interesting conclusions. While prior art train class-specific instance segmentation methods and obtain state-of-the-art results on known classes, methods based on class-agnostic bottom-up grouping perform favorably on classes outside of the initial class vocabulary (i.e., unknown classes). Unfortunately, these methods do not perform on-par with fully data-driven methods on known classes. Our work suggests a middle ground: we perform class-agnostic point clustering and over-segment the input cloud in a hierarchical fashion, followed by binary point segment classification, akin to Region Proposal Network [1]. We obtain the final point cloud segmentation by computing a cut in the weighted hierarchical tree of point segments, independently of semantic classification. Remarkably, this unified approach leads to strong performance on both known and unknown classes.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。