Efficient Registration of Intraoral Point Clouds Using 3-D Spatial Consistent Grouping Method With Global Optimization

被引:0
|
作者
Wang, Zhen [1 ]
Chen, Mohan [2 ]
Chen, Sheng [1 ]
机构
[1] Univ Shanghai Sci & Technol, Dept Control, Shanghai 200093, Peoples R China
[2] Shanghai Univ Elect Power, Dept Instrumentat & Measurement, Shanghai 200093, Peoples R China
基金
中国国家自然科学基金;
关键词
Point cloud compression; Training; Three-dimensional displays; Data mining; Artificial intelligence; Signal to noise ratio; Image reconstruction; Accuracy; Surface treatment; Surface reconstruction; Intraoral scanning; point cloud; registration; DIGITAL IMPLANT IMPRESSIONS; ACCURACY; SCANNER;
D O I
10.1109/TIM.2025.3551013
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Intraoral 3-D scanning is a vital component of modern oral therapy. Because of the limited field of view (FOV) and degraded image quality of the intraoral scanner, matching the bundle of the intraoral dense point clouds with a low signal-to-noise ratio (SNR) in real time (approximately 25 point clouds per second) is challenging; consequently, the accuracy of the reconstructed full arch gets degraded. This study proposes an innovative matching method for intraoral point clouds with high efficiency, which involves a 3-D spatial consistent grouping (3D-SCG) method in the intraoral scanning scheme. First, the method introduces the Tooth-Net module, which is a multilayer neural network based on the attention mechanism, to achieve high-dimensional geometric features using the corresponding pairs between intraoral point clouds to be matched. Subsequently, outliers are removed based on the geometric features in the outlier removal module, which comprises Score-Net, nonmaximum suppression (NMS), and K-nearest neighbor (KNN) with spectral matching (SM). High confidence by Score-Net and well-distributed correspondences by NMS are converted into scores, and KNN is used to reduce the size of the high-score matrix. The weights generated by the SM module for each corresponding pair are used to calculate the best matching matrix. Four small- and four large-scale high-density intraoral point-cloud datasets are collected to validate the proposed method. Both small- and large-scale intraoral point clouds can be matched in real time. The overall time consumption is reduced by approximately 80% compared with the traditional matching method for intraoral point clouds, which is based on fast point feature histograms (FPFHs) with an iterative closest point (ICP) algorithm; nonetheless, the matching accuracy is comparable. Moreover, the matching failure rate is reduced by 33% during intraoral scanning. The proposed matching method based on 3D-SCG is efficient for intraoral point clouds with a low SNR and high density.
引用
收藏
页数:14
相关论文
共 50 条
  • [11] A Registration Method for 3D Point Clouds with Convolutional Neural Network
    Ai, Shangyou
    Jia, Lei
    Zhuang, Chungang
    Ding, Han
    INTELLIGENT ROBOTICS AND APPLICATIONS, ICIRA 2017, PT III, 2017, 10464 : 377 - 387
  • [12] Registration optimization algorithm for 3D cultural relics point clouds model
    1600, Institute of Computing Technology (28):
  • [13] Unconstrained registration of 3-D scattered point clouds for free-form shape measurement
    Ren, Tong-Qun
    Zhao, Yue-Han
    Gong, Chun-Zhong
    Zhang, Li-Hua
    Guangxue Jingmi Gongcheng/Optics and Precision Engineering, 2013, 21 (05): : 1234 - 1243
  • [14] A Fast Multiplane Segmentation Algorithm for Sparse 3-D LiDAR Point Clouds by Line Segment Grouping
    Du, Xiaoguo
    Lu, Yuchu
    Chen, Qijun
    IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2023, 72
  • [15] ALReg: Registration of 3D Point Clouds Using Active Learning
    Sahin, Yusuf Huseyin
    Karabacak, Oguzhan
    Kandemir, Melih
    Unal, Gozde
    APPLIED SCIENCES-BASEL, 2023, 13 (13):
  • [16] Registration of Point Clouds in 3D Space Using Soft Alignment
    Makovetskii, A. Yu.
    Kober, V.I.
    Voronin, S.M.
    Voronin, A.V.
    Karnaukhov, V.N.
    Mozerov, M.G.
    Journal of Communications Technology and Electronics, 2024,
  • [17] A Fast Multiplane Segmentation Algorithm for Sparse 3-D LiDAR Point Clouds by Line Segment Grouping
    Du, Xiaoguo
    Lu, Yuchu
    Chen, Qijun
    IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2023, 72
  • [18] A Fast Multiplane Segmentation Algorithm for Sparse 3-D LiDAR Point Clouds by Line Segment Grouping
    Du, Xiaoguo
    Lu, Yuchu
    Chen, Qijun
    IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2023, 72
  • [19] Registration of Point Clouds in 3D Space Using Soft Alignment
    Makovetskii, A. Yu.
    Kober, V. I.
    Voronin, S. M.
    Voronin, A. V.
    Karnaukhov, V. N.
    Mozerov, M. G.
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2024, : 7 - 15
  • [20] COMPRESSION OF 3-D POINT CLOUDS USING HIERARCHICAL PATCH FITTING
    Cohen, Robert A.
    Krivokuca, Maja
    Feng, Chen
    Taguchi, Yuichi
    Ochimizu, Hideaki
    Tian, Dong
    Vetro, Anthony
    2017 24TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2017, : 4033 - 4037