跳到主要导航 跳到搜索 跳到主要内容

Precise Iterative Closest Point Algrithm Based on Correntropy for 3-D Oral Data Registration

  • Xi'an Jiaotong University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名Proceedings - 2019 Chinese Automation Congress, CAC 2019
出版商Institute of Electrical and Electronics Engineers Inc.
4332-4335
页数4
ISBN(电子版)9781728140940
DOI
出版状态已出版 - 11月 2019
活动2019 Chinese Automation Congress, CAC 2019 - Hangzhou, 中国
期限: 22 11月 201924 11月 2019

出版系列

姓名Proceedings - 2019 Chinese Automation Congress, CAC 2019

会议

会议2019 Chinese Automation Congress, CAC 2019
国家/地区中国
Hangzhou
时期22/11/1924/11/19

学术指纹

探究 'Precise Iterative Closest Point Algrithm Based on Correntropy for 3-D Oral Data Registration' 的科研主题。它们共同构成独一无二的指纹。

引用此