Welcome to the InfoSci Platform
Reference Hub1
A Two-Stage Registration Method for Dental Volumetric Data and Mesh Data

A Two-Stage Registration Method for Dental Volumetric Data and Mesh Data

Shuai Yang, Wenjing Shi, Yongzhen Ke, Yongjiang Xue
Copyright: © 2021 |Volume: 16 |Issue: 4 |Pages: 15
ISSN: 1555-3396|EISSN: 1555-340X|EISBN13: 9781799859819|DOI: 10.4018/IJHISI.20211001.oa29
Cite Article Cite Article

MLA

Yang, Shuai, et al. "A Two-Stage Registration Method for Dental Volumetric Data and Mesh Data." IJHISI vol.16, no.4 2021: pp.1-15. http://doi.org/10.4018/IJHISI.20211001.oa29

APA

Yang, S., Shi, W., Ke, Y., & Xue, Y. (2021). A Two-Stage Registration Method for Dental Volumetric Data and Mesh Data. International Journal of Healthcare Information Systems and Informatics (IJHISI), 16(4), 1-15. http://doi.org/10.4018/IJHISI.20211001.oa29

Chicago

Yang, Shuai, et al. "A Two-Stage Registration Method for Dental Volumetric Data and Mesh Data," International Journal of Healthcare Information Systems and Informatics (IJHISI) 16, no.4: 1-15. http://doi.org/10.4018/IJHISI.20211001.oa29

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Dental computed tomography (CT) images and optical surface scan data are widely used in dental computer-aided design systems. Registration is essential if they are used in software systems. Existing automatic registration methods are either time-consuming or rough, and interactive registration methods are experience-dependent and tedious because of a great deal of purely manual interactions. For overcoming these disadvantages, a two-stage registration method is proposed. In the rough registration stage, the rough translation and rotation matrices are obtained by applying unit quaternion based method on the points interactively selected from the two types of data. In the precise registration stage, the stridden sampling is used to reduce computational complexity and the proposed registration algorithm with scale transformation is used for precise registration. The proposed method offers a good trade-off between precision and time cost. The experimental results demonstrate that the proposed method provides faster convergence and smaller registration errors than existing methods.