2020
DOI: 10.1016/j.cviu.2019.102854
|View full text |Cite
|
Sign up to set email alerts
|

An efficient EM-ICP algorithm for non-linear registration of large 3D point sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 52 publications
0
4
0
Order By: Relevance
“…The goal of point cloud coarse registration is to reduce the rotation and translation dislocation between the reference point cloud and point cloud to be registered, and provide a good initial value for fine registration [17,31]. The goal of fine registration is to obtain the optimal registration parameters and minimize the errors [38].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The goal of point cloud coarse registration is to reduce the rotation and translation dislocation between the reference point cloud and point cloud to be registered, and provide a good initial value for fine registration [17,31]. The goal of fine registration is to obtain the optimal registration parameters and minimize the errors [38].…”
Section: Methodsmentioning
confidence: 99%
“…The ICP algorithm needs to fulfill two basic conditions: (1) There is a common area between the reference point cloud and point cloud to be registered; and (2) The initial relative deviation between the reference point cloud and point cloud to be registered is not large [25,26]. Some scholars have improved the ICP algorithm and representative studies include Wei et al [27], who proposed an ICP algorithm based on point cloud homography and explained the method of establishing homography point pairs; Li and Song [28], who proposed a vector information registration method based on facet triangles in the stereolithography (STL) format file and introduced a dynamic adjustment factor to speed up the iterative convergence; Cheng et al [29] proposed an improved ICP algorithm, which used a point-to-point correspondence instead of point-to-surface correspondence to reduce the calculation cost; Wu et al [30] proposed a novel robust scale ICP algorithm by introducing the maximum correntropy criterion (MCC) as the similarity measure when the point sets had a large number of outliers and noises; Combès and Prima [31] presented an efficient expectation-maximisation (EM)-ICP algorithm for non-linear pairwise registration of large 3D point sets, compared to other methods using the same "EM-ICP" framework, four key modifications leading to an efficient algorithm: (1) truncation of the cost function; (2) symmetrization of the point-to-point correspondences; (3) specification of priors on these correspondences using differential geometry; and (4) efficient encoding of deformations using the reproducing kernel Hilbert space (RKHS) theory and the Fourier analysis.…”
Section: Introductionmentioning
confidence: 99%
“…The variances can be embedded in a coarse-to-fine scheme [19], or they can be estimated in the M-step [31,23]. Several variants have been proposed to handle outliers [21], topological constraints [31], symmetrisation of the registration [9], or non rigid deformations [8]. This approach has been recently extended to the registration of multiple point clouds in [42], where a point is modeled as a mixture of Gaussians centered in the nearest neighbor points in each other point clouds.…”
Section: Related Workmentioning
confidence: 99%
“…Tracking a set of points can be formulated as a registration problem where the goal is to align between two point sets representing a 3D shape at two different times. The Iterative Closest Point algorithm (ICP), originally proposed by Besl and McKay [2] for estimating a global linear transformation to align two point sets, has been extended for non-linear registration of large 3D point sets based on a statistical expectation-maximisation (EM) algorithm [6]. However, robustifying this algorithm face to local minima problems occuring during the optimization of cost function remains a challenging task.…”
Section: Point Cloud Trackingmentioning
confidence: 99%