Automated Model-Based Finding of 3D Objects in Cluttered Construction Point Cloud Models

2017 ◽  
Vol 32 (11) ◽  
pp. 893-908 ◽  
Author(s):  
Mohammad-Mahdi Sharif ◽  
Mohammad Nahangi ◽  
Carl Haas ◽  
Jeffrey West
Keyword(s):  
Point Cloud ◽  
3D Objects ◽  
Model Based ◽  
Cloud Models

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 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 Point-Cloud Models of Historical Barns – Spatial Discrepancies of Laser Scanning versus Robotic Total Station

10.29007/2493 ◽  
2020 ◽  
Author(s):  
Gustavo Maldonado ◽  
Marcel Maghiar ◽  
Brent Tharp ◽  
Dhruv Patel
Keyword(s):  
Service Learning ◽  
Point Cloud ◽  
Laser Scanning ◽  
3D Point Cloud ◽  
Spatial Accuracy ◽  
Total Station ◽  
Cloud Models ◽  
Bulloch County ◽  
Southern University ◽  
Robotic Total Station

This study considers the generation of virtual, 3D point-cloud models of seven deteriorating historical, agricultural barns in Bulloch County, Georgia, USA, for preservation purposes. The work was completed as a service-learning project in a course on Terrestrial Light Detection and Ranging (T-LiDAR), offered at Georgia Southern University. The resulting models and fly-through videos were donated to Bulloch County Historical Society and to the Georgia Southern Museum, to make them available to the general public and future generations. Additionally, one of the seven barns was selected to be extensively measured to estimate the relative spatial accuracy of all seven resulting 3D point-cloud models, with respect to measurements completed with a highly accurate instrument. Three accurate benchmarks were established around it for georeferencing purposes. The positions of 44 points were measured in the field via an accurate, one- second, robotic total-station (RTS) instrument. Also, the coordinates of the same points were acquired from within georeferenced and non-georeferenced point-cloud models. These points defined 259 distances. They were compared to determine their discrepancy statistics. It was observed that this process produced virtual models with an approximate maximum spatial discrepancy of one-half inch (0.5 in) with respect to measurements performed by a highly accurate RTS device. There were no substantial differences in the relative accuracies of the georeferenced and non-georeferenced models.

Projected area measurement of complex 3D objects based on point cloud data

2021 ◽  
Author(s):  
Lujing Qian ◽  
Yubang Yang ◽  
Shuyu Sun ◽  
Tengchao Huang
Keyword(s):  
Point Cloud ◽  
Area Measurement ◽  
Point Cloud Data ◽  
Projected Area ◽  
Cloud Data ◽  
3D Objects

scholarly journals 3D Point Cloud Simplification Based on k-Nearest Neighbor and Clustering

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Abdelaaziz Mahdaoui ◽  
El Hassan Sbai
Keyword(s):  
Point Cloud ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
3D Point Cloud ◽  
K Nearest Neighbor ◽  
Test Dataset ◽  
New Approach ◽  
Entropy Estimation ◽  
3D Objects ◽  
Point Cloud Simplification

While the reconstruction of 3D objects is increasingly used today, the simplification of 3D point cloud, however, becomes a substantial phase in this process of reconstruction. This is due to the huge amounts of dense 3D point cloud produced by 3D scanning devices. In this paper, a new approach is proposed to simplify 3D point cloud based on k-nearest neighbor (k-NN) and clustering algorithm. Initially, 3D point cloud is divided into clusters using k-means algorithm. Then, an entropy estimation is performed for each cluster to remove the ones that have minimal entropy. In this paper, MATLAB is used to carry out the simulation, and the performance of our method is testified by test dataset. Numerous experiments demonstrate the effectiveness of the proposed simplification method of 3D point cloud.

Sign in / Sign up

Export Citation Format

Share Document