A Voronoi-Diagram-based method for centerline extraction in 3D industrial line-laser reconstruction using a graph-centrality-based pruning algorithm

被引:8
作者
Chen, Cheng [1 ]
Mei, Xuesong [1 ]
Hou, Dongxiang [1 ]
Fan, Zhengjie [1 ]
Huang, Wangwang [1 ]
机构
[1] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China
来源
OPTIK | 2022年 / 261卷
基金
中国国家自然科学基金;
关键词
Voronoi diagram; Centerline extraction; Pruning algorithm; Graph centrality; 3D line-laser reconstruction;
D O I
10.1016/j.ijleo.2022.169179
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Three-dimensional (3D) line-laser scanning is a widely used 3D reconstruction technique in the industry. As a key procedure of 3D line-laser scanning, centerline extraction of laser stripes directly determines the accuracy of reconstructed 3D models. Because of the noise inside laser stripes, centerline extraction methods based on the gray distribution may provide biased results. In order to address this problem, a Voronoi-diagram-based method (VM) for centerline extraction, which can extract centerlines accurately under severe noises, is proposed. To solve the emerging problems when the Voronoi diagram is applied to line-laser stripes, a fast pruning algorithm based on the distribution of graph centrality is proposed, and two centerline extension algorithms based on least square fitting are developed. The experiments are performed on synthetic images and a line-laser 3D scanner to evaluate the method's accuracy, robustness, and efficiency. The VM method is proved to have better accuracy and robustness than the traditional method. Simulation experiments show that the VM can extract centerlines from noisy images with an average accuracy of 0.35 pixels. Also, 3D reconstruction experiments of a phi 20-mm standard sphere demonstrate an average accuracy of 0.0282 mm. With four-thread acceleration, the proposed method can process images with a resolution of 2448 x 2048 pixels in 0.5 s. The accuracy and speed of the proposed method can be adjusted by changing the parameter related to the density of contour points, which makes this method flexible and widely applicable in applications with different requirements.
引用
收藏
页数:20
相关论文
共 35 条
[1]   Laser line triangulation for fast 3D measurements on large gears [J].
Auerswald, Matthias Marcus ;
von Freyberg, Axel ;
Fischer, Andreas .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2019, 100 (9-12) :2423-2433
[2]   The Quickhull algorithm for convex hulls [J].
Barber, CB ;
Dobkin, DP ;
Huhdanpaa, H .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483
[3]   Optical 3D laser measurement system for navigation of autonomous mobile robot [J].
Basaca-Preciado, Luis C. ;
Sergiyenko, Oleg Yu. ;
Rodriguez-Quinonez, Julio C. ;
Garcia, Xochitl ;
Tyrsa, Vera V. ;
Rivas-Lopez, Moises ;
Hernandez-Balbuena, Daniel ;
Mercorelli, Paolo ;
Podrygalo, Mikhail ;
Gurko, Alexander ;
Tabakova, Irina ;
Starostenko, Oleg .
OPTICS AND LASERS IN ENGINEERING, 2014, 54 :159-169
[4]   Axioms for Centrality [J].
Boldi, Paolo ;
Vigna, Sebastiano .
INTERNET MATHEMATICS, 2014, 10 (3-4) :222-262
[5]  
BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631
[6]  
Bradski G, 2000, DR DOBBS J, V25, P120
[7]   On variants of shortest-path betweenness centrality and their generic computation [J].
Brandes, Ulrik .
SOCIAL NETWORKS, 2008, 30 (02) :136-145
[8]  
Cho K.-H., 2013, Encyclopedia of Systems Biology
[9]   Subgraph centrality in complex networks -: art. no. 056103 [J].
Estrada, E ;
Rodríguez-Velázquez, JA .
PHYSICAL REVIEW E, 2005, 71 (05)
[10]  
Fisher R.B., 1996, IMAGE TECHNOLOGY ADV, P385, DOI DOI 10.1007/978-3-642-58288-2_15