Login | Register

DNSS: Dual-Normal-Space Sampling for 3-D ICP Registration

Title:

DNSS: Dual-Normal-Space Sampling for 3-D ICP Registration

Kwok, Tsz-Ho ORCID: https://orcid.org/0000-0001-7240-1426 (2019) DNSS: Dual-Normal-Space Sampling for 3-D ICP Registration. IEEE Transactions on Automation Science and Engineering, 16 (1). pp. 241-252. ISSN 1545-5955

[img]
Preview
Text (application/pdf)
TASE18_DNSS.pdf
5MB

Official URL: http://dx.doi.org/10.1109/TASE.2018.2802725

Abstract

Rigid registration is a fundamental process in many applications that require alignment of different datasets. Iterative closest point (ICP) is a widely used algorithm that iteratively finds point correspondences and updates the rigid transformation. One of the key variants of ICP to its success is the selection of points, which is directly related to the convergence and robustness of the ICP algorithm. Besides uniform sampling, there are a number of normal-based and feature-based approaches that consider normal, curvature, and/or other signals in the point selection. Among them, normal-space sampling (NSS) is one of the most popular techniques due to its simplicity and low computational cost. The rationale of NSS is to sample enough constraints to determine all the components of transformation, but this paper finds that NSS actually can constrain the translational normal space only. This paper extends the fundamental idea of NSS and proposes Dual NSS (DNSS) to sample points in both translational and rotational normal spaces. Compared with NSS, this approach has similar simplicity and efficiency without any need of additional information, but has a much better effectiveness. Experimental results show that DNSS can outperform the normal-based and feature-based methods in terms of convergence and robustness. For example, DNSS can achieve convergence from an orthogonal initial position while no other methods can achieve. Note to Practitioners-ICP is commonly used to align different data to a same coordination system. While NSS is often used to speed up the alignment process by down-sampling the data uniformly in the normal space. The implementation of NSS only has three steps: 1) construct a set of buckets in the normal-space; 2) put all points of the data into buckets based on their normal direction; and 3) uniformly pick points from all the buckets until the desired number of points is selected. The algorithm is simple and fast, so that it is still the common practice. However, the weakness of NSS comes from the reason that it cannot handle rotational uncertainties. In this paper, a new algorithm called DNSS is developed to constrain both translation and rotation at the same time by introducing a dual-normal space. With a new definition of the normal space, the algorithm complexity of DNSS is the same as that of NSS, and it can be readily implemented in all types of application that are currently using ICP. The experimental results show that DNSS has better efficiency, quality, and reliability than both normal-based and feature-based methods have.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Mechanical, Industrial and Aerospace Engineering
Item Type:Article
Refereed:Yes
Authors:Kwok, Tsz-Ho
Journal or Publication:IEEE Transactions on Automation Science and Engineering
Date:2019
Funders:
  • Natural Sciences and Engineering Research Council of Canada (NSERC)
Digital Object Identifier (DOI):10.1109/TASE.2018.2802725
Keywords:Iterative closest point algorithm, convergence, Robustness, Shape, Robots. Computational modeling, Complexity theory
ID Code:985960
Deposited By: TSZ HO KWOK
Deposited On:11 Feb 2020 17:01
Last Modified:11 Feb 2020 17:01
Additional Information:© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top