2015
DOI: 10.1016/j.neucom.2015.01.019
|View full text |Cite
|
Sign up to set email alerts
|

Probability iterative closest point algorithm for m-D point set registration with noise

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
28
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 88 publications
(28 citation statements)
references
References 30 publications
0
28
0
Order By: Relevance
“…These are the points identified as identical in the areas of overlap for two or more scans being mutually registered. The MSA method uses the iterative closest points (ICP) algorithm which minimises the 3D distance between the polydata points by translating and/or rotating the entire point cloud along X, Y, and Z axes until the least possible distance between the polydata points is reached [39,45,46] ( Figure 6). The TLS point clouds (scans) were registered in such a way that the position and orientation of the first scan were locked and the second scan was translated and rotated until the smallest standard deviation was reached with respect to the polydata of first scan.…”
Section: Terrestrial Laser Scanningmentioning
confidence: 99%
See 1 more Smart Citation
“…These are the points identified as identical in the areas of overlap for two or more scans being mutually registered. The MSA method uses the iterative closest points (ICP) algorithm which minimises the 3D distance between the polydata points by translating and/or rotating the entire point cloud along X, Y, and Z axes until the least possible distance between the polydata points is reached [39,45,46] ( Figure 6). The TLS point clouds (scans) were registered in such a way that the position and orientation of the first scan were locked and the second scan was translated and rotated until the smallest standard deviation was reached with respect to the polydata of first scan.…”
Section: Terrestrial Laser Scanningmentioning
confidence: 99%
“…The MSA method identified only several tens of identical points (i.e., polydata) between the TLS and UAV-SfM point clouds in areas of markedly differing point densities. The automatic registration process was performed in several steps, with each step further reducing the values of the search window parameters and the point cloud rotation angle [39,45,46]. By decreasing the values of these parameters, the registration error was reduced from decimeters to several centimeters.…”
Section: Tls and Uav-sfm Data Fusionmentioning
confidence: 99%
“…In recent years, this notion has been widely applied in signal processing [9,10,24,25,27,22], computer vision [5,6,7], and image processing [12,13,14]. In [9,10], Fiori and Tanaka applied the Karcher mean to compute the principal components and independent components of data sets by the steepest descent method on special orthogonal group SO(n), which was also done independently by Manton [24].…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, a great number of scholars devote great efforts to enhancing the performance of ICP on the robustness and speed. For instance, to improve the robustness, the improvement of robustness was realized [8] by introducing a new hybrid genetic algorithm technique and evaluation metric based on surface interpenetration, and a probability ICP algorithm was proposed for rigid registration of point sets with noise [9]. Meanwhile, Kim et al [10] improved the speed with two acceleration techniques which were hierarchical model point selection and logarithmic data point search.…”
Section: Introductionmentioning
confidence: 99%