scholarly journals An Experimental Study of a New Keypoint Matching Algorithm for Automatic Point Cloud Registration

2021 ◽  
Vol 10 (4) ◽  
pp. 204
Author(s):  
Ramazan Alper Kuçak ◽  
Serdar Erol ◽  
Bihter Erol
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Data Systems ◽  
Icp Algorithm ◽  
Matching Algorithm ◽  
Suggested Algorithm ◽  
Registration Process ◽  
Building Facade ◽  
Coarse Registration ◽  
Fine Registration

Light detection and ranging (LiDAR) data systems mounted on a moving or stationary platform provide 3D point cloud data for various purposes. In applications where the interested area or object needs to be measured twice or more with a shift, precise registration of the obtained point clouds is crucial for generating a healthy model with the combination of the overlapped point clouds. Automatic registration of the point clouds in the common coordinate system using the iterative closest point (ICP) algorithm or its variants is one of the frequently applied methods in the literature, and a number of studies focus on improving the registration process algorithms for achieving better results. This study proposed and tested a different approach for automatic keypoint detecting and matching in coarse registration of the point clouds before fine registration using the ICP algorithm. In the suggested algorithm, the keypoints were matched considering their geometrical relations expressed by means of the angles and distances among them. Hence, contributing the quality improvement of the 3D model obtained through the fine registration process, which is carried out using the ICP method, was our aim. The performance of the new algorithm was assessed using the root mean square error (RMSE) of the 3D transformation in the rough alignment stage as well as a-prior and a-posterior RMSE values of the ICP algorithm. The new algorithm was also compared with the point feature histogram (PFH) descriptor and matching algorithm, accompanying two commonly used detectors. In result of the comparisons, the superiorities and disadvantages of the suggested algorithm were discussed. The measurements for the datasets employed in the experiments were carried out using scanned data of a 6 cm × 6 cm × 10 cm Aristotle sculpture in the laboratory environment, and a building facade in the outdoor as well as using the publically available Stanford bunny sculpture data. In each case study, the proposed algorithm provided satisfying performance with superior accuracy and less iteration number in the ICP process compared to the other coarse registration methods. From the point clouds where coarse registration has been made with the proposed method, the fine registration accuracies in terms of RMSE values with ICP iterations are calculated as ~0.29 cm for Aristotle and Stanford bunny sculptures, ~2.0 cm for the building facade, respectively.

scholarly journals Evaluation of Partially Overlapping 3D Point Cloud's Registration by using ICP variant and CloudCompare.

2014 ◽  
Vol XL-8 ◽  
pp. 891-897 ◽  
Author(s):  
Y. D. Rajendra ◽  
S. C. Mehrotra ◽  
K. V. Kale ◽  
R. R. Manza ◽  
R. K. Dhumal ◽  
...  
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Large Object ◽  
Point Cloud Registration ◽  
Icp Algorithm ◽  
Cloud Data ◽  
Registration Process ◽  
Heritage Site ◽  
Laser Scanners ◽  
Dense Point

Terrestrial Laser Scanners (TLS) are used to get dense point samples of large object’s surface. TLS is new and efficient method to digitize large object or scene. The collected point samples come into different formats and coordinates. Different scans are required to scan large object such as heritage site. Point cloud registration is considered as important task to bring different scans into whole 3D model in one coordinate system. Point clouds can be registered by using one of the three ways or combination of them, Target based, feature extraction, point cloud based. For the present study we have gone through Point Cloud Based registration approach. We have collected partially overlapped 3D Point Cloud data of Department of Computer Science & IT (DCSIT) building located in Dr. Babasaheb Ambedkar Marathwada University, Aurangabad. To get the complete point cloud information of the building we have taken 12 scans, 4 scans for exterior and 8 scans for interior façade data collection. There are various algorithms available in literature, but Iterative Closest Point (ICP) is most dominant algorithms. The various researchers have developed variants of ICP for better registration process. The ICP point cloud registration algorithm is based on the search of pairs of nearest points in a two adjacent scans and calculates the transformation parameters between them, it provides advantage that no artificial target is required for registration process. We studied and implemented three variants Brute Force, KDTree, Partial Matching of ICP algorithm in MATLAB. The result shows that the implemented version of ICP algorithm with its variants gives better result with speed and accuracy of registration as compared with CloudCompare Open Source software.

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.

scholarly journals DIRECT CO-REGISTRATION OF TIR IMAGES AND MLS POINT CLOUDS BY CORRESPONDING KEYPOINTS

2019 ◽  
Vol IV-2/W7 ◽  
pp. 235-242
Author(s):  
J. Zhu ◽  
Y. Xu ◽  
L. Hoegner ◽  
U. Stilla
Keyword(s):  
Condition Monitoring ◽  
Point Cloud ◽  
Infrared Image ◽  
Point Clouds ◽  
Thermal Infrared ◽  
3D Models ◽  
Corner Detection ◽  
Leakage Detection ◽  
Registration Process ◽  
Camera Pose

<p><strong>Abstract.</strong> In this work, we discussed how to directly combine thermal infrared image (TIR) and the point cloud without additional assistance from GCPs or 3D models. Specifically, we propose a point-based co-registration process for combining the TIR image and the point cloud for the buildings. The keypoints are extracted from images and point clouds via primitive segmentation and corner detection, then pairs of corresponding points are identified manually. After that, the estimated camera pose can be computed with EPnP algorithm. Finally, the point cloud with thermal information provided by IR images can be generated as a result, which is helpful in the tasks such as energy inspection, leakage detection, and abnormal condition monitoring. This paper provides us more insight about the probability and ideas about the combining TIR image and point cloud.</p>

scholarly journals SAR Images Co-registration Based on Gradient Descent Optimization

2019 ◽  
Vol 9 (2) ◽  
pp. 2361-2367
Keyword(s):  
Gradient Descent ◽  
Cross Correlation ◽  
Dynamic Method ◽  
Signal To Noise Ratio ◽  
Gaussian Kernel ◽  
Sar Images ◽  
Registration Process ◽  
Coarse Registration ◽  
The Common ◽  
Fine Registration

The target of the registration process is to get the disagreement between two captured images for the same area to candidate the transformation matrix that is used to map the points in one image to its congruent in the other image for the same area. A dynamic method is demonstrated in this paper to improve registration process of SAR images. At first, smoothing filtering is used for noise reduction based on gaussian-kernel filter to set aside the pursue-up amplification of noise. Then; area based matching method, cross correlation, is used to perform a coarse registration. The output of the coarse registration is directly applied to the regular step gradient descent (RSGD) optimizer as a fine registration process. The performance of the demonstrated method was evaluated via comparison with the common used corner detectors (Harris, Minimum Eigenvalues, and FAST). Mean square error (MSE) and peak signal-to-noise ratio (PSNR) are the main factors for the comparison. The results show that the demonstrated approach preserves the robustness of the registration process and minimizes the image noise.

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.

Point Clouds Registration by Using Depth Images

2014 ◽  
Vol 513-517 ◽  
pp. 4193-4196
Author(s):  
Wen Bao Qiao ◽  
Ming Guo ◽  
Jun Jie Liu
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Scale Space ◽  
Target Object ◽  
Icp Algorithm ◽  
Depth Images ◽  
Curvature Scale Space ◽  
Initial Location ◽  
Characteristic Points

In this paper, we propose an efficient way to produce an initial transposed matrix for two point clouds, which can effectively avoid the drawback of local optimism caused by using standard Iterative Closest Points (ICP)[ algorithm when matching two point clouds. In our approach, the correspondences used to calculate the transposed matrix are confirmed before the point cloud forms. We use the depth images which have been carefully target-segmented to find the boundaries of the shapes that reflect different views of the same target object. Then each contour is affected by curvature scale space (CSS)[ method to find a sequence of characteristic points. After that, our method is applied on these characteristic points to find the most matching pairs of points. Finally, we convert the matched characteristic points to 3D points, and the correspondences are there being confirmed. We can use them to compute an initial transposed matrix to tell the computer which part of the first point cloud should be matched to the second. In this way, we put the two point clouds in a correct initial location, so that the local optimism of ICP and its variations can be excluded.

scholarly journals COARSE POINT CLOUD REGISTRATION BY EGI MATCHING OF VOXEL CLUSTERS

2016 ◽  
Vol III-5 ◽  
pp. 97-103 ◽  
Author(s):  
Jinhu Wang ◽  
Roderik Lindenbergh ◽  
Yueqian Shen ◽  
Massimo Menenti
Keyword(s):  
Laser Scanning ◽  
Principal Component ◽  
Point Clouds ◽  
Data Sampling ◽  
Surface Geometry ◽  
Registration Method ◽  
Input Point ◽  
Coarse Registration ◽  
Point Distance ◽  
Fine Registration

Laser scanning samples the surface geometry of objects efficiently and records versatile information as point clouds. However, often more scans are required to fully cover a scene. Therefore, a registration step is required that transforms the different scans into a common coordinate system. The registration of point clouds is usually conducted in two steps, i.e. coarse registration followed by fine registration. In this study an automatic marker-free coarse registration method for pair-wise scans is presented. First the two input point clouds are re-sampled as voxels and dimensionality features of the voxels are determined by principal component analysis (PCA). Then voxel cells with the same dimensionality are clustered. Next, the Extended Gaussian Image (EGI) descriptor of those voxel clusters are constructed using significant eigenvectors of each voxel in the cluster. Correspondences between clusters in source and target data are obtained according to the similarity between their EGI descriptors. The random sampling consensus (RANSAC) algorithm is employed to remove outlying correspondences until a coarse alignment is obtained. If necessary, a fine registration is performed in a final step. This new method is illustrated on scan data sampling two indoor scenarios. The results of the tests are evaluated by computing the point to point distance between the two input point clouds. The presented two tests resulted in mean distances of 7.6&thinsp;mm and 9.5&thinsp;mm respectively, which are adequate for fine registration.

Verfahren zur Registrierung von Laserscannerdaten in Waldbeständen | Methods for registration laser scanner point clouds in forest stands

2011 ◽  
Vol 162 (6) ◽  
pp. 178-185 ◽  
Author(s):  
Anne Bienert ◽  
Katharina Pech ◽  
Hans-Gerd Maas
Keyword(s):  
Laser Scanning ◽  
Laser Scanner ◽  
Point Clouds ◽  
Forest Stand ◽  
Geometric Transformation ◽  
Complex Object ◽  
Tree Detection ◽  
Airborne Laser ◽  
Coarse Registration ◽  
Fine Registration

Laser scanning is a fast and efficient 3-D measurement technique to capture surface points describing the geometry of a complex object in an accurate and reliable way. Besides airborne laser scanning, terrestrial laser scanning finds growing interest for forestry applications. These two different recording platforms show large differences in resolution, recording area and scan viewing direction. Using both datasets for a combined point cloud analysis may yield advantages because of their largely complementary information. In this paper, methods will be presented to automatically register airborne and terrestrial laser scanner point clouds of a forest stand. In a first step, tree detection is performed in both datasets in an automatic manner. In a second step, corresponding tree positions are determined using RANSAC. Finally, the geometric transformation is performed, divided in a coarse and fine registration. After a coarse registration, the fine registration is done in an iterative manner (ICP) using the point clouds itself. The methods are tested and validated with a dataset of a forest stand. The presented registration results provide accuracies which fulfill the forestry requirements.

scholarly journals Automated Feature-Based Down-Sampling Approaches for Fine Registration of Irregular Point Clouds

2020 ◽  
Vol 12 (7) ◽  
pp. 1224 ◽  
Author(s):  
Abdulla Al-Rawabdeh ◽  
Fangning He ◽  
Ayman Habib
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Geometric Constraints ◽  
Superior Performance ◽  
Accurate Estimation ◽  
Transformation Parameters ◽  
Matching Techniques ◽  
Mean Square Errors ◽  
Fine Registration ◽  
Sampling Approach

The integration of three-dimensional (3D) data defined in different coordinate systems requires the use of well-known registration procedures, which aim to align multiple models relative to a common reference frame. Depending on the achieved accuracy of the estimated transformation parameters, the existing registration procedures are classified as either coarse or fine registration. Coarse registration is typically used to establish a rough alignment between the involved point clouds. Fine registration starts from coarsely aligned point clouds to achieve more precise alignment of the involved datasets. In practice, the acquired/derived point clouds from laser scanning and image-based dense matching techniques usually include an excessive number of points. Fine registration of huge datasets is time-consuming and sometimes difficult to accomplish in a reasonable timeframe. To address this challenge, this paper introduces two down-sampling approaches, which aim to improve the efficiency and accuracy of the iterative closest patch (ICPatch)-based fine registration. The first approach is based on a planar-based adaptive down-sampling strategy to remove redundant points in areas with high point density while keeping the points in lower density regions. The second approach starts with the derivation of the surface normals for the constituents of a given point cloud using their local neighborhoods, which are then represented on a Gaussian sphere. Down-sampling is ultimately achieved by removing the points from the detected peaks in the Gaussian sphere. Experiments were conducted using both simulated and real datasets to verify the feasibility of the proposed down-sampling approaches for providing reliable transformation parameters. Derived experimental results have demonstrated that for most of the registration cases, in which the points are obtained from various mapping platforms (e.g., mobile/static laser scanner or aerial photogrammetry), the first proposed down-sampling approach (i.e., adaptive down-sampling approach) was capable of exceeding the performance of the traditional approaches, which utilize either the original or randomly down-sampled points, in terms of providing smaller Root Mean Square Errors (RMSE) values and a faster convergence rate. However, for some challenging cases, in which the acquired point cloud only has limited geometric constraints, the Gaussian sphere-based approach was capable of providing superior performance as it preserves some critical points for the accurate estimation of the transformation parameters relating the involved point clouds.

scholarly journals Research on Point Cloud Registering Method of Tunneling Roadway Based on 3D NDT-ICP Algorithm

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4448
Author(s):  
Jianjian Yang ◽  
Chao Wang ◽  
Wenjie Luo ◽  
Yuchen Zhang ◽  
Boshen Chang ◽  
...  
Keyword(s):  
Coordinate Transformation ◽  
Point Cloud ◽  
Point Clouds ◽  
Icp Algorithm ◽  
Point Pair ◽  
Filtering Method ◽  
Environmental Features ◽  
Modeling Accuracy ◽  
Nonlinear Objective Function ◽  
Voxel Grid

In order to meet the needs of intelligent perception of the driving environment, a point cloud registering method based on 3D NDT-ICP algorithm is proposed to improve the modeling accuracy of tunneling roadway environments. Firstly, Voxel Grid filtering method is used to preprocess the point cloud of tunneling roadways to maintain the overall structure of the point cloud and reduce the number of point clouds. After that, the 3D NDT algorithm is used to solve the coordinate transformation of the point cloud in the tunneling roadway and the cell resolution of the algorithm is optimized according to the environmental features of the tunneling roadway. Finally, a kd-tree is introduced into the ICP algorithm for point pair search, and the Gauss–Newton method is used to optimize the solution of nonlinear objective function of the algorithm to complete accurate registering of tunneling roadway point clouds. The experimental results show that the 3D NDT algorithm can meet the resolution requirement when the cell resolution is set to 0.5 m under the condition of processing the point cloud with the environmental features of tunneling roadways. At this time, the registering time is the shortest. Compared with the NDT algorithm, ICP algorithm and traditional 3D NDT-ICP algorithm, the registering speed of the 3D NDT-ICP algorithm proposed in this paper is obviously improved and the registering error is smaller.

Sign in / Sign up

Export Citation Format

Share Document