Strategy Adaptive Particle Swarm Optimization Algorithm for Solving Free-Form Surface Registration to Improve Detection Accuracy

被引:1
作者
Li, Yaru [1 ]
Zhang, Ruijie [1 ]
Luo, Zai [1 ]
Tang, Yingqi [2 ]
Jiang, Wensong [1 ]
Cheng, Yinbao [1 ]
Wang, Qiyue [3 ]
机构
[1] China Jiliang Univ, Coll Metrol & Measurement & Instrument, Hangzhou 310018, Peoples R China
[2] Beijing Inst Technol, Sch Opt & Photon, Beijing 100081, Peoples R China
[3] Amazon, Sunnyvale, CA 94089 USA
基金
中国国家自然科学基金;
关键词
Surface morphology; Extraterrestrial measurements; Accuracy; Optical variables measurement; Particle measurements; Atmospheric measurements; Phase measurement; Free-form surface; fringe projection profilometry (FPP); metaheuristic algorithm; particle swarm optimization (PSO); point cloud registration; FRINGE PROJECTION PROFILOMETRY; RANGE IMAGE REGISTRATION; PHASE; MODEL;
D O I
10.1109/TIM.2024.3453320
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The registration between the design model and the actual measurement model is a key problem in the detection of free-form surface parts. To improve the accuracy and robustness of free-form surface parts inspection, a strategy adaptive particle swarm optimization (SAPSO) algorithm is proposed. Using the parameters composed of rotation and displacement variables as individual parameters, taking the minimum Euclidean distance between two models as the objective function and evolving from generation to generation, the calculation results can be guaranteed to be the global optimal solution. In SAPSO, an adaptive mechanism of inertia weight and velocity update strategy of particles is proposed to balance the global search and local exploration capabilities. The SAPSO algorithm is compared with other particle swarm optimization (PSO) variants. Simulation and actual measurement experiments show that the proposed algorithm is superior to other algorithms in terms of accuracy and robustness, and the effectiveness and practicability of SAPSO algorithm are verified.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] High-speed 3-D reconstruction based on phase shift coding and interleaved projection
    An, Haihua
    Cao, Yiping
    Li, Hongmei
    Zhang, Hechen
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2023, 234
  • [2] Phase-Shifting Temporal Phase Unwrapping Algorithm for High-Speed Fringe Projection Profilometry
    An, Haihua
    Cao, Yiping
    Zhang, Ying
    Li, Hongmei
    [J]. IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2023, 72
  • [3] Digital moire for measurements on cylindrical objects
    Asundi, A
    Sajan, MR
    [J]. JOURNAL OF OPTICS-NOUVELLE REVUE D OPTIQUE, 1998, 29 (03): : 128 - 134
  • [4] Benchmark of multi-view Terrestrial Laser Scanning Point Cloud data registration algorithms
    Bedkowski, Janusz
    [J]. MEASUREMENT, 2023, 219
  • [5] Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach
    Bergstrom, Per
    Edlund, Ove
    [J]. NUMERICAL ALGORITHMS, 2017, 74 (03) : 755 - 779
  • [6] Particle swarm optimization of nanoantenna-based infrared detectors
    Briones, Edgar
    Ruiz-Cruz, Riemann
    Briones, Joel
    Gonzalez, Natalia
    Simon, Jorge
    Arreola, Mayela
    Alvarez-Alvarez, Gregorio
    [J]. OPTICS EXPRESS, 2018, 26 (22): : 28484 - 28496
  • [7] Chaotic dynamic weight particle swarm optimization for numerical function optimization
    Chen, Ke
    Zhou, Fengyu
    Liu, Aling
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 139 : 23 - 40
  • [8] A novel camera calibration technique based on differential evolution particle swarm optimization algorithm
    Deng, Li
    Lu, Gen
    Shao, Yuying
    Fei, Minrui
    Hu, Huosheng
    [J]. NEUROCOMPUTING, 2016, 174 : 456 - 465
  • [9] On benchmarking functions for genetic algorithms
    Digalakis, JG
    Margaritis, KG
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2001, 77 (04) : 481 - 506
  • [10] A flexible fast 3D profilometry based on modulation measurement
    Dou, Yunfu
    Su, Xianyu
    Chen, Yanfei
    Wang, Ying
    [J]. OPTICS AND LASERS IN ENGINEERING, 2011, 49 (03) : 376 - 383