Abstract

Abstract. Registration of point clouds is a fundamental problem in the community of photogrammetry and 3D computer vision. Generally, point cloud registration consists of two steps: the search of correspondences and the estimation of transformation parameters. However, to find correspondences from point clouds, generating robust and discriminative features is of necessity. In this paper, we address the problem of extracting robust rotation-invariant features for fast coarse registration of point clouds under the assumption that the pairwise point clouds are transformed with rigid transformation. With a Fourier-based descriptor, point clouds represented by volumetric images can be mapped from the image to feature space. It is achieved by considering a gradient histogram as a continuous angular signal which can be well represented by the spherical harmonics. The rotation-invariance is established based on the Fourier-based analysis, in which high-frequency signals can be filtered out. This makes the extracted features robust to noises and outliers. Then, with the extracted features, pairwise correspondence can be found by the fast search. Finally, the transformation parameters can be estimated by fitting the rigid transformation model using the corresponding points and RANSAC algorithm. Experiments are conducted to prove the effectiveness of our proposed method in the task of point cloud registration. Regarding the experimental results of the point cloud registration using two TLS benchmark point cloud datasets, featuring with limited overlaps and uneven point densities and covering different urban scenes, our proposed method can achieve a fast coarse registration with rotation errors of less than 1 degree and translation errors of less than 1m.

Highlights

  • Registration of point clouds is a fundamental problem in the community of photogrammetry and 3D computer vision

  • We proposed an efficient framework for fast coarse registration of point clouds, which is sufficient in the low-overlapping dataset

  • The results reveal that the proposed method can achieve successful registration among different point cloud datasets, even for the datasets which have a comparatively low overlapping rate

Read more

Summary

Introduction

Registration of point clouds is a fundamental problem in the community of photogrammetry and 3D computer vision. Iterative closest point (ICP) (Besl, McKay, 1992, Chen, Medioni, 1991, Zhang, 1994) and its variants (Habib et al, 2010, Yang et al, 2015) are the representative algorithms and have been proved to be effective and efficient. Normal distribution transform (NDT) (Biber, Straßer, 2003) is a commonly used standard algorithm for fine registration. In the step of fine registration, proper initial transformation values are of great importance for fine registration to avoid local optimum. We address the problem of how to provide good initial transformation parameters to find registration, namely the problem of coarse registration. To achieve coarse registration of point clouds, at least two steps are required: finding the correspondences and estimating the

Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.