A hybrid method for segmenting individual trees from airborne lidar data

2019 ◽  
Vol 163 ◽  
pp. 104871 ◽  
Author(s):  
Li Liu ◽  
Samsung Lim ◽  
Xuesong Shen ◽  
Marta Yebra
Keyword(s):  
Hybrid Method ◽  
Airborne Lidar ◽  
Lidar Data ◽  
Individual Trees ◽  
Airborne Lidar Data

scholarly journals Individual Tree Position Extraction and Structural Parameter Retrieval Based on Airborne LiDAR Data: Performance Evaluation and Comparison of Four Algorithms

2020 ◽  
Vol 12 (3) ◽  
pp. 571 ◽  
Author(s):  
Chen ◽  
Xiang ◽  
Moriya
Keyword(s):  
Template Matching ◽  
Local Maximum ◽  
Airborne Lidar ◽  
Forest Monitoring ◽  
Lidar Data ◽  
Individual Tree ◽  
Matching Algorithm ◽  
Crown Width ◽  
Individual Trees ◽  
Airborne Lidar Data

Information for individual trees (e.g., position, treetop, height, crown width, and crown edge) is beneficial for forest monitoring and management. Light Detection and Ranging (LiDAR) data have been widely used to retrieve these individual tree parameters from different algorithms, with varying successes. In this study, we used an iterative Triangulated Irregular Network (TIN) algorithm to separate ground and canopy points in airborne LiDAR data, and generated Digital Elevation Models (DEM) by Inverse Distance Weighted (IDW) interpolation, thin spline interpolation, and trend surface interpolation, as well as by using the Kriging algorithm. The height of the point cloud was assigned to a Digital Surface Model (DSM), and a Canopy Height Model (CHM) was acquired. Then, four algorithms (point-cloud-based local maximum algorithm, CHM-based local maximum algorithm, watershed algorithm, and template-matching algorithm) were comparatively used to extract the structural parameters of individual trees. The results indicated that the two local maximum algorithms can effectively detect the treetop; the watershed algorithm can accurately extract individual tree height and determine the tree crown edge; and the template-matching algorithm works well to extract accurate crown width. This study provides a reference for the selection of algorithms in individual tree parameter inversion based on airborne LiDAR data and is of great significance for LiDAR-based forest monitoring and management.

scholarly journals Cloth simulation-based construction of pit-free canopy height models from airborne LiDAR data

2020 ◽  
Vol 7 (1) ◽  
Author(s):  
Wuming Zhang ◽  
Shangshu Cai ◽  
Xinlian Liang ◽  
Jie Shao ◽  
Ronghai Hu ◽  
...  
Keyword(s):  
Tree Height ◽  
Point Clouds ◽  
Airborne Lidar ◽  
Canopy Height ◽  
Lidar Data ◽  
Cloth Simulation ◽  
Simulation Based ◽  
Maximum Tree Height ◽  
Airborne Lidar Data ◽  
Better Than

Abstract Background The universal occurrence of randomly distributed dark holes (i.e., data pits appearing within the tree crown) in LiDAR-derived canopy height models (CHMs) negatively affects the accuracy of extracted forest inventory parameters. Methods We develop an algorithm based on cloth simulation for constructing a pit-free CHM. Results The proposed algorithm effectively fills data pits of various sizes whilst preserving canopy details. Our pit-free CHMs derived from point clouds at different proportions of data pits are remarkably better than those constructed using other algorithms, as evidenced by the lowest average root mean square error (0.4981 m) between the reference CHMs and the constructed pit-free CHMs. Moreover, our pit-free CHMs show the best performance overall in terms of maximum tree height estimation (average bias = 0.9674 m). Conclusion The proposed algorithm can be adopted when working with different quality LiDAR data and shows high potential in forestry applications.

The use of Otsu algorithm and multi-temporal airborne LiDAR data to detect building changes in urban space

2021 ◽  
Author(s):  
Renato César dos Santos ◽  
Mauricio Galo ◽  
André Caceres Carrilho ◽  
Guilherme Gomes Pessoa
Keyword(s):  
Urban Space ◽  
Airborne Lidar ◽  
Lidar Data ◽  
Multi Temporal ◽  
Airborne Lidar Data

scholarly journals A Comparative Study about Data Structures Used for Efficient Management of Voxelised Full-Waveform Airborne LiDAR Data during 3D Polygonal Model Creation

2021 ◽  
Vol 13 (4) ◽  
pp. 559
Author(s):  
Milto Miltiadou ◽  
Neill D. F. Campbell ◽  
Darren Cosker ◽  
Michael G. Grant
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Airborne Lidar ◽  
Memory Allocation ◽  
Lidar Data ◽  
Full Waveform ◽  
Waveform Lidar ◽  
Airborne Lidar Data ◽  
Full Waveform Lidar ◽  
Polygonal Model

In this paper, we investigate the performance of six data structures for managing voxelised full-waveform airborne LiDAR data during 3D polygonal model creation. While full-waveform LiDAR data has been available for over a decade, extraction of peak points is the most widely used approach of interpreting them. The increased information stored within the waveform data makes interpretation and handling difficult. It is, therefore, important to research which data structures are more appropriate for storing and interpreting the data. In this paper, we investigate the performance of six data structures while voxelising and interpreting full-waveform LiDAR data for 3D polygonal model creation. The data structures are tested in terms of time efficiency and memory consumption during run-time and are the following: (1) 1D-Array that guarantees coherent memory allocation, (2) Voxel Hashing, which uses a hash table for storing the intensity values (3) Octree (4) Integral Volumes that allows finding the sum of any cuboid area in constant time, (5) Octree Max/Min, which is an upgraded octree and (6) Integral Octree, which is proposed here and it is an attempt to combine the benefits of octrees and Integral Volumes. In this paper, it is shown that Integral Volumes is the more time efficient data structure but it requires the most memory allocation. Furthermore, 1D-Array and Integral Volumes require the allocation of coherent space in memory including the empty voxels, while Voxel Hashing and the octree related data structures do not require to allocate memory for empty voxels. These data structures, therefore, and as shown in the test conducted, allocate less memory. To sum up, there is a need to investigate how the LiDAR data are stored in memory. Each tested data structure has different benefits and downsides; therefore, each application should be examined individually.

Sign in / Sign up

Export Citation Format

Share Document