scholarly journals ITERATIVE CLOSEST POINT ALGORITHM FOR ACCURATE REGISTRATION OF COARSELY REGISTERED POINT CLOUDS WITH CITYGML MODELS

2019 ◽  
Vol IV-2/W5 ◽  
pp. 201-208 ◽  
Author(s):  
S. Goebbels ◽  
R. Pohle-Fröhlich ◽  
P. Pricken
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Iteration Step ◽  
Iterative Closest Point ◽  
Target Point ◽  
Standard Tool ◽  
Iterative Closest Point Algorithm ◽  
Test Scenarios ◽  
Plane Mode ◽  
City Models

<p><strong>Abstract.</strong> The Iterative Closest Point algorithm (ICP) is a standard tool for registration of a source to a target point cloud. In this paper, ICP in point-to-plane mode is adopted to city models that are defined in CityGML. With this new point-to-model version of the algorithm, a coarsely registered photogrammetric point cloud can be matched with buildings’ polygons to provide, e.g., a basis for automated 3D facade modeling. In each iteration step, source points are projected to these polygons to find correspondences. Then an optimization problem is solved to find an affine transformation that maps source points to their correspondences as close as possible. Whereas standard ICP variants do not perform scaling, our algorithm is capable of isotropic scaling. This is necessary because photogrammetric point clouds obtained by the structure from motion algorithm typically are scaled randomly. Two test scenarios indicate that the presented algorithm is faster than ICP in point-to-plane mode on sampled city models.</p>

Application of the 'Iterative Closest Point' Algorithm for Determination of Rotation Axis of a Turntable

2013 ◽  
Vol 199 ◽  
pp. 273-278
Author(s):  
Ireneusz Wróbel
Keyword(s):  
Reverse Engineering ◽  
Point Cloud ◽  
Rotation Axis ◽  
Rapid Development ◽  
Point Clouds ◽  
Iterative Closest Point ◽  
Mechanical Parts ◽  
Scanning Process ◽  
Iterative Closest Point Algorithm

Reverse engineering [ is a field of technology which has been under rapid development for several recent years. Optic scanners are basic devices used as reverse engineering tools. Point cloud describes the shape of a scanned object. Automatic turntable is a device which enables a scanning process from different viewing angles. In the paper, the algorithm is described which has been used for determination of rotation axis of a turntable. The obtained axis constitutes the base for an aggregation of particular point clouds into single resultant common cloud describing the shape of the scanned object. Usability of this algorithm for precise scanning of mechanical parts was validated, precision of shape replication was also evaluated.

scholarly journals REGISTRATION OF UAV DATA AND ALS DATA USING POINT TO DEM DISTANCES FOR BATHYMETRIC CHANGE DETECTION

2018 ◽  
Vol XLII-1 ◽  
pp. 51-58 ◽  
Author(s):  
R. Boerner ◽  
Y. Xu ◽  
L. Hoegner ◽  
U. Stilla
Keyword(s):  
Rural Areas ◽  
Point Cloud ◽  
Laser Scanner ◽  
Iteration Process ◽  
Point Clouds ◽  
Iteration Step ◽  
Target Point ◽  
General Technique ◽  
Airborne Laser Scanner ◽  
Planar Structures

<p><strong>Abstract.</strong> This paper shows a method to register point clouds from images of UAV-mounted airborne cameras as well as airborne laser scanner data. The focus is a general technique which does rely neither on linear or planar structures nor on the point cloud density. Therefore, the proposed approach is also suitable for rural areas and water bodies captured via different sensor configurations. This approach is based on a regular 2.5D grid generated from the segmented ground points of the 3D point cloud. It is assumed that initial values for the registration are already estimated, e.g. by measured exterior orientation parameters with the UAV mounted GNSS and IMU. These initial parameters are finely tuned by minimizing the distances between the 3D points of a target point cloud to the generated grid of the source point cloud in an iteration process. To eliminate outliers (e.g., vegetation points) a threshold for the distances is defined dynamically at each iteration step, which filters ground points during the registration. The achieved accuracy of the registration is up to 0.4<span class="thinspace"></span>m in translation and up to 0.3<span class="thinspace"></span>degrees in rotation, by using a raster size of the DEM of 2<span class="thinspace"></span>m. Considering the ground sampling distance of the airborne data which is up to 0.4<span class="thinspace"></span>m between the scan lines, this result is comparable to the result achieved by an ICP algorithm, but the proposed approach does not rely on point densities and is therefore able to solve registrations where the ICP have difficulties.</p>

scholarly journals OICP: An Online Fast Registration Algorithm Based on Rigid Translation Applied to Wire Arc Additive Manufacturing of Mold Repair

Materials ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 1563
Author(s):  
Ruibing Wu ◽  
Ziping Yu ◽  
Donghong Ding ◽  
Qinghua Lu ◽  
Zengxi Pan ◽  
...  
Keyword(s):  
Additive Manufacturing ◽  
Point Cloud ◽  
Point Clouds ◽  
Iterative Closest Point ◽  
Multiple Point ◽  
Icp Algorithm ◽  
Registration Algorithm ◽  
Cloud Models ◽  
Comparison Results ◽  
Wire Arc Additive Manufacturing

As promising technology with low requirements and high depositing efficiency, Wire Arc Additive Manufacturing (WAAM) can significantly reduce the repair cost and improve the formation quality of molds. To further improve the accuracy of WAAM in repairing molds, the point cloud model that expresses the spatial distribution and surface characteristics of the mold is proposed. Since the mold has a large size, it is necessary to be scanned multiple times, resulting in multiple point cloud models. The point cloud registration, such as the Iterative Closest Point (ICP) algorithm, then plays the role of merging multiple point cloud models to reconstruct a complete data model. However, using the ICP algorithm to merge large point clouds with a low-overlap area is inefficient, time-consuming, and unsatisfactory. Therefore, this paper provides the improved Offset Iterative Closest Point (OICP) algorithm, which is an online fast registration algorithm suitable for intelligent WAAM mold repair technology. The practicality and reliability of the algorithm are illustrated by the comparison results with the standard ICP algorithm and the three-coordinate measuring instrument in the Experimental Setup Section. The results are that the OICP algorithm is feasible for registrations with low overlap rates. For an overlap rate lower than 60% in our experiments, the traditional ICP algorithm failed, while the Root Mean Square (RMS) error reached 0.1 mm, and the rotation error was within 0.5 degrees, indicating the improvement of the proposed OICP algorithm.

An Iterative Closest Point Algorithm Based on Biunique Correspondence of Point Clouds for 3D Reconstruction

2015 ◽  
Vol 35 (5) ◽  
pp. 0515003 ◽  
Author(s):  
韦盛斌 Wei Shengbin ◽  
王少卿 Wang Shaoqing ◽  
周常河 Zhou Changhe ◽  
刘昆 Liu Kun ◽  
范鑫 Fan Xin
Keyword(s):  
3D Reconstruction ◽  
Point Clouds ◽  
Iterative Closest Point ◽  
Iterative Closest Point Algorithm

scholarly journals Registration of Multi-Sensor Bathymetric Point Clouds in Rural Areas Using Point-to-Grid Distances

2019 ◽  
Vol 8 (4) ◽  
pp. 178 ◽  
Author(s):  
Richard Boerner ◽  
Yusheng Xu ◽  
Ramona Baran ◽  
Frank Steinbacher ◽  
Ludwig Hoegner ◽  
...  
Keyword(s):  
Rural Areas ◽  
Point Cloud ◽  
Point Clouds ◽  
Airborne Lidar ◽  
Target Point ◽  
Outlier Removal ◽  
Least Squares Optimization ◽  
Rotation Parameters ◽  
Airborne Sensors ◽  
Fine Registration

This article proposes a method for registration of two different point clouds with different point densities and noise recorded by airborne sensors in rural areas. In particular, multi-sensor point clouds with different point densities are considered. The proposed method is marker-less and uses segmented ground areas for registration.Therefore, the proposed approach offers the possibility to fuse point clouds of different sensors in rural areas within an accuracy of fine registration. In general, such registration is solved with extensive use of control points. The source point cloud is used to calculate a DEM of the ground which is further used to calculate point to raster distances of all points of the target point cloud. Furthermore, each cell of the raster DEM gets a height variance, further addressed as reconstruction accuracy, by calculating the grid. An outlier removal based on a dynamic threshold of distances is used to gain more robustness against noise and small geometry variations. The transformation parameters are calculated with an iterative least-squares optimization of the distances weighted with respect to the reconstruction accuracies of the grid. Evaluations consider two flight campaigns of the Mangfall area inBavaria, Germany, taken with different airborne LiDAR sensors with different point density. The accuracy of the proposed approach is evaluated on the whole flight strip of approximately eight square kilometers as well as on selected scenes in a closer look. For all scenes, it obtained an accuracy of rotation parameters below one tenth degrees and accuracy of translation parameters below the point spacing and chosen cell size of the raster. Furthermore, the possibility of registration of airborne LiDAR and photogrammetric point clouds from UAV taken images is shown with a similar result. The evaluation also shows the robustness of the approach in scenes where a classical iterative closest point (ICP) fails.

scholarly journals Iterative K-Closest Point Algorithms for Colored Point Cloud Registration

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5331
Author(s):  
Ouk Choi ◽  
Min-Gyu Park ◽  
Youngbae Hwang
Keyword(s):  
Real World ◽  
Point Cloud ◽  
Point Clouds ◽  
The Other ◽  
Iterative Closest Point ◽  
Depth Images ◽  
The Cost ◽  
Soft Matching ◽  
Colored Point ◽  
Refinement Algorithm

We present two algorithms for aligning two colored point clouds. The two algorithms are designed to minimize a probabilistic cost based on the color-supported soft matching of points in a point cloud to their K-closest points in the other point cloud. The first algorithm, like prior iterative closest point algorithms, refines the pose parameters to minimize the cost. Assuming that the point clouds are obtained from RGB-depth images, our second algorithm regards the measured depth values as variables and minimizes the cost to obtain refined depth values. Experiments with our synthetic dataset show that our pose refinement algorithm gives better results compared to the existing algorithms. Our depth refinement algorithm is shown to achieve more accurate alignments from the outputs of the pose refinement step. Our algorithms are applied to a real-world dataset, providing accurate and visually improved results.

An Initial Registration Method of Point Clouds Based on Random Sampling

2014 ◽  
Vol 513-517 ◽  
pp. 3680-3683 ◽  
Author(s):  
Xiao Xu Leng ◽  
Jun Xiao ◽  
Deng Yu Li
Keyword(s):  
Random Sampling ◽  
Point Cloud ◽  
Critical Role ◽  
Point Clouds ◽  
Least Square ◽  
Target Point ◽  
Registration Method ◽  
Source Point ◽  
Base Points ◽  
The Matrix

As the first step in 3D point cloud process, registration plays an critical role in determining the quality of subsequent results. In this paper, an initial registration algorithm of point clouds based on random sampling is proposed. In the proposed algorithm, the base points set is first extracted randomly in the target point cloud, next an optimal corresponding points set is got from the source point cloud, then a transform matrix is estimated based on the two sets with least square methods, finally the matrix is applied on the source point cloud. Experimental results show that this algorithm has ideal precision as well as good robustness.

scholarly journals MPCR-Net: Multiple Partial Point Clouds Registration Network Using a Global Template

2021 ◽  
Author(s):  
Shijie Su ◽  
Chao Wang ◽  
Ke Chen ◽  
Jian Zhang ◽  
Yang Hui
Keyword(s):  
Point Cloud ◽  
Cloud Model ◽  
Ideal Point ◽  
Point Clouds ◽  
3D Measurement ◽  
Registration Accuracy ◽  
Point Cloud Registration ◽  
Point Groups ◽  
Iterative Closest Point Algorithm ◽  
Rigid Body Transformation

With the advancement of photoelectric technology and computer image processing technology, the visual measurement method based on point clouds is gradually applied to the 3D measurement of large workpieces. Point cloud registration is a key step in 3D measurement, and its registration accuracy directly affects the accuracy of 3D measurements. In this study, we designed a novel MPCR-Net for multiple partial point cloud registration networks. First, an ideal point cloud was extracted from the CAD model of the workpiece and was used as the global template. Next, a deep neural network was used to search for the corresponding point groups between each partial point cloud and the global template point cloud. Then, the rigid body transformation matrix was learned according to these correspondence point groups to realize the registration of each partial point cloud. Finally, the iterative closest point algorithm was used to optimize the registration results to obtain a final point cloud model of the workpiece. We conducted point cloud registration experiments on untrained models and actual workpieces, and by comparing them with existing point cloud registration methods, we verified that the MPCR-Net could improve the accuracy and robustness of the 3D point cloud registration.

scholarly journals An Automatic Spherical Targets Detection Method with Multiple Geometrical Constraints

2020 ◽  
Author(s):  
Fugui Xie ◽  
Tonggang Zhang ◽  
Dan Zhong ◽  
Yuhui Kan
Keyword(s):  
Point Cloud ◽  
High Speed ◽  
Radial Direction ◽  
Detection Method ◽  
Point Clouds ◽  
Filter Method ◽  
Target Point ◽  
Potential Target ◽  
Geometrical Constraints ◽  
Random Sample Consensus

Spherical targets are used extensively in the registration and coordinate transformation of the railway point cloud. Thus, it is necessary to accurately detect the spherical targets from the railway point cloud. This paper proposes an automatic spherical targets detection method with multiple geometrical constraints. In this method, possible spherical points are extracted by the improved three points filter method. And possible spherical points are refined according to neighborhood height difference and curvature. Then, the refined possible spherical points are spatially clustered by the Euclidean clustering method and the potential target point clouds can be extracted by constructing the spherical neighborhood according to the cluster centroid. Finally, the ratio constrained random sample consensus (RC-RANSAC) method is proposed in this paper, based on the RANSAC method, to detect the spherical targets in the potential target point clouds. The point cloud scanned from the high-speed railway is taken as experimental data. The spherical targets in the point cloud are detected by this method. The experimental results show that the proposed method can detect the spherical target with and without the background in radial direction.

Sign in / Sign up

Export Citation Format

Share Document