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.

Algorithms for 3D Map Segment Registration

2011 ◽  
pp. 56-86
Author(s):  
Hao Men ◽  
Kishore Pochiraju
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Vantage Point ◽  
Coordinate Frame ◽  
Multiple Point ◽  
Color Information ◽  
Icp Algorithm ◽  
Map Generation ◽  
Map Registration ◽  
And Performance

Many applications require dimensionally accurate and detailed maps of the environment. Mobile mapping devices with laser ranging devices can generate highly detailed and dimensionally accurate coordinate data in the form of point clouds. Point clouds represent scenes with numerous discrete coordinate samples obtained about a relative reference frame defined by the location and orientation of the sensor. Color information from the environment obtained from cameras can be mapped to the coordinates to generate color point clouds. Point clouds obtained from a single static vantage point are generally incomplete because neither coordinate nor color information exists in occluded areas. Changing the vantage point implies movement of the coordinate frame and the need for sensor position and orientation information. Merging multiple point cloud segments generated from different vantage points using features of the scene enables construction of 3D maps of large areas and filling in gaps left from occlusions. Map registration algorithms identify areas with common features in overlapping point clouds and determine optimal coordinate transformations that can register or merge one point cloud into another point cloud’s coordinate system. Algorithms can also match the attributes other than coordinates, such as optical reflection intensity and color properties, for more efficient common point identification. The extra attributes help resolve ambiguities, reduce the time, and increase precision for point cloud registration. This chapter describes a comprehensive parametric study on the performance of a specialized Iterative Closest Point (ICP) algorithm that uses color information. This Hue-assisted ICP algorithm, a variant developed by the authors, registers point clouds in a 4D (x, y, z, hue) space. A mobile robot with integrated 3D sensor generated color point cloud used for verification and performance measurement of various map registration techniques. The chapter also identifies various algorithms required to accomplish complete map generation using mobile robots.

Algorithms for 3D Map Segment Registration

2013 ◽  
pp. 502-528
Author(s):  
Hao Men ◽  
Kishore Pochiraju
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Vantage Point ◽  
Coordinate Frame ◽  
Multiple Point ◽  
Color Information ◽  
Icp Algorithm ◽  
Map Generation ◽  
Map Registration ◽  
And Performance

Many applications require dimensionally accurate and detailed maps of the environment. Mobile mapping devices with laser ranging devices can generate highly detailed and dimensionally accurate coordinate data in the form of point clouds. Point clouds represent scenes with numerous discrete coordinate samples obtained about a relative reference frame defined by the location and orientation of the sensor. Color information from the environment obtained from cameras can be mapped to the coordinates to generate color point clouds. Point clouds obtained from a single static vantage point are generally incomplete because neither coordinate nor color information exists in occluded areas. Changing the vantage point implies movement of the coordinate frame and the need for sensor position and orientation information. Merging multiple point cloud segments generated from different vantage points using features of the scene enables construction of 3D maps of large areas and filling in gaps left from occlusions. Map registration algorithms identify areas with common features in overlapping point clouds and determine optimal coordinate transformations that can register or merge one point cloud into another point cloud’s coordinate system. Algorithms can also match the attributes other than coordinates, such as optical reflection intensity and color properties, for more efficient common point identification. The extra attributes help resolve ambiguities, reduce the time, and increase precision for point cloud registration. This chapter describes a comprehensive parametric study on the performance of a specialized Iterative Closest Point (ICP) algorithm that uses color information. This Hue-assisted ICP algorithm, a variant developed by the authors, registers point clouds in a 4D (x, y, z, hue) space. A mobile robot with integrated 3D sensor generated color point cloud used for verification and performance measurement of various map registration techniques. The chapter also identifies various algorithms required to accomplish complete map generation using mobile robots.

scholarly journals VISUALIZATION OF POINT CLOUD MODELS IN MOBILE AUGMENTED REALITY USING CONTINUOUS LEVEL OF DETAIL METHOD

2020 ◽  
Vol XLIV-4/W1-2020 ◽  
pp. 167-170
Author(s):  
L. Zhang ◽  
P. van Oosterom ◽  
H. Liu
Keyword(s):  
Augmented Reality ◽  
Point Cloud ◽  
Cloud Model ◽  
Point Clouds ◽  
Level Of Detail ◽  
Mobile Augmented Reality ◽  
Cloud Models ◽  
Point Cloud Model ◽  
Visual Artifacts ◽  
Mobile Ar

Abstract. Point clouds have become one of the most popular sources of data in geospatial fields due to their availability and flexibility. However, because of the large amount of data and the limited resources of mobile devices, the use of point clouds in mobile Augmented Reality applications is still quite limited. Many current mobile AR applications of point clouds lack fluent interactions with users. In our paper, a cLoD (continuous level-of-detail) method is introduced to filter the number of points to be rendered considerably, together with an adaptive point size rendering strategy, thus improve the rendering performance and remove visual artifacts of mobile AR point cloud applications. Our method uses a cLoD model that has an ideal distribution over LoDs, with which can remove unnecessary points without sudden changes in density as present in the commonly used discrete level-of-detail approaches. Besides, camera position, orientation and distance from the camera to point cloud model is taken into consideration as well. With our method, good interactive visualization of point clouds can be realized in the mobile AR environment, with both nice visual quality and proper resource consumption.

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>

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 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.

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.

scholarly journals Hue-assisted automatic registration of color point clouds

2014 ◽  
Vol 1 (4) ◽  
pp. 223-232 ◽  
Author(s):  
Hao Men ◽  
Kishore Pochiraju
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Local Geometry ◽  
Automatic Registration ◽  
Color Information ◽  
Registration Accuracy ◽  
Surface Color ◽  
Registration Algorithm ◽  
Sample Density ◽  
Occupancy Grids

Abstract This paper describes a variant of the extended Gaussian image based registration algorithm for point clouds with surface color information. The method correlates the distributions of surface normals for rotational alignment and grid occupancy for translational alignment with hue filters applied during the construction of surface normal histograms and occupancy grids. In this method, the size of the point cloud is reduced with a hue-based down sampling that is independent of the point sample density or local geometry. Experimental results show that use of the hue filters increases the registration speed and improves the registration accuracy. Coarse rigid transformations determined in this step enable fine alignment with dense, unfiltered point clouds or using Iterative Common Point (ICP) alignment techniques.

scholarly journals COMPARISON OF UAS-BASED PHOTOGRAMMETRY SOFTWARE FOR 3D POINT CLOUD GENERATION: A SURVEY OVER A HISTORICAL SITE

2017 ◽  
Vol IV-4/W4 ◽  
pp. 55-61 ◽  
Author(s):  
F. Alidoost ◽  
H. Arefi
Keyword(s):  
Point Cloud ◽  
Accuracy Assessment ◽  
Point Clouds ◽  
Surface Model ◽  
Geospatial Information ◽  
Software Packages ◽  
Comparison Results ◽  
3D City Modelling ◽  
Time Acquisition

Nowadays, Unmanned Aerial System (UAS)-based photogrammetry offers an affordable, fast and effective approach to real-time acquisition of high resolution geospatial information and automatic 3D modelling of objects for numerous applications such as topography mapping, 3D city modelling, orthophoto generation, and cultural heritages preservation. In this paper, the capability of four different state-of-the-art software packages as 3DSurvey, Agisoft Photoscan, Pix4Dmapper Pro and SURE is examined to generate high density point cloud as well as a Digital Surface Model (DSM) over a historical site. The main steps of this study are including: image acquisition, point cloud generation, and accuracy assessment. The overlapping images are first captured using a quadcopter and next are processed by different software to generate point clouds and DSMs. In order to evaluate the accuracy and quality of point clouds and DSMs, both visual and geometric assessments are carry out and the comparison results are reported.

scholarly journals Methodology for remote assessment of pavement distresses from point cloud analysis

2021 ◽  
Author(s):  
Ernest Berney ◽  
Naveen Ganesh ◽  
Andrew Ward ◽  
J. Newman ◽  
John Rushing
Keyword(s):  
Point Cloud ◽  
Surface Condition ◽  
Three Dimensional ◽  
Point Clouds ◽  
Pavement Surface ◽  
Cloud Models ◽  
Rapid Generation ◽  
Point To Point ◽  
Point Cloud Analysis ◽  
Cloud Analysis

The ability to remotely assess road and airfield pavement condition is critical to dynamic basing, contingency deployment, convoy entry and sustainment, and post-attack reconnaissance. Current Army processes to evaluate surface condition are time-consuming and require Soldier presence. Recent developments in the area of photogrammetry and light detection and ranging (LiDAR) enable rapid generation of three-dimensional point cloud models of the pavement surface. Point clouds were generated from data collected on a series of asphalt, concrete, and unsurfaced pavements using ground- and aerial-based sensors. ERDC-developed algorithms automatically discretize the pavement surface into cross- and grid-based sections to identify physical surface distresses such as depressions, ruts, and cracks. Depressions can be sized from the point-to-point distances bounding each depression, and surface roughness is determined based on the point heights along a given cross section. Noted distresses are exported to a distress map file containing only the distress points and their locations for later visualization and quality control along with classification and quantification. Further research and automation into point cloud analysis is ongoing with the goal of enabling Soldiers with limited training the capability to rapidly assess pavement surface condition from a remote platform.

Sign in / Sign up

Export Citation Format

Share Document