scholarly journals Coarse-to-Fine Registration of Airborne LiDAR Data and Optical Imagery on Urban Scenes

2020 ◽  
Vol 13 ◽  
pp. 3125-3144 ◽  
Author(s):  
Thanh Huy Nguyen ◽  
Sylvie Daniel ◽  
Didier Gueriot ◽  
Christophe Sintes ◽  
Jean-Marc Le Caillec
Keyword(s):  
Airborne Lidar ◽  
Lidar Data ◽  
Urban Scenes ◽  
Optical Imagery ◽  
Airborne Lidar Data ◽  
Coarse To Fine ◽  
Fine Registration

scholarly journals An energy minimization approach to automated extraction of regular building footprints from airborne LiDAR data

2014 ◽  
Vol II-3 ◽  
pp. 65-72 ◽  
Author(s):  
Y. He ◽  
C. Zhang ◽  
C. S. Fraser
Keyword(s):  
Energy Function ◽  
Energy Minimization ◽  
Large Scale ◽  
Spatial Information ◽  
Structural Complexity ◽  
Airborne Lidar ◽  
Lidar Data ◽  
Urban Scenes ◽  
Irregular Point ◽  
Airborne Lidar Data

This paper presents an automated approach to the extraction of building footprints from airborne LiDAR data based on energy minimization. Automated 3D building reconstruction in complex urban scenes has been a long-standing challenge in photogrammetry and computer vision. Building footprints constitute a fundamental component of a 3D building model and they are useful for a variety of applications. Airborne LiDAR provides large-scale elevation representation of urban scene and as such is an important data source for object reconstruction in spatial information systems. However, LiDAR points on building edges often exhibit a jagged pattern, partially due to either occlusion from neighbouring objects, such as overhanging trees, or to the nature of the data itself, including unavoidable noise and irregular point distributions. The explicit 3D reconstruction may thus result in irregular or incomplete building polygons. In the presented work, a vertex-driven Douglas-Peucker method is developed to generate polygonal hypotheses from points forming initial building outlines. The energy function is adopted to examine and evaluate each hypothesis and the optimal polygon is determined through energy minimization. The energy minimization also plays a key role in bridging gaps, where the building outlines are ambiguous due to insufficient LiDAR points. In formulating the energy function, hard constraints such as parallelism and perpendicularity of building edges are imposed, and local and global adjustments are applied. The developed approach has been extensively tested and evaluated on datasets with varying point cloud density over different terrain types. Results are presented and analysed. The successful reconstruction of building footprints, of varying structural complexity, along with a quantitative assessment employing accurate reference data, demonstrate the practical potential of the proposed approach.

scholarly journals UNSUPERVISED AUTOMATIC BUILDING EXTRACTION USING ACTIVE CONTOUR MODEL ON UNREGISTERED OPTICAL IMAGERY AND AIRBORNE LIDAR DATA

2019 ◽  
Vol XLII-2/W16 ◽  
pp. 181-188 ◽  
Author(s):  
T. H. Nguyen ◽  
S. Daniel ◽  
D. Guériot ◽  
C. Sintès ◽  
J.-M. Le Caillec
Keyword(s):  
Active Contour ◽  
Active Contour Model ◽  
Airborne Lidar ◽  
Training Data ◽  
Building Extraction ◽  
Snake Model ◽  
Urban Scenes ◽  
Contour Model ◽  
Optical Imagery ◽  
Airborne Lidar Data

<p><strong>Abstract.</strong> Automatic extraction of buildings in urban scenes has become a subject of growing interest in the domain of photogrammetry and remote sensing, particularly with the emergence of LiDAR systems since mid-1990s. However, in reality, this task is still very challenging due to the complexity of building size and shape, as well as its surrounding environment. Active contour model, colloquially called snake model, which has been extensively used in many applications in computer vision and image processing, has also been applied to extract buildings from aerial/satellite imagery. Motivated by the limitations of existing snake models dedicated to the building extraction, this paper presents an unsupervised and automatic snake model to extract buildings using optical imagery and an unregistered airborne LiDAR dataset, without manual initial points or training data. The proposed method is shown to be capable of extracting buildings with varying color from complex environments, and yielding high overall accuracy.</p>

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