The comparison of 2D and 3D detectors for TLS data registration- preliminary results
Jakub Markiewicz , Łukasz Markiewicz , Piotr Jan Foryś
AbstractThis paper presents the analysis of possible methods of a terrestrial laser scanning (TLS) data registration using 2D/3D detectors and descriptors. The developed approach, where point clouds are processed in form of panoramic images, orthoimages and 3D data, was described. The accuracy of the registration process was preliminary verified. The two approaches were analysed and compared: the 2D SIFT (Scale-Invariant Feature Transform) detector and descriptor with the rasterized TLS data and the 3D SIFT detector with the 3D FPFH (Fast Point Feature Histograms) descriptor. The feature points were found and preliminary matched using the OpenCV and PCL (Point Cloud Library) libraries. In order to find the best point cloud representation for the registration process, both the percentage and distribution of the correctly detected and matched points were analysed. The materials consisted of the point clouds of two chambers from the Museum of King John III’s Palace in Wilanów. They were acquired using the Z+F 5006h and 5003 TLS scanners. The performed analysis showed that the lowest RMSE values were for the 2D detectors and orthoimages. However, in the case of the point number and distribution, better results were obtained for using the 3D detector.
|Journal series||The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, ISSN 1682-1750, [2194-9034], (0 pkt)|
|Publication size in sheets||0.5|
|Conference||8th International Workshop - 3D Virtual Reconstruction and Visualization of Complex Architectures (3D-ARCH'2019), 06-02-2019 - 08-02-2019, Bergamo, Włochy|
|Keywords in English||cultural heritage, TLS data registration, feature-based method, 2D and 3D detectors, accuracy analysis|
|Score||= 5.0, 20-10-2019, ArticleFromConference|
|Publication indicators||= 0|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.