Benchmarking of Individual Tree Segmentation Methods in Mediterranean Forest Based on Point Clouds from Unmanned Aerial Vehicle Imagery and Low-Density Airborne Laser Scanning
Three raster-based (RB) and one point cloud-based (PCB) algorithms were tested to segment individual Aleppo pine trees and extract their tree height (H) and crown diameter (CD) using two types of point clouds generated from two different techniques: (1) Low-Density (≈1.5 points/m2) Airborne Laser Sc...
Gespeichert in:
Veröffentlicht in: | Remote sensing (Basel, Switzerland) Switzerland), 2024-11, Vol.16 (21), p.3974 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Three raster-based (RB) and one point cloud-based (PCB) algorithms were tested to segment individual Aleppo pine trees and extract their tree height (H) and crown diameter (CD) using two types of point clouds generated from two different techniques: (1) Low-Density (≈1.5 points/m2) Airborne Laser Scanning (LD-ALS) and (2) photogrammetry based on high-resolution unmanned aerial vehicle (UAV) images. Through intensive experiments, it was concluded that the tested RB algorithms performed best in the case of UAV point clouds (F1-score > 80.57%, H Pearson’s r > 0.97, and CD Pearson´s r > 0.73), while the PCB algorithm yielded the best results when working with LD-ALS point clouds (F1-score = 89.51%, H Pearson´s r = 0.94, and CD Pearson´s r = 0.57). The best set of algorithm parameters was applied to all plots, i.e., it was not optimized for each plot, in order to develop an automatic pipeline for mapping large areas of Mediterranean forests. In this case, tree detection and height estimation showed good results for both UAV and LD-ALS (F1-score > 85% and >76%, and H Pearson´s r > 0.96 and >0.93, respectively). However, very poor results were found when estimating crown diameter (CD Pearson´s r around 0.20 for both approaches). |
---|---|
ISSN: | 2072-4292 2072-4292 |
DOI: | 10.3390/rs16213974 |