Home >Data & Analytics >Dmitrii Tihonkih - The Iterative Closest Points Algorithm and Affine Transformations

# Dmitrii Tihonkih - The Iterative Closest Points Algorithm and Affine Transformations

Date post:22-Jan-2018
Category:
View:166 times
Transcript:
• Dmitrii Tihonkih

Department of Mathematics, Chelyabinsk State University, Russian Federation

Artyom Makovetskii

Department of Mathematics, Chelyabinsk State University, Russian Federation

Department of Mathematics, Chelyabinsk State University, Russian Federation

The iterative closest points algorithm and affine

transformations

AIST'2016

• IntroductionThe standard ICP starts with two point clouds fortheir relative rigid-body transform, anditeratively refines the transform by repeatedlygenerating pairs of corresponding points in theclouds and minimizing an error metric.

• The ICP stages:

1. Selection of some set of points in oneclouds.

2. Matching these points to samples inthe other cloud.

3. Rejecting certain pairs based onlooking at each pair individually orconsidering the entire set of pairs.

4. Assigning an error metric based onthe point pairs.

5. Minimizing the error metric(variational subproblem of the ICP).

• Our main focus is on the accuracy of the finalanswer and the ability of ICP to reach thecorrect solution for a given difficult geometry.We consider transformation that hold theangles between lines in the cloud of points.Also we consider the ICP minimizing the errormetric subproblem for the case of an arbitraryaffine transformation.

• The matching procedure for sets and

Let = {0, , 1} be an set consist of points in 3 and = {0, , 1} be an set consist of points in 3. Denote by ( , ),

, the pair of corresponding

points. Note, that each point from and can be included to the set of pairs just one time.

• At the beginning the set of pairs is empty. Let be a number such that:

3 min(, ).

1. Consider the following subset of the : = { 1 , , 1 +1}.

2. Let be a closed piecewise linear curve in 3

that consist of line segments. The -th segment connects points 1 + and 1 ++1.

• Denote by a minimal flat angle that is

constructed by -th and ( + 1)-th segments.Let be a vector

= {0, , 1},

where elements j, j = 0, ,m 1 are

respective angles.

• 3. Consider all possible combinations of mpoints in the set Y besides the points that already included to the set of pairs. For an each combination we construct the vector by the same way as in step 2.

4. We choose a vector from the set of vectors of the step 3 such that distance between them and is minimal relatively the norm 1. Denote this vector as .

• 5. We construct pairs of the points by and . Add this m pairs to the set of pairs.

6. If the number of remaining points in or less that then procedure terminates. Else + 1and go to step 1.

• We use this procedure only as first iteration on the ICP algorithm. Obtained after the first iteration the transformation matrix and the translation vector are used for a second iteration. In the next iterations we use the standard nearest neighbor approach.

The described above approach can good work not for rigid transformation only but for sufficiently wide subset of the affine transformations.

• The ICP variational subproblem for

an arbitrary affine transformation

Suppose that the relationship between points in and is done by such a way that for each point is calculated corresponding point .

The ICP algorithm is offten considered as a geometrical transformation for rigid objects mapping to :

• + ,

where is a rotation matrix, is a translation vector, = 0, , 1.

The S-ICP algorithm is given by

+ ,

where is a scaling matrix.

• ICP variational problem for the case of an arbitrary affine transformation.Let (, ) be the following function:

, = =01 +

2.

The ICP variational problem can be stated as follows:

arg , ,

,

• where

=

11 12 1321 22 2331 32 33

, =

123

,

=

123

, =

123

.

• The elements of the first row of the matrix that minimizes are computed as

11 = =0

1 1 122 133 1

=01 1

2 ,

12 = =0

1 13 =01

=01

2 ,

13 = =0

1

=01

2 .

• Computer simulation

Let be the set consists of 80 points. The coordinates of points are randomly generated (by the uniform distribution). The values of all coordinates belong to the range [0, . . . , 100]. The set is obtained from the set by the geometrical transformation = + , where and are described below:

=1 0 00 0.5 0.8660250 0.866025 0.5

,

• T = 5 6 7 .

The standard approach based on nearest neighbor method gives the following results(open source, C++):

=0.45 0.64 0.610.89 0.36 0.270.05 0.67 0.73

,

T = 7.56 11.22 11.42 .

• Estimated matrix and vector (our algorithm):

=0.99 9.78e06 9.41e05

0.000100597 0.499911 0.8660982.66211e05 0.865921 0.499979

,

T = 5.0028 6.0127 7.00388 .

• Conclusion

In this work we considered matching and error minimizing steps of the ICP algorithm. On the base of the obtained results, a new efficient

algorithm for the sets alignment was designed. The obtained results are illustrated with the

help of computer simulation. Embed Size (px)
Recommended

Documents

Documents

Documents

Documents

Documents