TY - JOUR
T1 - New iterative closest point algorithm for isotropic scaling registration of point sets with noise
AU - Du, Shaoyi
AU - Liu, Juan
AU - Bi, Bo
AU - Zhu, Jihua
AU - Xue, Jianru
N1 - Publisher Copyright:
© 2016 Elsevier Inc. All rights reserved.
PY - 2016/7
Y1 - 2016/7
N2 - This paper proposes a new probability iterative closest point (ICP) approach with bounded scale based on expectation maximization (EM) estimation for isotropic scaling registration of point sets with noise. The bounded-scale ICP algorithm can handle the case with different scales, but it could not effectively yield the alignment of point sets with noise. Aiming at improving registration precision, a Gaussian probability model is integrated into the bounded-scale registration problem, which is solved by the proposed method. This new method can be solved by the E-step and M-step. In the E-step, the one-to-one correspondence is built up between two point sets. In the M-step, the scale transformation including the rotation matrix, translation vector and scale factor is computed by singular value decomposition (SVD) method and the properties of parabola. Then, the Gaussian model is updated via the distance and variance between transformed point sets. Experimental results demonstrate the proposed method improves the performance significantly with high precision and fast speed.
AB - This paper proposes a new probability iterative closest point (ICP) approach with bounded scale based on expectation maximization (EM) estimation for isotropic scaling registration of point sets with noise. The bounded-scale ICP algorithm can handle the case with different scales, but it could not effectively yield the alignment of point sets with noise. Aiming at improving registration precision, a Gaussian probability model is integrated into the bounded-scale registration problem, which is solved by the proposed method. This new method can be solved by the E-step and M-step. In the E-step, the one-to-one correspondence is built up between two point sets. In the M-step, the scale transformation including the rotation matrix, translation vector and scale factor is computed by singular value decomposition (SVD) method and the properties of parabola. Then, the Gaussian model is updated via the distance and variance between transformed point sets. Experimental results demonstrate the proposed method improves the performance significantly with high precision and fast speed.
KW - Bounded scale
KW - Gaussian model
KW - Iterative closest point
KW - Noise
KW - Point set registration
UR - https://www.scopus.com/pages/publications/84960082656
U2 - 10.1016/j.jvcir.2016.02.019
DO - 10.1016/j.jvcir.2016.02.019
M3 - 文章
AN - SCOPUS:84960082656
SN - 1047-3203
VL - 38
SP - 207
EP - 216
JO - Journal of Visual Communication and Image Representation
JF - Journal of Visual Communication and Image Representation
ER -