Over the past years, several algorithms have been proposed for extracting planar roof faces from airborne laser point clouds. These roof patches are used for automatic reconstruction of three dimensional building models. The models are useful in applications such as cadastral, urban planning, tourism, facility management, telecommunication network planning, real estate, vehicle and pedestrians’ navigation, and upcoming applications such as location based services and augmented reality. The intention of this research was to evaluate performance of different algorithms proposed for detecting roof faces. Analysis was done for performance in terms of completeness and accuracy of extracted faces, and for processing speed. The approaches to roof faces detection from laser data were reviewed and a selection made for two algorithms that were analysed. These are Plane growing of points using 3DHough Transform seed selection and Plane growing using TINmeshes. A working software was obtained for the former and literature transformed to a working software tool for the latter. Parameters of the algorithms were tuned to the optimum, used in experiments with data at different levels of point spacing to extract roof faces of varying complexity and then results analysed. Reference data sets were created interactively and a methodology, involving performance matrices, for comparing reference to detected faces was developed. A software tool was prepared for computing these matrices and then determining the number of correctly segmented roof faces, over segmented, under segmented, missed faces and noise segmentations. The tool also computes accuracy of the correctly detected faces in terms of angle and distance between the detected and corresponding faces in reference. All large faces can be detected by both algorithms. Faces with small objects such as chimneys and dormers are correctly detected by the 3D Hough algorithm while they are over segmented by the TIN algorithm. The geometric accuracy of the detected faces is high for both algorithms, a little higher for Hough than TIN. The performance for both algorithms gradually decreases with increase in point spacing. The speed of processing is in the tune of seconds for Hough while TIN takes longer up to hours depending on data size. The developed methodology can be used for other analyses while already, with the 3D Hough algorithm, roof faces can be reliably detected. Three dimensional building models can thus be more accurately and automatically constructed.
[1]
Menno-Jan Kraak,et al.
Principles of geographic information systems : an introductory textbook
,
2000
.
[2]
F. Meer,et al.
Principles of remote sensing : an introductory textbook.
,
2000
.
[3]
George Vosselman,et al.
3D BUILDING MODEL RECONSTRUCTION FROM POINT CLOUDS AND GROUND PLANS
,
2001
.
[4]
George Vosselman,et al.
Accuracy of 3D city models: EuroSDR comparison
,
2005
.
[5]
R. Reulke,et al.
Remote Sensing and Spatial Information Sciences
,
2005
.
[6]
J. Trinder,et al.
Automated delineation of roof planes from LIDAR data
,
2005
.
[7]
C. Brenner.
Building reconstruction from images and laser scanning
,
2005
.
[8]
Andrew W. Fitzgibbon,et al.
An Experimental Comparison of Range Image Segmentation Algorithms
,
1996,
IEEE Trans. Pattern Anal. Mach. Intell..
[9]
B. Gorte.
SEGMENTATION OF TIN-STRUCTURED SURFACE MODELS
,
2002
.
[10]
G. Sithole,et al.
Recognising structure in laser scanning point clouds
,
2004
.
[11]
George Vosselman,et al.
Two algorithms for extracting building models from raw laser altimetry data
,
1999
.
[12]
Hans-Gerd Maas,et al.
3D BUILDING MODEL GENERATION FROM AIRBORNE LASER SCANNER DATA USING 2D GIS DATA AND ORTHOGONAL POINT CLOUD PROJECTIONS
,
2005
.
[13]
G. Sithole,et al.
Automatic structure detection in a point-cloud of an urban landscape
,
2003,
2003 2nd GRSS/ISPRS Joint Workshop on Remote Sensing and Data Fusion over Urban Areas.
[14]
Horst Bunke,et al.
Fast segmentation of range images into planar regions by scan line grouping
,
1994,
Machine Vision and Applications.