scholarly journals Super Edge 4-Points Congruent Sets-Based Point Cloud Global Registration

2021 ◽  
Vol 13 (16) ◽  
pp. 3210
Author(s):  
Shikun Li ◽  
Ruodan Lu ◽  
Jianya Liu ◽  
Liang Guo
Keyword(s):  
Three Dimensional ◽  
Initial Point ◽  
Point Clouds ◽  
Search Space ◽  
Frame Rate ◽  
Registration Method ◽  
Dense Point ◽  
Coarse Registration ◽  
Fine Registration ◽  
Original Point

With the acceleration in three-dimensional (3D) high-frame-rate sensing technologies, dense point clouds collected from multiple standpoints pose a great challenge for the accuracy and efficiency of registration. The combination of coarse registration and fine registration has been extensively promoted. Unlike the requirement of small movements between scan pairs in fine registration, coarse registration can match scans with arbitrary initial poses. The state-of-the-art coarse methods, Super 4-Points Congruent Sets algorithm based on the 4-Points Congruent Sets, improves the speed of registration to a linear order via smart indexing. However, the lack of reduction in the scale of original point clouds limits the application. Besides, the coplanarity of registration bases prevents further reduction of search space. This paper proposes a novel registration method called the Super Edge 4-Points Congruent Sets to address the above problems. The proposed algorithm follows a three-step procedure, including boundary segmentation, overlapping regions extraction, and bases selection. Firstly, an improved method based on vector angle is used to segment the original point clouds aiming to thin out the scale of the initial point clouds. Furthermore, overlapping regions extraction is executed to find out the overlapping regions on the contour. Finally, the proposed method selects registration bases conforming to the distance constraints from the candidate set without consideration about coplanarity. Experiments on various datasets with different characteristics have demonstrated that the average time complexity of the proposed algorithm is improved by 89.76%, and the accuracy is improved by 5 mm on average than the Super 4-Points Congruent Sets algorithm. More encouragingly, the experimental results show that the proposed algorithm can be applied to various restrictive cases, such as few overlapping regions and massive noise. Therefore, the algorithm proposed in this paper is a faster and more robust method than Super 4-Points Congruent Sets under the guarantee of the promised quality.

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 mm and 9.5 mm respectively, which are adequate for fine registration.

Rapid Method for Point Clouds Registration Based on Reference Points

2011 ◽  
Vol 48-49 ◽  
pp. 873-876
Author(s):  
Hou Jun Yang ◽  
Wei Zhong Zhang ◽  
Xiao Lie Liu
Keyword(s):  
Rapid Method ◽  
Point Clouds ◽  
Reference Points ◽  
Experimental Result ◽  
Model Parameters ◽  
Registration Accuracy ◽  
Computation Efficiency ◽  
Dense Point ◽  
Coarse Registration ◽  
Fine Registration

Incremental point clouds registration is studied in this paper. A rapid method for point clouds registration based on reference points is proposed, which consists of the coarse registration and fine registration. Firstly, a set of reference points is applied as an assistant utility to measure the object. The transformation parameters are estimated by using the reference points only for coarse registration, and then dense point clouds data will be transformed to the same coordinate system. Secondly, taking the coarse registration results as the initial value, the improved Interactive Closest Point (ICP) algorithm is used in fine registration the original corresponding points are established rapidly by using the k-d tree searching algorithm. Finally, Preview Model Parameters Evaluation Random Sample Consensus (PERANSAC) algorithm is utilized to remove outliers. The experimental result shows that this method in finding original corresponding points can greatly improve the computation efficiency and also improve the registration accuracy.

A Coarse-to-Fine Registration on 3D Multi-Phase Abdominal CT Images

2020 ◽  
Vol 12 (7) ◽  
pp. 909-914
Author(s):  
Shao-Di Yang ◽  
Fan Zhang ◽  
Zhen Yang ◽  
Xiao-Yu Yang ◽  
Shu-Zhou Li
Keyword(s):  
Three Dimensional ◽  
Ct Images ◽  
Abdominal Ct ◽  
Registration Method ◽  
Coarse Registration ◽  
Multi Phase ◽  
Coarse To Fine ◽  
Aided Diagnosis ◽  
Fine Registration ◽  
Spatial Regularization

Registration is a technical support for the integration of nanomaterial imaging-aided diagnosis and treatment. In this paper, a coarse-to-fine three-dimensional (3D) multi-phase abdominal CT images registration method is proposed. Firstly, a linear model is used to coarsely register the paired multiphase images. Secondly, an intensity-based registration framework is proposed, which contains the data and spatial regularization terms and performs fine registration on the paired images obtained in the coarse registration step. The results illustrate that the proposed method is superior to some existing methods with the average MSE, PSNR, and SSIM values of 0.0082, 21.2695, and 0.8956, respectively. Therefore, the proposed method provides an efficient and robust framework for 3D multi-phase abdominal CT images registration.

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 mm and 9.5 mm respectively, which are adequate for fine registration.

scholarly journals AUTOMATIC REGISTRATION OF APPROXIMATELY LEVELED POINT CLOUDS OF URBAN SCENES

2015 ◽  
Vol II-3/W5 ◽  
pp. 145-150 ◽  
Author(s):  
A. Moussa ◽  
N. Elsheimy
Keyword(s):  
Full Range ◽  
Point Clouds ◽  
Search Space ◽  
Search Problem ◽  
Data Sets ◽  
Urban Scenes ◽  
Small Height ◽  
Coarse Registration ◽  
Fully Automatic ◽  
Fine Registration

Registration of point clouds is a necessary step to obtain a complete overview of scanned objects of interest. The majority of the current registration approaches target the general case where a full range of the registration parameters search space is assumed and searched. It is very common in urban objects scanning to have leveled point clouds with small roll and pitch angles and with also a small height differences. For such scenarios the registration search problem can be handled faster to obtain a coarse registration of two point clouds. In this paper, a fully automatic approach is proposed for registration of approximately leveled point clouds. The proposed approach estimates a coarse registration based on three registration parameters and then conducts a fine registration step using iterative closest point approach. The approach has been tested on three data sets of different areas and the achieved registration results validate the significance of the proposed approach.

scholarly journals Robust Coarse-to-Fine Registration Scheme for Mobile Laser Scanner Point Clouds Using Multiscale Eigenvalue Statistic-Based Descriptor

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2431
Author(s):  
Yongjian Fu ◽  
Zongchun Li ◽  
Wenqi Wang ◽  
Hua He ◽  
Feng Xiong ◽  
...  
Keyword(s):  
Laser Scanner ◽  
Point Clouds ◽  
Target Point ◽  
Registration Method ◽  
Geometric Consistency ◽  
Coarse Registration ◽  
Eigenvalue Statistic ◽  
Pairwise Registration ◽  
Coarse To Fine ◽  
Fine Registration

To overcome the drawbacks of pairwise registration for mobile laser scanner (MLS) point clouds, such as difficulty in searching the corresponding points and inaccuracy registration matrix, a robust coarse-to-fine registration method is proposed to align different frames of MLS point clouds into a common coordinate system. The method identifies the correct corresponding point pairs from the source and target point clouds, and then calculates the transform matrix. First, the performance of a multiscale eigenvalue statistic-based descriptor with different combinations of parameters is evaluated to identify the optimal combination. Second, based on the geometric distribution of points in the neighborhood of the keypoint, a weighted covariance matrix is constructed, by which the multiscale eigenvalues are calculated as the feature description language. Third, the corresponding points between the source and target point clouds are estimated in the feature space, and the incorrect ones are eliminated via a geometric consistency constraint. Finally, the estimated corresponding point pairs are used for coarse registration. The value of coarse registration is regarded as the initial value for the iterative closest point algorithm. Subsequently, the final fine registration result is obtained. The results of the registration experiments with Autonomous Systems Lab (ASL) Datasets show that the proposed method can accurately align MLS point clouds in different frames and outperform the comparative methods.

scholarly journals Integration of prior knowledge into dense image matching for video surveillance

2014 ◽  
Vol XL-3 ◽  
pp. 227-230
Author(s):  
M. Menze ◽  
C. Heipke
Keyword(s):  
Prior Knowledge ◽  
Video Surveillance ◽  
Image Matching ◽  
Three Dimensional ◽  
Region Of Interest ◽  
Point Clouds ◽  
Search Space ◽  
Surveillance Camera ◽  
Dense Image ◽  
Dense Point

Three-dimensional information from dense image matching is a valuable input for a broad range of vision applications. While reliable approaches exist for dedicated stereo setups they do not easily generalize to more challenging camera configurations. In the context of video surveillance the typically large spatial extent of the region of interest and repetitive structures in the scene render the application of dense image matching a challenging task. In this paper we present an approach that derives strong prior knowledge from a planar approximation of the scene. This information is integrated into a graph-cut based image matching framework that treats the assignment of optimal disparity values as a labelling task. Introducing the planar prior heavily reduces ambiguities together with the search space and increases computational efficiency. The results provide a proof of concept of the proposed approach. It allows the reconstruction of dense point clouds in more general surveillance camera setups with wider stereo baselines.

scholarly journals SPPD: A Novel Reassembly Method for 3D Terracotta Warrior Fragments Based on Fracture Surface Information

2021 ◽  
Vol 10 (8) ◽  
pp. 525
Author(s):  
Wenmin Yao ◽  
Tong Chu ◽  
Wenlong Tang ◽  
Jingyu Wang ◽  
Xin Cao ◽  
...  
Keyword(s):  
Fracture Surface ◽  
Principal Component ◽  
Point Clouds ◽  
Three Dimension ◽  
Registration Method ◽  
Series Of Experiments ◽  
Coarse To Fine ◽  
Fine Registration ◽  
Common Situation ◽  
Better Than

As one of China′s most precious cultural relics, the excavation and protection of the Terracotta Warriors pose significant challenges to archaeologists. A fairly common situation in the excavation is that the Terracotta Warriors are mostly found in the form of fragments, and manual reassembly among numerous fragments is laborious and time-consuming. This work presents a fracture-surface-based reassembling method, which is composed of SiamesePointNet, principal component analysis (PCA), and deep closest point (DCP), and is named SPPD. Firstly, SiamesePointNet is proposed to determine whether a pair of point clouds of 3D Terracotta Warrior fragments can be reassembled. Then, a coarse-to-fine registration method based on PCA and DCP is proposed to register the two fragments into a reassembled one. The above two steps iterate until the termination condition is met. A series of experiments on real-world examples are conducted, and the results demonstrate that the proposed method performs better than the conventional reassembling methods. We hope this work can provide a valuable tool for the virtual restoration of three-dimension cultural heritage artifacts.

scholarly journals Estimating tree stem diameters and volume from smartphone photogrammetric point clouds

2019 ◽  
Vol 93 (3) ◽  
pp. 411-429 ◽  
Author(s):  
Maria Immacolata Marzulli ◽  
Pasi Raumonen ◽  
Roberto Greco ◽  
Manuela Persia ◽  
Patrizia Tartarino
Keyword(s):  
Low Cost ◽  
Three Dimensional ◽  
Laser Scanner ◽  
Point Clouds ◽  
Stem Volume ◽  
Forest Plot ◽  
3D Point Clouds ◽  
Dense Point ◽  
Minimum Number ◽  
Scale Point

Abstract Methods for the three-dimensional (3D) reconstruction of forest trees have been suggested for data from active and passive sensors. Laser scanner technologies have become popular in the last few years, despite their high costs. Since the improvements in photogrammetric algorithms (e.g. structure from motion—SfM), photographs have become a new low-cost source of 3D point clouds. In this study, we use images captured by a smartphone camera to calculate dense point clouds of a forest plot using SfM. Eighteen point clouds were produced by changing the densification parameters (Image scale, Point density, Minimum number of matches) in order to investigate their influence on the quality of the point clouds produced. In order to estimate diameter at breast height (d.b.h.) and stem volumes, we developed an automatic method that extracts the stems from the point cloud and then models them with cylinders. The results show that Image scale is the most influential parameter in terms of identifying and extracting trees from the point clouds. The best performance with cylinder modelling from point clouds compared to field data had an RMSE of 1.9 cm and 0.094 m3, for d.b.h. and volume, respectively. Thus, for forest management and planning purposes, it is possible to use our photogrammetric and modelling methods to measure d.b.h., stem volume and possibly other forest inventory metrics, rapidly and without felling trees. The proposed methodology significantly reduces working time in the field, using ‘non-professional’ instruments and automating estimates of dendrometric parameters.

scholarly journals A Novel Coarse-to-Fine Scheme for Remote Sensing Image Registration Based on SIFT and Phase Correlation

2019 ◽  
Vol 11 (15) ◽  
pp. 1833 ◽  
Author(s):  
Han Yang ◽  
Xiaorun Li ◽  
Liaoying Zhao ◽  
Shuhan Chen
Keyword(s):  
Remote Sensing ◽  
Image Registration ◽  
Phase Correlation ◽  
Mean Square ◽  
Extended Phase ◽  
Registration Method ◽  
Coarse Registration ◽  
Feature Based ◽  
Coarse To Fine ◽  
Fine Registration

Automatic image registration has been wildly used in remote sensing applications. However, the feature-based registration method is sometimes inaccurate and unstable for images with large scale difference, grayscale and texture differences. In this manuscript, a coarse-to-fine registration scheme is proposed, which combines the advantage of feature-based registration and phase correlation-based registration. The scheme consists of four steps. First, feature-based registration method is adopted for coarse registration. A geometrical outlier removal method is applied to improve the accuracy of coarse registration, which uses geometric similarities of inliers. Then, the sensed image is modified through the coarse registration result under affine deformation model. After that, the modified sensed image is registered to the reference image by extended phase correlation. Lastly, the final registration results are calculated by the fusion of the coarse registration and the fine registration. High universality of feature-based registration and high accuracy of extended phase correlation-based registration are both preserved in the proposed method. Experimental results of several different remote sensing images, which come from several published image registration papers, demonstrate the high robustness and accuracy of the proposed method. The evaluation contains root mean square error (RMSE), Laplace mean square error (LMSE) and red–green image registration results.

Sign in / Sign up

Export Citation Format

Share Document