A Dual-Branch Deep Learning Framework at the Grid Scale for Individual Tree Segmentation

Individual tree segmentation from point clouds is essential for diverse forest applications. A dual-branch segmentation deep learning network operating at the grid scale was proposed, which includes the semantic segmentation branch for partitioning point clouds of tree trunks and the instance segmentation branch for individual trunk extraction. Meanwhile, the network analyzes input forest points at the grid scale instead of pointwise processing to preserve local geometric information of the forest points while reducing computational load. After extraction of each tree trunk in the understory layer using our network, a hierarchical k-nearest neighbors algorithm based on the extracted trunk parts was employed to accomplish individual tree segmentation. For the forest plots, our proposed approach achieves precision, recall, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${F}1$ </tex-math></inline-formula>-score, and mean intersection over union (MIoU) of 89.66%, 89.13%, 89.40%, and 90.84%, respectively. These results represent a significant improvement in accuracy and rapid execution capability compared to prior methods.

Authors

Institutions

Publication Details

Journal
IEEE Geoscience and Remote Sensing Letters
Published
2024-11-25
DOI
https://doi.org/10.1109/lgrs.2024.3506223
Primary Topic
Forest ecology and management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Dual-Branch Deep Learning Framework at the Grid Scale for Individual Tree Segmentation

Hanxiao Jiang, Ze Ding, Ting Yun, Li Zhang et al.
IEEE Geoscience and Remote Sensing Letters
Forest ecology and management
article

A Dual-Branch Deep Learning Framework at the Grid Scale for Individual Tree Segmentation

Hanxiao Jiang, Ze Ding, Ting Yun, Li Zhang, Ruisheng Wang, Huaiqing Zhang
article en

Abstract

Individual tree segmentation from point clouds is essential for diverse forest applications. A dual-branch segmentation deep learning network operating at the grid scale was proposed, which includes the semantic segmentation branch for partitioning point clouds of tree trunks and the instance segmentation branch for individual trunk extraction. Meanwhile, the network analyzes input forest points at the grid scale instead of pointwise processing to preserve local geometric information of the forest points while reducing computational load. After extraction of each tree trunk in the understory layer using our network, a hierarchical k-nearest neighbors algorithm based on the extracted trunk parts was employed to accomplish individual tree segmentation. For the forest plots, our proposed approach achieves precision, recall, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${F}1$ </tex-math></inline-formula>-score, and mean intersection over union (MIoU) of 89.66%, 89.13%, 89.40%, and 90.84%, respectively. These results represent a significant improvement in accuracy and rapid execution capability compared to prior methods.

IEEE Geoscience and Remote Sensing LettersVol. 22
Georgia Institute of Technology (US), Nanjing Forestry University (CN), University of Calgary (CA), Institute of Forest Resource Information Techniques (CN), Chinese Academy of Forestry (CN)
National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province
Openalex Percentile: Top 80%
Forest ecology and management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.