Point cloud registration is an important method in 3D point cloud processing, which is used in computer vision, autonomous driving, and other fields. Point cloud registration looks for the optimal rigid transformation that can align two input point clouds to a common coordinate system. The most common method of alignment using geometric characteristics is the Iterative Closest Point (ICP) algorithm. The disadvantage of classical ICP variants, such as pointto-point and point-to-plane, is their dependence on the initial placement of point clouds. If the rotation that can align two point clouds is sufficiently large, the ICP algorithm can converge to a local minimum. Coarse point clouds registration algorithms are used to find a suitable initial alignment of two clouds. In particular, feature-based methods for coarse registration are known. In this paper, we propose an algorithm to extract the common parts of the incongruent point clouds and coarsely aligning them. We use the SHOT algorithm to find a match between two point clouds. The corresponding neighborhoods are obtained by the correspondence between points. The neighborhoods define local vector bases that allow computing an orthogonal transformation. The proposed algorithm extracts common parts of incongruent point clouds. Computer simulation results are provided to illustrate the performance of the proposed method.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.