Aiming at building up correspondences and calculating the optimal transformation between two or more point clouds, point cloud registration is of great importance in 3D model reconstruction New15 , robot mapping Shiratori15 ; Yu15 , object recognition Abate07 ; Held16 and etc. As the most basic and essential perspective of multi-view registration, pair-wise registration has been devoted to by a large number of researchers. Among the great deal of methods, the most original and popular one is the iterative closest point (ICP) algorithm proposed by P. J. Besl and N. D. McKay Besl92 , which iteratively builds up correspondences and calculates the rigid transformation by minimizing the Euclidean distance based residual error. However, this approach is time-consuming and only apply to two completely overlapping clouds.
In the past decade, a great deal of researchers have made efforts to improve the performance of the traditional ICP algorithm. To improve the low efficiency of ICP algorithm, Fitzgibbon Fitzgibbon03 employed the Levenberg—Marquardt algorithm to speed it up; Jost Jost03 proposed a coarse-to-fine multi-resolution technique with the neighbor search algorithm to improve its efficiency. For the partially overlapping problem neglected in original ICP, a straightforward solution is to exclude point correspondences with distances greater than the user-specified threshold Rusinkiewicz01 . After that, Godin Godin94 proposed weighting of point correspondences to assign lower weights to correspondences with greater point-to-point distances. But this approach is ineffective. Further, Chetverikov et al.Chet05
proposed the trimmed ICP (TrICP) algorithm, in which an overlapping parameter was introduced into the residual error. This approach can trim the outliers automatically and obtain accurate registration results for partially overlapping clouds, but it is time-consuming. To solve this problem, Phillips et al.Phillips07 proposed the fractional TrICP (FTrICP) algorithm to simultaneously compute the overlapping parameter and transformation in a much faster speed.
Although the aforementioned methods get substantial improvement in both robustness and efficiency, they still suffer either poor accuracy or local minimum problem. On one hand, to obtain more precise transformation, some probabilistic methods Granger02 ; Jian11 ; Myronenko10 ; Tsin04 were proposed for partial registration of point clouds. But the huge computational resources they require pose a great challenge to most application areas. On the other hand, to avoid the local minimum problem existing in many algorithms, Lee et al. Lee02
introduced invariant features into ICP to decrease the chance being trapped into local minimum. Besides, the genetic algorithmLomonosov06 ; Zhu14 and particle filter Sandhu13 were also utilized to determine the optimal transformation.
In order to achieve more robust and accurate registration, some original methods based on the traditional ICP were proposed. For example, Zhu Zhu12 proposed the concept of bidirectional distances to solve the non-rigid registration of absolutely overlapping point clouds. Afterwards, backward distance measurement was introduced into affine ICP method by Ma et al.Ma13 . Although the bilateral correspondence based algorithms are more accurate than most other methods, their efficiency is unsatisfactory. Recently, correntropy Hasanbelliu14 ; Xu16 was introduced into ICP algorithm and can be solved by maximizing the correntropy between two point clouds. Although it can deal with rigid registration with noises and outliers, its robustness should be further improved for registration of cloud pair with low overlap percentage.
However, all the above methods can only be solved under an initial transformation that is close to the ground truth. Therefore, a group of researchers contribute to feature extraction to provide initial transformation for pair-wise registration. These algorithms are mainly classified into two categories, i.e., global feature based and local feature based algorithms. The objective of global feature based algorithms is to construct a set of features to encode the geometric properties of the entire 3D object, such as geometric 3D momentsPaquet00 , shape distribution Osada02 and spherical harmonics Funkhouser03 . On the other hand, the objective of local feature based algorithms is to define a set of features to encode the characteristics of the local neighborhood of the feature points. For example, a set of point feature histograms was introduced to provide good starting points for ICP algorithm in Rusu08 and Rusu09 . Besides, Guo Guo13 designed a 3D object recognition algorithm based on his proposed local reference frame and rotational projection statistics. However, these algorithms usually suffer from either low descriptiveness or weak robustness.
Considering the aforementioned problems, we therefore propose an extended version of Zhu16 to achieve more robust and efficient registration. Compared with the original version, this approach introduces a variable of hard assignment into the objective function, in which each point in the data shape is assigned a binary value to indicate its probability as an inlier. Based on this step, the variable of soft assignment is further explored to illustrate the reliability of the established point correspondence. To compare the proposed approach with that without hard assignment, some experiments were performed on some real datasets and the experimental results demonstrate the advantages over the former method in efficiency, accuracy and robustness.
The rest of this paper is organized as the following: Section 2 briefly reviews the ICP algorithm. The motivation behind our proposed approach is explained in section 3. Then in section 4, the proposed approach is illustrated in detail. After that is section 5, in which the superiority of the proposed method is further validated and some convincing experiments are demonstrated to compare the proposed algorithm with other related ones. At last, some conclusions are drawn in section 6.
2 The ICP algorithm
Given two point clouds, dnoted as the data shape and the model shape , the goal of registration is to find the optimal rigid transformation , with which can be in the best alignment with . Accordingly, it can be formulated as the following least square (LS) problem:
where is the rotation matrix,
indicates the translation vector,represents the correspondence of in the model shape, and denotes norm. Eq. (1) can be solved by the ICP algorithm Besl92 , which achieves the rigid registration by iterations. Given an initial transformation , two steps are included in each iteration:
According to transformation, establish correspondence for each point in the data shape:
Based on the established correspondences, calculated the transformation by minimizing the following function:
Finally, the optimal transformation can be obtained by repeating steps (1)-(2) until some stop conditions are satisfied. Although the ICP algorithm has good performances for the rigid registration, it cannot achieve the registration of partially overlapping point clouds.
For point cloud registration, two issues should be carefully considered in practical applications: 1) The point cloud to be registered always contains non-overlapping areas, which should be confirmed and discarded during registration; 2) Even in the overlapping areas, there seldom exits real point correspondences due to the limited sensor resolution or noise.
Given two partially overlapping point clouds, bilateral correspondences of one point in the data shape can be established by applying the search method of nearest neighbor twice. As shown in Fig. 1, for each point in the data shape , its nearest neighbour with the forward distance can be searched from the model shape . Then, for each of these nearest neighbours in , its correspondence with the backward distance can also be searched from . Consequently, two interesting phenomena can be reasonably discovered.
Observation 1: The forward distance of the point in overlapping areas is smaller than that of the point in non-overlapping areas: For one point of the data shape, if it is located in the overlapping areas, its correspondence can be found in the overlapping area of the model shape. Therefore, the point pair of an established correspondence is very close to each other and the forward distance is always small. However, for one point located in the non-overlapping areas, it has no geometrically consistent correspondence. Hence, the point pair of an established correspondence is much far from each other and its forward distance is always larger than that of the point located in the overlapping area. Accordingly, the value of forward distance can be viewed as the index to indicate whether one point is located in the overlapping areas or not.
Observation 2: The difference between forward and backward distances can denote the reliability of the established point correspondence. For the real point correspondence, the backward distance should be equal to its forward distance. In practice, the two points of one correspondence do not have the same position on the object due to the limited senor resolution and noise. For one point in the data shape, the backward distance is usually shorter than the forward one. And there is only a small number of points whose forward distances are equal to their backward distances. As shown in Fig. 1(b) and (c), the less the difference between forward and backward distances is, the more likely this point pair of an established correspondence truly matches. In other words, with the increase of the difference, the reliability of point correspondence decreases. Therefore, the relationship of bidirectional distances can be viewed as an index to indicate whether the established point correspondence is reliable or not. If bidirectional distances of one point are almost equal, then its established correspondence can be viewed as the real correspondence with a higher probability. Otherwise the probability should accordingly decrease.
Actually, the points located in the non-overlapping areas are outliers, which should not be considered in registration. Besides, as the reliability of each point correspondence varies, different emphasis should be placed on individual point correspondence. Accordingly, a novel approach can be motivated to achieve the registration of partially overlapping point clouds.
4 The proposed approach
In this section, an effective approach is proposed for registration of partially overlapping point clouds.
4.1 ICP algorithm based on the hard and soft assignments
Based on the two observations, two variables can be introduced into point cloud registration: the variable for the hard assignment and the variable for the soft assignment. The former variable is a binary parameter utilized to indicate whether one point is an inlier or outlier, while the latter one is set to be a continuous variable between 0 and 1, which can denote the reliability of the established point correspondence. By introducing the former variable, outliers can be rejected during registration. Moreover, the latter variable is introduced to place more emphasis on these established point correspondences with high reliabilities.
Accordingly, a new objective function based on both hard and soft assignments can be proposed for registration of partially overlapping point clouds:
in which is the probability denoting as an inlier and is the reliability of the established correspondence and . The binary probability is easy to determine since there is only two cases for one point, i.e. inlier or outlier. However, the definition of is much more complex considering its property as a real parameter. To take full advantage of observation 2, we turn to an exponential function based probability model to design accurate reliability of an established correspondence.
Based on transformation, establish bilateral correspondences for each point in :
Calculate the variables of hard assignment and soft assignment, respectively:
in which is a subset of the data shape representing the overlapping areas in , is the ratio of bidirectional distances and is a preset parameter.
Update the rigid transformation by minimizing the objective function:
Under the given initial transformation, the optimal solution can be obtained by iteratively performing the above three steps until convergence criteria are satisfied.
4.2 Establishing the bilateral correspondences
In this paper, the tree based nearest neighbor searching method is adopted to find correspondences. For the transformed point in Eq. (5), its nearest neighbor can be searched from the model shape in each iteration. Therefore, the tree for can be built before starting iteration and it only requires to be built once. However, the tree for the transformed data shape requires be continuously rebuilt in each iteration since the nearest neighbor for is searched from the transformed data shape each time, resulting in low efficiency of the whole approach. To improve efficiency, a modified version of Eq. (6) is illustrated as:
Obviously, Eq. (6) and (10) can achieve the same result. In this way, the search process can be accomplished through the following two steps: firstly, the tree based search method is adopted to find the nearest neighbor for each point in ; subsequently, for all the transformed nearest neighbors , their corresponding nearest neighbors are searched from the data shape. Therefore, the tree for can be built only once before starting iteration.
In practical implementation, there is no need establishing bilateral correspondences for every point in . Since the hard assignment has excluded most outliers from registration, we can only search bilateral correspondences for each inlier in the data shape, as shown in Fig. 1(b) and (c). Therefore, computational efficiency can be improved significantly.
4.3 Calculating the variables of hard and soft assignments
The aim of introducing hard assignment into registration is to assign a binary value for each point in to indicate its probability as an inlier. Considering that several parameters need determining in Eq. (4), we thus turn to a simpler but similarly accurate method—the TrICP algorithm—for solution, in which the objective function is formulated as:
where is a preset parameter, denotes the cardinality of a set and is the overlapping percentage. Accordingly, those points that minimize the above function are viewed as inliers while others are outliers.
At each iteration, a pair of sorted points is added to compute the corresponding value of . By traversing all sorted point correspondences, it is easy to obtain the minimum value that corresponds to the optimal overlapping areas . Subsequently, points belonging to are assigned the probability .
Considering the property of the difference between forward and backward distances for a point in the data shape, we therefore adopt Eq. (8) as the variable of soft assignment. We originally design the as the ratio of bidirectional distances, which is formulated as:
in which is the backward correspondence of , and .
Usually, the ratio of bidirectional distances is expected to meet the condition . Sometimes, the point correspondence established by Eq. (5) or Eq. (6) may be coincident due to the round-off effect. In that case, will be illegal. Therefore, Eq. (13) should be modified as follows:
where is a small positive parameter.
In practical applications, the effects of hard and soft assignments rely on parameters such as and . For accurate registration, we want to select as many as inliers, so some outliers may be included into registration. To eliminate the disturbance, the parameter can be adjusted to a smaller value to give hard penalty to these selected outliers.
4.4 Computation of the rigid transformation
To compute the rigid transformation , the following derivation presents the closed-form solution for this question.
Substitute for the product of two variables of hard and soft assignments:
Extend the quadratic-formed objective function depicted in Eq. (4) as following:
Take the derivative of with respective to , the following result can be acquired:
Let , the translate vector can be obtained as:
where and . Subsequently, the rotation matrix can be calculated by minimizing the function , which can be expanded as:
1) Compute the matrix
and its singular value decomposition (SVD) results:
2) Calculate the rotation matrix:
4.5 Algorithm implementation
According to the above analysis and derivation, the implementation of the proposed approach can be summarized in Algorithm 1.
Given the initial parameters , the proposed approach can achieve registration of partially overlapping point clouds with good performances.
5 Experimental results
In this section, we firstly validated the necessity of the hard and soft assignments combined method for registration. Through a series of experimental results, the superiority of introducing hard assignment into registration is self-evident. Then in the second part, the proposed approach was compared with several methods both for data simulation and for experiment comparison. Finally, the proposed method was applied to some large-scale environmental point clouds. All of the following experiments adopt the tree based nearest neighbor searching method on one same computer.
A significant advantage of introducing soft assignment into registration is the high accuracy it brings about. However, besides the low efficiency due to bilateral correspondences for all points in the data shape, it can not avoid convergence of local minimum neither. By introducing hard assignment to exclude outliers, this phenomenon can be alleviated remarkably. Fig. 2 displays the registration results without and with the hard assignment strategy. For a pair of point clouds from the Stanford Bunny StanfordRep , the algorithm using soft assignment converges to local minimum and results in failing registration, while our proposed method can obtain precise results, as shown in Fig. 2 (a) and (b), respectively.
To further demonstrate the necessity of introducing hard assignment, the following experiments were designed to compare the performances without and with the hard assignment. In this experiment, five pairs of point clouds scanned from different viewpoints of one same object were randomly chosen. For each scan pair, the ground truth of transformation was imposed by different perturbed transformations
, which were randomly drawn from the uniformation distribution, ; , ; and , respectively, in which is the average point resolution of model shape. We respectively denote these turbulence as Turb. 1, Turb. 2 and Turb. 3. Taking the rigid transformation
as initial transformation, the estimated transformationcan be obtained accordingly. For comparing accuracy of both approaches, relative errors are defined as: and . Table 1 records the overlapping percentage of each scan pair and the runtime for the methods before and after introducing hard assignment under different turbulences. To demonstrate the results figuratively, Fig. 3 displays the registration results.
|No. of scan pair||Overlap||Turb. 1||Turb. 2||Turb. 3|
As demonstrated in Fig. 3, in each trial, the relative errors generated from the proposed method are smaller than that without using hard assignment. Although the errors of both methods will increase with the raise of turbulence, the proposed method merely gains a moderate increase while the method solely using soft assignment has an apparent augmentation. As for the soft assignment approach, the registration results for higher overlapping cloud pairs were not always better than that for lower overlapping cloud pairs under the same turbulence. This is because the approach without using hard assignment is easy to be trapped into local minimum and thus always results in failing registration. Best illustrated in low overlapping situations, the proposed algorithm could effectively avoid the local minimum problem. Besides, Table 1 demonstrates a distinct comparison about efficiency. As it shows, the efficiency of the proposed method showed an obvious superiority over merely soft assignment method, especially when the overlap percentage was low. With the increase of turbulences, efficiency of both methods will decrease, but the proposed method still outperformed the method without using hard assignment. This high efficiency owes to the hard assignment strategy, which excludes most outliers from establishing bilateral correspondences and computing the ratio of bilateral distances. Obviously, the proposed method using both hard and soft assignments is superior to that merely using soft assignment in efficiency, accuracy and robustness.
To testify its superior performances, the proposed approach was compared with the fractional TrICP algorithm (FTrICP), ICP algorithm with weighting of pairs (wICP) Rusinkiewicz01 and the correntropy ICP algorithm (CtICP) on several real datasets. For providing solid proof about their performances, the experiments were conducted both for data simulation and for experiment comparison.
5.2.1 Data simulation
To perform the simulation comparison, a point cloud with 3D points was selected from the Stanford Bunny. For generating the data shape, the following processes were implemented: The original shape was randomly deleted points and then cut down by one part, which included range points; then the remaining shape was added with Gaussian zero mean noise. For generating the model shape, the following two steps were implemented: Deleting points in the original shape and applying a randomly generated transformation to the remaining shape; then cutting down the transformed shape by other range points. Accordingly, the overlap percentage of the two generated shapes is calculated as:
in which denotes the number of points of the original shape. To simulate the registration results under different overlap percentages, the value can be accordingly changed. Thus we can obtain a set of registration results for all competed approaches.
For comparison, relative errors are defined as and , where represents the estimated transformation, and denotes Frobenius norm. Denote as the average point resolution of model shape, the registration process can be viewed as successful if and only if ( and ). All approaches were tested on each cloud pairs with varied overlap percentages for Monte Carlo (MC) trials. To view it more intuitively, Fig. 4 displays registration performances for all competed approaches.
As shown in Fig. 4(a), both wICP and CtICP are satisfactory for pretty highly overlapping clouds. This is because the correspondence distance threshold specified by user is mainly determined empirically and many outliers may be included into registration. The FTrICP algorithm can achieve more superior performance compared with the former two methods. But its robustness decreases quickly with the decrease of overlap percentage. This is a common phenomenon since many methods neglect the reliability of established correspondences. On the contrary, the proposed approach can still obtain precise registration results even though the overlap percentage is pretty small. Moreover, its robustness decreases quite slowly with the increase of outliers. Benefited from the hard assignment, this method can gain a slight raise on registration precision when the overlap percentage is small enough. Therefore, the proposed approach achieves the most robust registration among all the competed approaches. In terms of efficiency, Fig. 4(b) gives the best illustration. When the overlap percentage is pretty high, the proposed approach has the lowest efficiency since it needs to compute bilateral distances for most points. Once the overlap percentage is lower than , its superiority over other approaches becomes distinct and even has the highest efficiency among all the competed approaches. This benefits from the hard assignment strategy, which has excluded most outliers from registration.
5.2.2 Experiment comparison
In this section, the proposed approach was compared with the aforementioned methods on several real datasets: Happy Buddha, Dragon, Bunny, Armadillo and Angel. Detailed information of each cloud pair was depicted in Table 2. In addition to point clouds information, the ground truth of rigid transformation for each pair of cloud is also known.
Before registration, a perturbed rigid transformation was imposed to the ground truth, in which the Euler angle and translate component were randomly drawn from the uniform distribution and respectively. Here, the symbol denotes the average point resolution of the model shape. Taking the rigid transformation as initial parameter for all competed approaches, the estimated transformation can be obtained accordingly. For comparing accuracy of each approach, relative errors are defined as: and . All competed approaches were tested on each dataset with MC trials to eliminate random interference. To evaluate the performance of each approach, Table 2 demonstrates the relative error of rotation matrix, translation component and average runtime, respectively. To view this in a more intuitive way, Fig. 5 displays the registration results for all competed approaches.
As shown in Table 2 and Fig. 5, all approaches can achieve precise registration on Angel, which has high overlap percentage. Since it neglects outliers and relies highly on initial transformation, the CtICP algorithm obtained unsatisfactory results on the other four datasets. While FTrICP and wICP achieved more precise and efficient registration than CtICP on most datasets, they still fall behind our proposed approach by a large margin. As for the wICP algorithm, it neglects the nonoverlapping areas problem and searches a correspondence for each point in the data shape, which includes many outliers into registration. Although the FTrICP algorithm takes outliers into consideration, it deems that all the established correspondences are correct, thus may fail when registration are interfered by many outliers. The relative errors of and increase dramatically for the FTrICP, wICP and CtICP with the decrease of overlap percentage, but ours has a moderate rise profited from the combination of hard and soft assignments. Besides, the high efficiency of the proposed method resulted from the hard assignment also put it in an advantageous status. Based on these analysis, it is fair to draw that the proposed method is the most robust and efficient one among all these competed approaches.
To confirm its application to environmental scenes, the proposed approach was testified in the following large-scale environmental point clouds, which were recorded in the Institute of Robotics and Mechatronics at the German Aerospace Center (DLR) EnvirSets . For conducting this experiment, the given pose was imposed by a perturbed transformation , and then used as the initial transformation. Note that the given pose was obtained via some methods and are available online. Under such deployment, the registration results using the proposed approach can be demonstrated in Fig. 6.
As illustrated in Fig. 6, the proposed approach is appliable to environmental point clouds and is able to achieve pretty precise registration, even if the point cloud contains tens of millions points. This is easy to interpret because of the hard and soft assignments combined method. On one hand, the hard assignment exclude most outliers from registration. Therefore, the reconstruction of the environmental scene is mainly based on inliers, which are essential for registration. On the other hand, the soft assignment strategy assigns a value for each pair of correspondence to denote its reliability of the established correspondence. This method takes the probability into consideration and overcomes the disadvantage of merely optimizing the least square function, thus can achieve more precise registration.
This paper proposes a novel approach for registration of partially overlapping point clouds. The novelty of this approach is the introduction of both the hard and soft assignments, which can be represented as a binary variable and continuous variable, respectively. By consideration of the forward distance, each point in the data shape can be assigned a binary value, which can denote whether it is an inlier or outlier. Meanwhile, based on the ratio of bidirectional distances, each established point correspondence can be assigned a continuous probability, which can be viewed as an index to indicate the reliability of point correspondence. By integrating both the hard and soft assignments, a new objective function can be designed for registration of partially overlapping point clouds and a variant of the ICP algorithm is proposed to calculate the optimal rigid transformation. The proposed approach has been tested on public datasets and experimental results illustrate the proposed approach can achieve the registration of partially overlapping clouds with good robustness and accuracy.
This work is supported by the National Natural Science Foundation of China under Grant Nos. 61573273, 61573280 and 61503300.
- (1) doi:10.1109/CVPR.2015.7298631.
- (2) T. Shiratori, J. Berclaz, M. Harville, C. Shah, T. Li, Y. Matsushita, S. Shiller, Efficient large-scale point cloud registration using loop closures, 3D Vision (3DV), 2015 International Conference on 232–240. doi:10.1109/3DV.2015.33.
- (3) F. Yu, J. Xiao, T. Funkhouser, Semantic alignment of lidar data at city scale, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2015) 1722–1731. doi:10.1109/CVPR.2015.7298781.
A. F. Abate, M. Nappi, D. Riccio, G. Sabatino, 2d and 3d face recognition: A survey, Pattern Recognition Letters 28 (14) (2007) 1885–1906.doi:10.1016/j.patrec.2006.12.018.
- (5) D. Held, S. Thrun, S. Savarese, Robust single-view instance recognition, Robotics and Automation (ICRA), 2016 IEEE International Conference on (2016) 2152–2159. doi:10.1016/S0031-8914(53)80099-6.
- (6) P. Besl, N. D. McKay, A method for registration of 3-d shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence 14 (2) (1992) 239–256. doi:10.1109/34.121791.
- (7) A. W. Fitzgibbon, Robust registration of 2d and 3d point sets, Image and Vision Computing 21 (13–14) (2003) 1145–1153. doi:10.1016/j.imavis.2003.09.004.
T. Jost, H. Hugli, A multi-resolution icp with heuristic closest point search for fast and robust 3d registration of range images, 3-D Digital Imaging and Modeling, Fourth International Conference on (2003) 1145–1153doi:10.1109/IM.2003.1240278.
- (9) M. Levoy, S. Rusinkiewicz, Efficient variants of the icp algorithm, 3D Digital Imaging and Modeling, International Conference on (2001) 145 doi:10.1109/IM.2001.924423.
- (10) G. Godin, M. Rioux, R. Baribeau, Three-dimensional registration using range and intensity information, Proceedings of SPIE - The International Society 2350 (1994) 279–290.
- (11) D. Chetverikova, D. Stepanova, P. Krsekb, Robust euclidean alignment of 3d point sets: the trimmed iterative closest point algorithm, Image and Vision Computing 23 (3) (2005) 299–309. doi:10.1016/j.imavis.2004.05.007.
- (12) J. M. Phillips, R. Liu, C. Tomasi, Outlier robust icp for minimizing fractional rmsd, 3D Digital Imaging and Modeling, International Conference on (2007) 427–434. doi:10.1109/3DIM.2007.39.
- (13) S. Granger, X. Pennec, Multi-scale em-icp: A fast and robust approach for surface registration, Computer Vision–ECCV 2002 (2002) 418–432. doi:10.1007/3-540-47979-1_28.
B. Jian, B. C. Vemuri, Robust point set registration using gaussian mixture models, IEEE Transactions on Pattern Analysis and Machine Intelligence 33 (8) (2011) 1633–1645.doi:10.1109/TPAMI.2010.223.
- (15) A. Myronenko, X. Song, Point set registration: Coherent point drift, IEEE Transactions on Pattern Analysis and Machine Intelligence 32 (12) (2010) 2262–2275. doi:10.1109/TPAMI.2010.46.
- (16) Y. Tsin, T. Kanade, A correlation-based approach to robust point set registration, Computer Vision–ECCV 2004 (2004) 558–569. doi:10.1007/978-3-540-24672-5_44.
- (17) S. W. Lee, D. K. Wehe, G. C. Sharp, Icp registration using invariant features, IEEE Transactions on Pattern Analysis and Machine Intelligence 24 (1) (2002) 90–102. doi:10.1109/34.982886.
- (18) E. Lomonosov, D. Chetverikov, A. Ekárt, Pre-registration of arbitrarily oriented 3d surfaces using a genetic algorithm, Pattern Recognition Letters 27 (11) (2006) 1201–1208. doi:10.1016/j.patrec.2005.07.018.
- (19) J. Zhu, D. Meng, Z. Li, S. Du, Z. Yuan, Robust registration of partially overlapping point sets via genetic algorithm with growth operator, IET Image Processing 8 (10) (2014) 582–590. doi:10.1049/iet-ipr.2013.0545.
- (20) R. Sandhu, S. Dambreville, A. Tannenbaum, Point set registration via particle filtering and stochastic dynamics, IEEE Transactions on Pattern Analysis and Machine Intelligence 32 (8) (2013) 1459–1473. doi:10.1109/TPAMI.2009.142.
- (21) J. Zhu, S. Du, Z. Yuan, Y. Liu, L. Ma, Robust affine iterative closest point algorithm with bidirectional distance, IET Computer Vision 6 (3) (2012) 252–261. doi:10.1049/iet-cvi.2011.0178.
- (22) L. Ma, J. Zhu, Efficient scaling registration algorithm for partially overlapping point sets, Electronics Letters 49 (20) (2013) 1267–1268. doi:10.1049/el.2013.1825.
- (23) E. Hasanbelliu, L. S. Giraldo, J. Príncipe, Information theoretic shape matching, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (12) (2014) 2436–2451. doi:10.1049/iet-cvi.2011.0178.
G. Xu, S. Du, J. Xue, Precise 2d point set registration using iterative closest algorithm and correntropy, International Joint Conference on Neural Networks (2016) 4627–4631.doi:10.1109/IJCNN.2016.7727806.
- (25) E. Paquet, M. Rioux, A. Murching, T. Naveen, A. Tabatabai, Description of shape information for 2-d and 3-d objects, Signal Processing: Image Communication 16 (1–2) (2000) 103–122. doi:10.1016/S0923-5965(00)00020-5.
- (26) R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin, Shape distributions, ACM Transactions on Graphics (TOG) 21 (4) (2002) 807–832. doi:10.1145/571647.571648.
- (27) T. Funkhouser, P. Min, M. Kazhdan, J. Chen, A. Halderman, D. Dobkin, D. Jacobs, A search engine for 3d models, ACM Transactions on Graphics (TOG) 22 (1) (2003) 83–105. doi:10.1145/588272.588279.
- (28) R. B. Rusu, N. Blodow, Z. C. Marton, M. Beetz, Aligning point cloud views using persistent feature histograms, IEEE/RSJ International Conference on Intelligent Robots and Systems (2008) . doi:10.1109/IROS.2008.4650967.
- (29) R. B. Rusu, N. Blodow, M. Beetz, Fast point feature histograms (fpfh) for 3d registration, IEEE International Conference on Robotics and Automation (2009) . doi:10.1109/ROBOT.2009.5152473.
- (30) Y. Guo, F. Sohel, M. Bennamoun, M. Lu, J. Wan, Rotational projection statistics for 3d local surface description and object recognition, International Journal of Computer Vision 105 (1) (2013) 63–86. doi:10.1007/s11263-013-0627-y.
- (31) J. Zhu, D. Wang, X. Bai, H. Lu, C. Jin, Z. Li, Robust registration of point clouds based on the ratio of bidirectional distances, International Conference on 3D Vision (2016) 102–107.
- (32) A. Myronenko, X. Song, On the closed-form solution of the rotation matrix arising in computer vision problems, ArXiv E-prints.
- (33) The stanford 3d scanning repository, http://graphics.stanford.edu/data/3Dscanrep/.
- (34) Robotic 3d scan repository, http://kos.informatik.uni-osnabrueck.de/3Dscans/.