Search

Laser scanning, along with its resultant 3D point clouds, constitutes a prevalent method for the documentation of cultural heritage. This paper introduces a novel workflow for the structural analysis of glazed tubular tiles that adorn the roofs of historical buildings in the Orient, utilizing 3D point clouds. The workflow integrates a robust segmentation algorithm utilizing the maximum principal curvature and normal vectors. Moreover, clustering algorithms, including DBSCAN, are incorporated to refine the clusters and thus increase segmentation accuracy. Structural analysis is enabled by cylindrical model fitting, which allows for the estimation of parameters and residuals. While the results exhibit commendable performance in individual tile segmentation, it is imperative to address the impact of substantial variations in scanning range and incident angles before engaging in the structural analysis fitting process. The results of experiment demonstrate that under conditions of significantly large scanning angles, the root mean square error (RMSE) for inadequately fitted tiles can extend to 0.066 m, surpassing twice the RMSE observed for well-fitted tiles. The proposed workflow proves to be applicable and exhibits significant potential to advance practices in cultural heritage documentation. [ABSTRACT FROM AUTHOR]

Planar feature segmentation is an essential task for 3D point cloud processing, finding many applications in various fields such as robotics and computer vision. The Random Sample Consensus (RANSAC) is one of the most common algorithms for the segmentation, but its performance, as given by the original form, is usually limited due to the use of a single threshold and interruption of similar planar features presented close to each other. To address these issues, we present a novel point cloud processing workflow which aims at developing an initial segmentation stage before the basic RANSAC is performed. Initially, normal vectors and maximum principal curvatures for each point of a given point cloud are analyzed and integrated. Subsequently, a subset of normal vectors and curvature is utilized to cluster planes with similar geometry based on the region growing algorithm, serving as a coarse but fast segmentation process. The segmentation is therefore refined with the RANSAC algorithm which can be now performed with higher accuracy and speed due to the reduced interference. After the RANSAC process is applied, resultant planar point clouds are built from the sparse ones via a point aggregation process based on geometric constraints. Four datasets (three real and one simulated) were used to verify the method. Compared to the classic segmentation method, our method achieves higher accuracy, with an RMSE from fitting equal to 0.0521 m, along with a higher recall of 93.31% and a higher F1-score of 95.38%. [ABSTRACT FROM AUTHOR]