Collection of Selected Papers of the IV International Conference on Information Technology and Nanotechnology 2018
DOI: 10.18287/1613-0073-2018-2210-236-242
|View full text |Cite
|
Sign up to set email alerts
|

Point clouds registration based on the point-to-plane approach for orthogonal transformations

Abstract: The most popular algorithm for aligning of 3D point data is the Iterative Closest Point (ICP). This paper proposes a new algorithm for orthogonal registration of point clouds based on the point-to-plane ICP algorithm for affine transformation. At each iterative step of the algorithm, an approximation of the closed-form solution for the orthogonal transformation is derived.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Meanwhile, some researchers focus on improving the precision of registration algorithm. Makovetskii et al [22] proposed a robust point set registration algorithm with pointto-plane approach. Different from the correspondence search method of point-to-point, the loss function of point-to-plane is to minimize the square of the distance from the source vertex to the face where the target vertex is located.…”
Section: Introductionmentioning
confidence: 99%
“…Meanwhile, some researchers focus on improving the precision of registration algorithm. Makovetskii et al [22] proposed a robust point set registration algorithm with pointto-plane approach. Different from the correspondence search method of point-to-point, the loss function of point-to-plane is to minimize the square of the distance from the source vertex to the face where the target vertex is located.…”
Section: Introductionmentioning
confidence: 99%