TY - GEN
T1 - Precise Iterative Closest Point Algrithm Based on Correntropy for 3-D Oral Data Registration
AU - Liu, Yuying
AU - Du, Shaoyi
AU - Cui, Wenting
AU - Wan, Teng
AU - Xie, Qixing
AU - Han, Mengqi
AU - Chu, Guang
AU - Guo, Yucheng
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - This paper proposes a new iterative closest point approach based on correntropy with feature guided. Iterative Closest Point (ICP) algorithm can deal with most rigid registration problems, but for point sets with lots of noise and outliers, ICP cannot achieve high precision. We introduce correntropy into ICP to handle this problem by suppressing the influence of the noise and outliers. In terms of point sets contain a large proportion of planes or a curved surface, and have single structure, such as a three-dimensional model of upper jaw, we propose a feature-guided model to solve the oral data registration problem, which uses both the feature and the original data to participate in the registration, but with different weights. Our method mainly deals with the point set registration which has single structure and contains outliers. Experimental results demonstrate that the proposed algorithm is precise and robust.
AB - This paper proposes a new iterative closest point approach based on correntropy with feature guided. Iterative Closest Point (ICP) algorithm can deal with most rigid registration problems, but for point sets with lots of noise and outliers, ICP cannot achieve high precision. We introduce correntropy into ICP to handle this problem by suppressing the influence of the noise and outliers. In terms of point sets contain a large proportion of planes or a curved surface, and have single structure, such as a three-dimensional model of upper jaw, we propose a feature-guided model to solve the oral data registration problem, which uses both the feature and the original data to participate in the registration, but with different weights. Our method mainly deals with the point set registration which has single structure and contains outliers. Experimental results demonstrate that the proposed algorithm is precise and robust.
KW - correntropy
KW - iterative closest point
KW - orthodontics
KW - point set registration
UR - https://www.scopus.com/pages/publications/85080034533
U2 - 10.1109/CAC48633.2019.8996407
DO - 10.1109/CAC48633.2019.8996407
M3 - 会议稿件
AN - SCOPUS:85080034533
T3 - Proceedings - 2019 Chinese Automation Congress, CAC 2019
SP - 4332
EP - 4335
BT - Proceedings - 2019 Chinese Automation Congress, CAC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 Chinese Automation Congress, CAC 2019
Y2 - 22 November 2019 through 24 November 2019
ER -