Urban Terrain and Building Extraction from Airborne LIDAR Data

2006 ◽  
pp. 21-47 ◽  
Author(s):  
Jie Shan ◽  
Aparajithan Sampath
Keyword(s):  
Airborne Lidar ◽  
Lidar Data ◽  
Building Extraction ◽  
Urban Terrain ◽  
Airborne Lidar Data

scholarly journals Building Extraction from Airborne LiDAR Data Based on Multi-Constraints Graph Segmentation

2021 ◽  
Vol 13 (18) ◽  
pp. 3766
Author(s):  
Zhenyang Hui ◽  
Zhuoxuan Li ◽  
Penggen Cheng ◽  
Yao Yevenyo Ziggah ◽  
JunLin Fan
Keyword(s):  
Point Clouds ◽  
Optimization Method ◽  
Extraction Methods ◽  
Urban Environments ◽  
Airborne Lidar ◽  
Lidar Data ◽  
Building Extraction ◽  
Existing Building ◽  
Significant Step ◽  
Airborne Lidar Data

Building extraction from airborne Light Detection and Ranging (LiDAR) point clouds is a significant step in the process of digital urban construction. Although the existing building extraction methods perform well in simple urban environments, when encountering complicated city environments with irregular building shapes or varying building sizes, these methods cannot achieve satisfactory building extraction results. To address these challenges, a building extraction method from airborne LiDAR data based on multi-constraints graph segmentation was proposed in this paper. The proposed method mainly converted point-based building extraction into object-based building extraction through multi-constraints graph segmentation. The initial extracted building points were derived according to the spatial geometric features of different object primitives. Finally, a multi-scale progressive growth optimization method was proposed to recover some omitted building points and improve the completeness of building extraction. The proposed method was tested and validated using three datasets provided by the International Society for Photogrammetry and Remote Sensing (ISPRS). Experimental results show that the proposed method can achieve the best building extraction results. It was also found that no matter the average quality or the average F1 score, the proposed method outperformed ten other investigated building extraction methods.

scholarly journals Synergy Between LiDAR and Image Data in Context of Building Extraction

2014 ◽  
Vol XL-1 ◽  
pp. 89-93
Author(s):  
A. P. Dal Poz
Keyword(s):  
Image Data ◽  
Airborne Lidar ◽  
Lidar Data ◽  
Theoretical Studies ◽  
Building Extraction ◽  
Building Roof ◽  
Photogrammetric Method ◽  
Airborne Lidar Data

This paper compares the paradigms of LiDAR and aerophotogrammetry in the context of building extraction and briefly discusses a photogrammetric strategy for refining building roof polyhedrons previously extracted from LiDAR data. In general, empirical and theoretical studies have confirmed that LiDAR-based methodologies are more suitable in extracting planar roof faces and ridges of the roof, whereas the aerophotogrammetry are more suitable in extracting building roof outlines. In order to exemplify how to explore these properties, it is presented a photogrammetric method for refining 3D building roof contours extracted from airborne LiDAR data. Examples of application are provided for this refining approach.

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