Optimized GICP registration algorithm based on principal component analysis for point cloud edge extraction
For iterative closest point (ICP) algorithm, the initial position and the number of iterations are needed in registration. At the same time, the ICP algorithm is easy to fall into local convergence and convergence speed is slow. By constructing K-D tree to search neighborhood points and artificially...
Main Authors: | Weidong Zhao, Dandan Zhang, Dan Li, Yao Zhang, Qiang Ling |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2024-01-01
|
Series: | Measurement + Control |
Online Access: | https://doi.org/10.1177/00202940231193022 |
Similar Items
-
Super Edge 4-Points Congruent Sets-Based Point Cloud Global Registration
by: Shikun Li, et al.
Published: (2021-08-01) -
Fast Registration of Point Cloud Based on Custom Semantic Extraction
by: Jianing Wu, et al.
Published: (2022-10-01) -
Overlap-Aware Hierarchical Decoder for point cloud registration
by: Qiang Zhang, et al.
Published: (2024-02-01) -
Color Point Cloud Registration Algorithm Based on Hue
by: Siyu Ren, et al.
Published: (2021-06-01) -
Iterative K-Closest Point Algorithms for Colored Point Cloud Registration
by: Ouk Choi, et al.
Published: (2020-09-01)