scholarly journals Efficient Rock Mass Point Cloud Registration Based on Local Invariants

2021 ◽  
Vol 13 (8) ◽  
pp. 1540
Author(s):  
Yunbiao Wang ◽  
Jun Xiao ◽  
Lupeng Liu ◽  
Ying Wang
Keyword(s):  
Point Cloud ◽  
Basic Research ◽  
Complex Surface ◽  
Point Clouds ◽  
Target Point ◽  
Translation Vector ◽  
Point Sets ◽  
Point Cloud Registration ◽  
Registration Method ◽  
Local Invariants

Point cloud registration is one of the basic research hotspots in the field of 3D reconstruction. Although many previous studies have made great progress, the registration of rock point clouds remains an ongoing challenge, due to the complex surface, arbitrary shape, and high resolution of rock masses. To overcome these challenges, a novel registration method for rock point clouds, based on local invariants, is proposed in this paper. First, to handle the massive point clouds, a point of interest filtering method based on a sum vector is adopted to reduce the number of points. Second, the remaining points of interest are divided into several cluster point sets and the centroid of each cluster is calculated. Then, we determine the correspondence between the original point cloud and the target point cloud by proving the inherent similarity (using the trace of the covariance matrix) of the remaining point sets. Finally, the rotation matrix and translation vector are calculated, according to the corresponding centroids, and a correction method is used to adjust the positions of the centroids. To illustrate the superiority of our method, in terms of accuracy and efficiency, we conducted experiments on multiple datasets. The experimental results show that the method has higher accuracy (about ten times) and efficiency than similar existing methods.

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 TIF-Reg: Point Cloud Registration with Transform-Invariant Features in SE(3)

Sensors ◽  
2021 ◽  
Vol 21 (17) ◽  
pp. 5778
Author(s):  
Baifan Chen ◽  
Hong Chen ◽  
Baojun Song ◽  
Grace Gong
Keyword(s):  
Feature Extraction ◽  
Point Cloud ◽  
Point Clouds ◽  
Rigid Transformation ◽  
Point Cloud Registration ◽  
Registration Method ◽  
Invariant Features ◽  
Invariant Feature ◽  
Deep Feature ◽  
Wide Range

Three-dimensional point cloud registration (PCReg) has a wide range of applications in computer vision, 3D reconstruction and medical fields. Although numerous advances have been achieved in the field of point cloud registration in recent years, large-scale rigid transformation is a problem that most algorithms still cannot effectively handle. To solve this problem, we propose a point cloud registration method based on learning and transform-invariant features (TIF-Reg). Our algorithm includes four modules, which are the transform-invariant feature extraction module, deep feature embedding module, corresponding point generation module and decoupled singular value decomposition (SVD) module. In the transform-invariant feature extraction module, we design TIF in SE(3) (which means the 3D rigid transformation space) which contains a triangular feature and local density feature for points. It fully exploits the transformation invariance of point clouds, making the algorithm highly robust to rigid transformation. The deep feature embedding module embeds TIF into a high-dimension space using a deep neural network, further improving the expression ability of features. The corresponding point cloud is generated using an attention mechanism in the corresponding point generation module, and the final transformation for registration is calculated in the decoupled SVD module. In an experiment, we first train and evaluate the TIF-Reg method on the ModelNet40 dataset. The results show that our method keeps the root mean squared error (RMSE) of rotation within 0.5∘ and the RMSE of translation error close to 0 m, even when the rotation is up to [−180∘, 180∘] or the translation is up to [−20 m, 20 m]. We also test the generalization of our method on the TUM3D dataset using the model trained on Modelnet40. The results show that our method’s errors are close to the experimental results on Modelnet40, which verifies the good generalization ability of our method. All experiments prove that the proposed method is superior to state-of-the-art PCReg algorithms in terms of accuracy and complexity.

scholarly journals An Automatic 3D Point Cloud Registration Method Based on Biological Vision

2021 ◽  
Vol 11 (10) ◽  
pp. 4538
Author(s):  
Jinbo Liu ◽  
Pengyu Guo ◽  
Xiaoliang Sun
Keyword(s):  
Point Cloud ◽  
Feature Detection ◽  
Surface Deformation ◽  
Point Clouds ◽  
Transformation Matrix ◽  
Point Cloud Registration ◽  
Biological Vision ◽  
Registration Method ◽  
Shape Fitting ◽  
Initial Values

When measuring surface deformation, because the overlap of point clouds before and after deformation is small and the accuracy of the initial value of point cloud registration cannot be guaranteed, traditional point cloud registration methods cannot be applied. In order to solve this problem, a complete solution is proposed, first, by fixing at least three cones to the target. Then, through cone vertices, initial values of the transformation matrix can be calculated. On the basis of this, the point cloud registration can be performed accurately through the iterative closest point (ICP) algorithm using the neighboring point clouds of cone vertices. To improve the automation of this solution, an accurate and automatic point cloud registration method based on biological vision is proposed. First, the three-dimensional (3D) coordinates of cone vertices are obtained through multi-view observation, feature detection, data fusion, and shape fitting. In shape fitting, a closed-form solution of cone vertices is derived on the basis of the quadratic form. Second, a random strategy is designed to calculate the initial values of the transformation matrix between two point clouds. Then, combined with ICP, point cloud registration is realized automatically and precisely. The simulation results showed that, when the intensity of Gaussian noise ranged from 0 to 1 mr (where mr denotes the average mesh resolution of the models), the rotation and translation errors of point cloud registration were less than 0.1° and 1 mr, respectively. Lastly, a camera-projector system to dynamically measure the surface deformation during ablation tests in an arc-heated wind tunnel was developed, and the experimental results showed that the measuring precision for surface deformation exceeded 0.05 mm when surface deformation was smaller than 4 mm.

scholarly journals MULTIPLE TLS POINT CLOUD REGISTRATION BASED ON POINT PROJECTION IMAGES

2018 ◽  
Vol XLII-2 ◽  
pp. 1083-1090 ◽  
Author(s):  
T. Sumi ◽  
H. Date ◽  
S. Kanai
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Multiple Point ◽  
Point Cloud Registration ◽  
Registration Method ◽  
Validity Check ◽  
Check Method ◽  
Projection Images ◽  
Pairwise Registration ◽  
Point Projection

In this paper, an efficient and robust registration method of multiple point clouds is proposed. In our research, we assume that point clouds are acquired by Terrestrial Laser Scanning (TLS) systems, and the scanned environments have a relatively flat base plane such as the ground or a floor. Our method is based on an existing pairwise registration method based on point projection images, which can quickly register the point clouds under the above assumptions. In the method, sliced point clouds are projected onto the base plane, and a binary image with feature points is created. The registration is done by using feature points of the images based on the sample consensus strategy. In this paper, first, we improve the efficiency of the pairwise registration method by introducing height and occlusion information to the image. Then, a validity check method of pairwise registration using space-classified images is proposed to avoid exhaustive pairwise registration in the multiple point cloud registration process. Finally, an efficient multiple point cloud registration algorithm based on progressive creation of a point cloud connectivity graph using iterative rough and precise pairwise registration and the validity check method is proposed. The effectiveness of our method is shown through its application to three datasets of outdoor environments.

scholarly journals A Fast and Robust Rotation Search and Point Cloud Registration Method for 2D Stitching and 3D Object Localization

2021 ◽  
Vol 11 (20) ◽  
pp. 9775
Author(s):  
Lei Sun ◽  
Zhongliang Deng
Keyword(s):  
Real World ◽  
Point Cloud ◽  
Point Clouds ◽  
Object Localization ◽  
Point Cloud Registration ◽  
Registration Method ◽  
3D Object ◽  
Real World Application ◽  
Large Numbers ◽  
Optimal Rotation

Rotation search and point cloud registration are two fundamental problems in robotics, geometric vision, and remote sensing, which aim to estimate the rotation and transformation between the 3D vector sets and point clouds, respectively. Due to the presence of outliers (probably in very large numbers) among the putative vector or point correspondences in real-world applications, robust estimation is of great importance. In this paper, we present Inlier searching using COmpatible Structures (ICOS), a novel, efficient, and highly robust solver for both the correspondence-based rotation search and point cloud registration problems. Specifically, we (i) propose and construct a series of compatible structures for the two problems, based on which various invariants can be established, and (ii) design time-efficient frameworks to filter out outliers and seek inliers from the invariant-constrained random sampling based on the compatible structures proposed. In this manner, even with extreme outlier ratios, inliers can be effectively sifted out and collected for solving the optimal rotation and transformation, leading to our robust solver ICOS. Through plentiful experiments over standard datasets, we demonstrated that: (i) our solver ICOS is fast, accurate, and robust against over 95% outliers with nearly a 100% recall ratio of inliers for rotation search and both known-scale and unknown-scale registration, outperforming other state-of-the-art methods, and (ii) ICOS is practical for use in real-world application problems including 2D image stitching and 3D object localization.

scholarly journals Planning with Learned Dynamic Model for Unsupervised Point Cloud Registration

2021 ◽  
Author(s):  
Haobo Jiang ◽  
Jianjun Qian ◽  
Jin Xie ◽  
Jian Yang
Keyword(s):  
Dynamic Model ◽  
Point Cloud ◽  
Fundamental Problem ◽  
Point Clouds ◽  
Search Space ◽  
Target Point ◽  
Planning Problem ◽  
Point Cloud Registration ◽  
Registration Process ◽  
Cross Entropy Method

Point cloud registration is a fundamental problem in 3D computer vision. In this paper, we cast point cloud registration into a planning problem in reinforcement learning, which can seek the transformation between the source and target point clouds through trial and error. By modeling the point cloud registration process as a Markov decision process (MDP), we develop a latent dynamic model of point clouds, consisting of a transformation network and evaluation network. The transformation network aims to predict the new transformed feature of the point cloud after performing a rigid transformation (i.e., action) on it while the evaluation network aims to predict the alignment precision between the transformed source point cloud and target point cloud as the reward signal. Once the dynamic model of the point cloud is trained, we employ the cross-entropy method (CEM) to iteratively update the planning policy by maximizing the rewards in the point cloud registration process. Thus, the optimal policy, i.e., the transformation between the source and target point clouds, can be obtained via gradually narrowing the search space of the transformation. Experimental results on ModelNet40 and 7Scene benchmark datasets demonstrate that our method can yield good registration performance in an unsupervised manner.

scholarly journals Linear-Based Incremental Co-Registration of MLS and Photogrammetric Point Clouds

2021 ◽  
Vol 13 (11) ◽  
pp. 2195
Author(s):  
Shiming Li ◽  
Xuming Ge ◽  
Shengfu Li ◽  
Bo Xu ◽  
Zhendong Wang
Keyword(s):  
Point Cloud ◽  
Laser Scanning ◽  
Point Clouds ◽  
Registration Method ◽  
Cloud Data ◽  
Linear Feature ◽  
Data Registration ◽  
Source Point ◽  
Urban Remote Sensing ◽  
Single Data

Today, mobile laser scanning and oblique photogrammetry are two standard urban remote sensing acquisition methods, and the cross-source point-cloud data obtained using these methods have significant differences and complementarity. Accurate co-registration can make up for the limitations of a single data source, but many existing registration methods face critical challenges. Therefore, in this paper, we propose a systematic incremental registration method that can successfully register MLS and photogrammetric point clouds in the presence of a large number of missing data, large variations in point density, and scale differences. The robustness of this method is due to its elimination of noise in the extracted linear features and its 2D incremental registration strategy. There are three main contributions of our work: (1) the development of an end-to-end automatic cross-source point-cloud registration method; (2) a way to effectively extract the linear feature and restore the scale; and (3) an incremental registration strategy that simplifies the complex registration process. The experimental results show that this method can successfully achieve cross-source data registration, while other methods have difficulty obtaining satisfactory registration results efficiently. Moreover, this method can be extended to more point-cloud sources.

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>

scholarly journals 3-D Point Cloud Registration Using Convolutional Neural Networks

2019 ◽  
Vol 9 (16) ◽  
pp. 3273 ◽  
Author(s):  
Wen-Chung Chang ◽  
Van-Toan Pham
Keyword(s):  
Pose Estimation ◽  
Point Cloud ◽  
Full Range ◽  
Point Clouds ◽  
Fixed Time ◽  
Training Data ◽  
Data Sets ◽  
Point Cloud Registration ◽  
Cloud Data ◽  
Model Point

This paper develops a registration architecture for the purpose of estimating relative pose including the rotation and the translation of an object in terms of a model in 3-D space based on 3-D point clouds captured by a 3-D camera. Particularly, this paper addresses the time-consuming problem of 3-D point cloud registration which is essential for the closed-loop industrial automated assembly systems that demand fixed time for accurate pose estimation. Firstly, two different descriptors are developed in order to extract coarse and detailed features of these point cloud data sets for the purpose of creating training data sets according to diversified orientations. Secondly, in order to guarantee fast pose estimation in fixed time, a seemingly novel registration architecture by employing two consecutive convolutional neural network (CNN) models is proposed. After training, the proposed CNN architecture can estimate the rotation between the model point cloud and a data point cloud, followed by the translation estimation based on computing average values. By covering a smaller range of uncertainty of the orientation compared with a full range of uncertainty covered by the first CNN model, the second CNN model can precisely estimate the orientation of the 3-D point cloud. Finally, the performance of the algorithm proposed in this paper has been validated by experiments in comparison with baseline methods. Based on these results, the proposed algorithm significantly reduces the estimation time while maintaining high precision.

scholarly journals Evaluating Thermal Attribute Mapping Strategies for Oblique Airborne Photogrammetric System AOS-Tx8

2019 ◽  
Vol 12 (1) ◽  
pp. 112 ◽  
Author(s):  
Dong Lin ◽  
Lutz Bannehr ◽  
Christoph Ulrich ◽  
Hans-Gerd Maas
Keyword(s):  
Point Cloud ◽  
Large Scale ◽  
Texture Mapping ◽  
Point Clouds ◽  
Registration Accuracy ◽  
Point Cloud Registration ◽  
Thermal Imagery ◽  
Processing Scheme ◽  
Data Registration ◽  
Thermal Cameras

Thermal imagery is widely used in various fields of remote sensing. In this study, a novel processing scheme is developed to process the data acquired by the oblique airborne photogrammetric system AOS-Tx8 consisting of four thermal cameras and four RGB cameras with the goal of large-scale area thermal attribute mapping. In order to merge 3D RGB data and 3D thermal data, registration is conducted in four steps: First, thermal and RGB point clouds are generated independently by applying structure from motion (SfM) photogrammetry to both the thermal and RGB imagery. Next, a coarse point cloud registration is performed by the support of georeferencing data (global positioning system, GPS). Subsequently, a fine point cloud registration is conducted by octree-based iterative closest point (ICP). Finally, three different texture mapping strategies are compared. Experimental results showed that the global image pose refinement outperforms the other two strategies at registration accuracy between thermal imagery and RGB point cloud. Potential building thermal leakages in large areas can be fast detected in the generated texture mapping results. Furthermore, a combination of the proposed workflow and the oblique airborne system allows for a detailed thermal analysis of building roofs and facades.

Sign in / Sign up

Export Citation Format

Share Document