用几何引导查询和线性模型,高效分割复杂森林点云。
ForestMamba: Sparse Mamba with Geometry-guided Queries for 3D Forest Point Cloud Segmentation

- 垂直优先分块编码,构建连贯长程上下文序列。
- 基于冠层高程图的种子查询,精准定位树木位置。
- 线性复杂度解码器,推理速度比Transformer快3倍。
地面与无人机激光雷达点云的语义和实例分割正成为将复杂三维林地结构转化为森林监测与生物多样性评估可行动信息的关键方法。然而,林地激光雷达场景因数据量大、采样密度不规则、冠层重叠复杂及地理差异而极具挑战。现有基于稀疏卷积或Transformer的方法虽表现良好,但存在两大局限:注意力机制的二次复杂度难以处理大规模林区,通用上下文建模未能利用森林结构先验,限制了复杂区域的树体分离。为此,本文提出ForestMamba,融合森林特定先验与线性时间状态空间建模,实现高效且结构感知的学习。首先,设计垂直优先分块序列化稀疏编码器,将稀疏体素组织为垂直连贯序列,支持高效长程上下文建模。其次,提出基于实时多尺度冠层高程图的几何引导查询初始化策略,以冠层极值作为生态有意义的查询种子,并结合最远点采样覆盖下层树木。第三,设计基于Mamba的查询解码器,结合局部kNN体素聚合与空间双路径Mamba,实现查询优化,计算复杂度为线性。在七个林区的大量实验表明,ForestMamba在两项分割任务上均持续优于现有基线方法,同时推理速度比Transformer方法快3倍,显存占用降低2.3倍。代码已开源:https://github.com/thanhhff/ForestMamba。
原文摘要 · Abstract (English)
Semantic and instance segmentation of terrestrial and drone LiDAR point clouds is emerging as a transformative approach for converting the complex 3D structure of forests into actionable information for forest monitoring and biodiversity assessment. However, forest LiDAR scenes remain highly challenging due to their large data volumes, irregular sampling density, overlapping and complex canopy structure, and geographic variability. Existing methods based on sparse convolutions or Transformers achieve promising results, but suffer from two key limitations: Quadratic complexity of attention scales poorly to large forest scenes, and generic context modeling does not exploit forest structural priors, limiting tree separation in complex regions. To address these challenges, we propose ForestMamba, which integrates forest-specific priors with linear-time state-space modeling for efficient, structure-aware learning. First, we introduce a sparse encoder with vertical-priority slab serialization that organizes sparse voxels into vertically coherent sequences for efficient long-range context modeling. Second, we propose a geometry-guided query initialization strategy based on an on-the-fly multi-scale Canopy Height Model, where canopy maxima provide ecologically meaningful query seeds, supplemented by Farthest Point Sampling to cover understory trees. Third, we design a Mamba-based query decoder that combines local kNN voxel aggregation with a spatial dual-path Mamba for query refinement with linear computational complexity. Extensive experiments across seven forest regions demonstrate that ForestMamba consistently outperforms existing baselines in both segmentation tasks, while achieving 3 times faster inference and 2.3 times lower GPU memory than Transformer-based methods. The source code is available at https://github.com/thanhhff/ForestMamba.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。