TY - JOUR
T1 - Robust and precise isotropic scaling registration algorithm using bi-directional distance and correntropy
AU - Cui, Wenting
AU - Du, Shaoyi
AU - Wan, Teng
AU - Yao, Runzhao
AU - Liu, Yuying
AU - Han, Mengqi
AU - Mou, Qingnan
AU - Guo, Yu cheng
AU - Zheng, Nanning
N1 - Publisher Copyright:
© 2020
PY - 2020/10
Y1 - 2020/10
N2 - In orthodontics, a patient is collected a lot of 3D oral cavity data, including oral cavity gypsum and scan data sets. To accurately measure the patient's tooth movement, this paper proposes a robust and precise isotropic scaling registration algorithm using bi-directional distance and correntropy. Firstly, because the oral cavity gypsum data sets have a lot of gypsum tumors and bubbles, which can cause the accuracy of registration results to decrease. Then, we introduce the correntropy into the traditional scaling registration model. Secondly, since unconstrained scaling registration is an ill-posed problem, bi-directional distance is used to enhance the robustness. In this way, a registration model using bi-directional distance and correntropy is established. In order to solve this problem, this paper proposes a new registration algorithm with iterative closest point. Moreover, the convergence of the algorithm is proved theoretically. Finally, the proposed algorithm is tested on the orthodontic database, and our experimental results demonstrate that our algorithm performs robust and high accuracy.
AB - In orthodontics, a patient is collected a lot of 3D oral cavity data, including oral cavity gypsum and scan data sets. To accurately measure the patient's tooth movement, this paper proposes a robust and precise isotropic scaling registration algorithm using bi-directional distance and correntropy. Firstly, because the oral cavity gypsum data sets have a lot of gypsum tumors and bubbles, which can cause the accuracy of registration results to decrease. Then, we introduce the correntropy into the traditional scaling registration model. Secondly, since unconstrained scaling registration is an ill-posed problem, bi-directional distance is used to enhance the robustness. In this way, a registration model using bi-directional distance and correntropy is established. In order to solve this problem, this paper proposes a new registration algorithm with iterative closest point. Moreover, the convergence of the algorithm is proved theoretically. Finally, the proposed algorithm is tested on the orthodontic database, and our experimental results demonstrate that our algorithm performs robust and high accuracy.
KW - Bi-Directional Distance
KW - Correntropy
KW - Iterative Closest Point
KW - Scaling Registration
UR - https://www.scopus.com/pages/publications/85088888114
U2 - 10.1016/j.patrec.2020.07.026
DO - 10.1016/j.patrec.2020.07.026
M3 - 文章
AN - SCOPUS:85088888114
SN - 0167-8655
VL - 138
SP - 298
EP - 304
JO - Pattern Recognition Letters
JF - Pattern Recognition Letters
ER -