arXiv:2509.03633cs.CVcs.AI2025-09被引 2

无需标注数据,高效分割密集森林点云中的单棵树。

treeX: Unsupervised Tree Instance Segmentation in Dense Forest Point Clouds

  • 基于聚类与区域生长,无监督实现树干检测与树冠分割。
  • 地面扫描数据准确率提升0.11至0.49,无人机扫描达F1=0.58。
  • 适合资源受限场景或为深度学习生成半自动标签。

近距激光扫描可提供林分的详细三维点云,但需高效软件处理并提取单棵树。尽管已有深度学习方法用于树实例分割,但需大量标注数据和高算力。为此,我们提出改进版treeX算法,一种无监督方法,结合基于聚类的树干检测与区域生长的树冠划分。原treeX针对个人激光扫描(PLS)设计,现提供两类参数预设:适用于地面激光扫描(静态地基TLS与PLS)和机载激光扫描(ULS)。在六个公开数据集(FOR-instance、ForestSemantic、LAUTx、NIBIO MLS、TreeLearn、Wytham Woods)上评估,并与六种开源方法(原treeX、treeiso、RayCloudTools、ForAINet、SegmentAnyTree、TreeLearn)对比。相比原算法,新版本显著降低运行时间且提升精度,地面数据的实例检测F1分数提高0.11至0.49;对于ULS数据,新预设达到F1=0.58,而原算法无法正确分割任何实例。在TLS与PLS数据上,精度接近最新开源方法,包括深度学习模型。该方法设计适用于两类场景:(1)数据特征匹配时作为深度学习的轻量替代方案(需足够可见树干与点密度);(2)为深度学习模型半自动生成标签。为促进应用,我们已在pointtree包中开源了Python实现。

原文摘要 · Abstract (English)

Close-range laser scanning provides detailed 3D captures of forest stands but requires efficient software for processing 3D point cloud data and extracting individual trees. Although recent studies have introduced deep learning methods for tree instance segmentation, these approaches require large annotated datasets and substantial computational resources. As a resource-efficient alternative, we present a revised version of the treeX algorithm, an unsupervised method that combines clustering-based stem detection with region growing for crown delineation. While the original treeX algorithm was developed for personal laser scanning (PLS) data, we provide two parameter presets, one for ground-based laser scanning (stationary terrestrial - TLS and PLS), and one for UAV-borne laser scanning (ULS). We evaluated the method on six public datasets (FOR-instance, ForestSemantic, LAUTx, NIBIO MLS, TreeLearn, Wytham Woods) and compared it to six open-source methods (original treeX, treeiso, RayCloudTools, ForAINet, SegmentAnyTree, TreeLearn). Compared to the original treeX algorithm, our revision reduces runtime and improves accuracy, with instance detection F$_1$-score gains of +0.11 to +0.49 for ground-based data. For ULS data, our preset achieves an F$_1$-score of 0.58, whereas the original algorithm fails to segment any correct instances. For TLS and PLS data, our algorithm achieves accuracy similar to recent open-source methods, including deep learning. Given its algorithmic design, we see two main applications for our method: (1) as a resource-efficient alternative to deep learning approaches in scenarios where the data characteristics align with the method design (sufficient stem visibility and point density), and (2) for the semi-automatic generation of labels for deep learning models. To enable broader adoption, we provide an open-source Python implementation in the pointtree package.

点云分割无监督学习森林监测

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。