Tree Segmentation of Airborne LiDAR Point Clouds Using a Graph-Based Algorithm

Forest monitoring using LiDAR has proven highly effective for obtaining detailed 3D point clouds, enabling individual tree analysis. This study introduces a novel segmentation algorithm designed for processing airborne LiDAR point clouds of forested areas. The proposed graph-based approach enhances the segmentation process by constructing voxelized clusters that form the basis for tree identification and isolation. The algorithm's performance was evaluated against three established methods: Dalponte's, Silva's, and Li's algorithms. Evaluation of the algorithm using metrics yielded the following results: recall = 0,778, precision = 0,809, and Fl-score = 0,742, indicating that while our approach does not consistently outperform all metrics, it demonstrates promising results with potential for further refinement. These findings suggest that our algorithm could contribute valuable insights into automated forest assessment and resource management as the methodology advances.

Authors

Institutions

Publication Details

Published
2025-04-08
DOI
https://doi.org/10.1109/reepe63962.2025.10970805
Primary Topic
Remote Sensing and LiDAR Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tree Segmentation of Airborne LiDAR Point Clouds Using a Graph-Based Algorithm

Daniil M. Zelinskii, Iulia N. Ryzhkova, Svetlana S. Loseva
Remote Sensing and LiDAR Applications
article

Tree Segmentation of Airborne LiDAR Point Clouds Using a Graph-Based Algorithm

Daniil M. Zelinskii, Iulia N. Ryzhkova, Svetlana S. Loseva
article en

Abstract

Forest monitoring using LiDAR has proven highly effective for obtaining detailed 3D point clouds, enabling individual tree analysis. This study introduces a novel segmentation algorithm designed for processing airborne LiDAR point clouds of forested areas. The proposed graph-based approach enhances the segmentation process by constructing voxelized clusters that form the basis for tree identification and isolation. The algorithm's performance was evaluated against three established methods: Dalponte's, Silva's, and Li's algorithms. Evaluation of the algorithm using metrics yielded the following results: recall = 0,778, precision = 0,809, and Fl-score = 0,742, indicating that while our approach does not consistently outperform all metrics, it demonstrates promising results with potential for further refinement. These findings suggest that our algorithm could contribute valuable insights into automated forest assessment and resource management as the methodology advances.

Bauman Moscow State Technical University (RU)
Openalex Percentile: Top 91%
Remote Sensing and LiDAR Applications
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.