scholarly journals Global Registration of Multiple Point Clouds Using Semidefinite Programming

2015 ◽  
Vol 25 (1) ◽  
pp. 468-501 ◽  
Author(s):  
K. N. Chaudhury ◽  
Y. Khoo ◽  
A. Singer
Keyword(s):  
Semidefinite Programming ◽  
Point Clouds ◽  
Multiple Point ◽  
Global Registration

scholarly journals COMPARISON OF POINT CLOUD REGISTRATION ALGORITHMS FOR BETTER RESULT ASSESSMENT – TOWARDS AN OPEN-SOURCE SOLUTION

2018 ◽  
Vol XLII-2 ◽  
pp. 551-558 ◽  
Author(s):  
E. Lachat ◽  
T. Landes ◽  
P. Grussenmeyer
Keyword(s):  
Open Source ◽  
Laser Scanning ◽  
Quality Criteria ◽  
Point Clouds ◽  
Academic Community ◽  
Multiple Point ◽  
Common Reference ◽  
Global Registration ◽  
Wide Range ◽  
First Results

Terrestrial and airborne laser scanning, photogrammetry and more generally 3D recording techniques are used in a wide range of applications. After recording several individual 3D datasets known in local systems, one of the first crucial processing steps is the registration of these data into a common reference frame. To perform such a 3D transformation, commercial and open source software as well as programs from the academic community are available. Due to some lacks in terms of computation transparency and quality assessment in these solutions, it has been decided to develop an open source algorithm which is presented in this paper. It is dedicated to the simultaneous registration of multiple point clouds as well as their georeferencing. The idea is to use this algorithm as a start point for further implementations, involving the possibility of combining 3D data from different sources. Parallel to the presentation of the global registration methodology which has been employed, the aim of this paper is to confront the results achieved this way with the above-mentioned existing solutions. For this purpose, first results obtained with the proposed algorithm to perform the global registration of ten laser scanning point clouds are presented. An analysis of the quality criteria delivered by two selected software used in this study and a reflexion about these criteria is also performed to complete the comparison of the obtained results. The final aim of this paper is to validate the current efficiency of the proposed method through these comparisons.

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.

A depth camera-based full-body reconstruction method for body pose training in occupational safety

2020 ◽  
Vol 64 (1) ◽  
pp. 1541-1545
Author(s):  
Li Li ◽  
Ken Chen ◽  
Karen Chen ◽  
Xu Xu*
Keyword(s):  
Occupational Injuries ◽  
Technological Development ◽  
Point Clouds ◽  
Incidence Rates ◽  
Multiple Point ◽  
Reconstruction Method ◽  
Safety Education ◽  
Depth Cameras ◽  
Work Related ◽  
Full Body

Occupational injuries have high incidence rates across various industries. Safety education is a key component to effectively reduce work-related injuries. Posture training for work safety is widely adopted to increase the awareness of unsafe movements at work and to evaluate workers to minimize work-related musculoskeletal stresses. However, existing one-size-fits-all pamphlet-based posture training is facing challenges in its effectiveness. In recent years, the substantial technological development in virtual reality (VR) and augmented reality (AR) has made immersive and personalized education possible. For VR/AR-assisted posture training, full-body reconstruction from multiple point clouds is the key step. In this study, we propose a fast and coarse method to reconstruct the full-body pose of safety instructors using multiple low-cost depth cameras. The reconstructed body images from depth cameras are registered through iterative closet point algorithm. The reconstructed full-body pose can be further rendered in VR/AR environments for next-generation safety education.

scholarly journals Multi-View Laser Point Cloud Global Registration for a Single Object

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3729 ◽  
Author(s):  
Shuai Wang ◽  
Hua-Yan Sun ◽  
Hui-Chao Guo ◽  
Lin Du ◽  
Tian-Jian Liu
Keyword(s):  
Spatial Distribution ◽  
Objective Function ◽  
Point Cloud ◽  
Point Clouds ◽  
Low Rank ◽  
Single Object ◽  
Loop Closure Detection ◽  
Global Registration ◽  
Distribution Features ◽  
Better Than

Global registration is an important step in the three-dimensional reconstruction of multi-view laser point clouds for moving objects, but the severe noise, density variation, and overlap ratio between multi-view laser point clouds present significant challenges to global registration. In this paper, a multi-view laser point cloud global registration method based on low-rank sparse decomposition is proposed. Firstly, the spatial distribution features of point clouds were extracted by spatial rasterization to realize loop-closure detection, and the corresponding weight matrix was established according to the similarities of spatial distribution features. The accuracy of adjacent registration transformation was evaluated, and the robustness of low-rank sparse matrix decomposition was enhanced. Then, the objective function that satisfies the global optimization condition was constructed, which prevented the solution space compression generated by the column-orthogonal hypothesis of the matrix. The objective function was solved by the Augmented Lagrange method, and the iterative termination condition was designed according to the prior conditions of single-object global registration. The simulation analysis shows that the proposed method was robust with a wide range of parameters, and the accuracy of loop-closure detection was over 90%. When the pairwise registration error was below 0.1 rad, the proposed method performed better than the three compared methods, and the global registration accuracy was better than 0.05 rad. Finally, the global registration results of real point cloud experiments further proved the validity and stability of the proposed method.

Incremental reconstruction of planar B-Rep models from multiple point clouds

2016 ◽  
Vol 32 (6-8) ◽  
pp. 945-954 ◽  
Author(s):  
Maximilian Sand ◽  
Dominik Henrich
Keyword(s):  
Point Clouds ◽  
Multiple Point

scholarly journals Low Overlapping Point Cloud Registration Using Line Features Detection

2019 ◽  
Vol 12 (1) ◽  
pp. 61
Author(s):  
Miloš Prokop ◽  
Salman Ahmed Shaikh ◽  
Kyoung-Sook Kim
Keyword(s):  
Point Cloud ◽  
False Positive Rate ◽  
Computational Cost ◽  
Point Clouds ◽  
Multiple Point ◽  
Point Cloud Registration ◽  
Positive Rate ◽  
Effective Exchange ◽  
Line Features ◽  
The Right

Modern robotic exploratory strategies assume multi-agent cooperation that raises a need for an effective exchange of acquired scans of the environment with the absence of a reliable global positioning system. In such situations, agents compare the scans of the outside world to determine if they overlap in some region, and if they do so, they determine the right matching between them. The process of matching multiple point-cloud scans is called point-cloud registration. Using the existing point-cloud registration approaches, a good match between any two-point-clouds is achieved if and only if there exists a large overlap between them, however, this limits the advantage of using multiple robots, for instance, for time-effective 3D mapping. Hence, a point-cloud registration approach is highly desirable if it can work with low overlapping scans. This work proposes a novel solution for the point-cloud registration problem with a very low overlapping area between the two scans. In doing so, no initial relative positions of the point-clouds are assumed. Most of the state-of-the-art point-cloud registration approaches iteratively match keypoints in the scans, which is computationally expensive. In contrast to the traditional approaches, a more efficient line-features-based point-cloud registration approach is proposed in this work. This approach, besides reducing the computational cost, avoids the problem of high false-positive rate of existing keypoint detection algorithms, which becomes especially significant in low overlapping point-cloud registration. The effectiveness of the proposed approach is demonstrated with the help of experiments.

Sign in / Sign up

Export Citation Format

Share Document