2017
DOI: 10.3390/s17081862
|View full text |Cite
|
Sign up to set email alerts
|

An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features

Abstract: The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this requirement. In this paper, we proposed the ICP algorithm based on point cloud features (GF-ICP). This method uses the g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
88
0
1

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 175 publications
(89 citation statements)
references
References 23 publications
0
88
0
1
Order By: Relevance
“…This explicitly introduces the general assumption of a point-cloud registration problem; that the size of an overlapping area is very large and only a minor correction in translation and rotation is sought [4]. Generally, the solution in a high overlapping point-cloud consists of keypoints detection [7][8][9], descriptors calculation [10][11][12] around each of the keypoints and running an Iterative Closest Point (ICP) algorithm [13,14] to find a transformation that pair-wise matches the individual descriptors. When the overlapping area is small, as in our case, it is difficult to reliably find the matching keypoints in the two-point-clouds, which is an essential step in almost all of the existing point-cloud registration approaches.…”
Section: Related Workmentioning
confidence: 99%
“…This explicitly introduces the general assumption of a point-cloud registration problem; that the size of an overlapping area is very large and only a minor correction in translation and rotation is sought [4]. Generally, the solution in a high overlapping point-cloud consists of keypoints detection [7][8][9], descriptors calculation [10][11][12] around each of the keypoints and running an Iterative Closest Point (ICP) algorithm [13,14] to find a transformation that pair-wise matches the individual descriptors. When the overlapping area is small, as in our case, it is difficult to reliably find the matching keypoints in the two-point-clouds, which is an essential step in almost all of the existing point-cloud registration approaches.…”
Section: Related Workmentioning
confidence: 99%
“…Table 1 shows the comparison between ICP and cross-correlation algorithm applied on the 117 pixel × 179 pixel image. ICP is a type of point cloud data registration method that can achieve the accurate registration of large amounts of data [36]. The three-dimensional (3D) ICP is applied to 2D DPIV image registration simply by projecting the 2D gray image into 3D space, as shown in Figure 4.…”
Section: Icp Algorithmmentioning
confidence: 99%
“…Object detection, which is identification of the position and category of objects in a scene, is a relatively simpler task compared to identifying the rotation or orientation of objects. For detecting rotation, there exists methods that are based on deep neural network (Kanezaki, ), iterative closest point (ICP) (He, Liang, Yang, Li & He, ), or complete 3D models of the object (Hinterstoisser et al, ). Such method provides complete rotation detection of objects but have certain drawbacks.…”
Section: Target Detection and Tool Acquisitionmentioning
confidence: 99%