Massive Point Cloud Data Sets and Single Point Measurement Acquisition in the Production Floor Environment

2001 ◽  
Author(s):  
Eyal Mizrahi ◽  
Ron Gershon ◽  
Meny Benady
Electronics ◽  
2022 ◽  
Vol 11 (2) ◽  
pp. 263
Author(s):  
Munan Yuan ◽  
Xiru Li ◽  
Longle Cheng ◽  
Xiaofeng Li ◽  
Haibo Tan

Alignment is a critical aspect of point cloud data (PCD) processing, and we propose a coarse-to-fine registration method based on bipartite graph matching in this paper. After data pre-processing, the registration progress can be detailed as follows: Firstly, a top-tail (TT) strategy is designed to normalize and estimate the scale factor of two given PCD sets, which can combine with the coarse alignment process flexibly. Secondly, we utilize the 3D scale-invariant feature transform (3D SIFT) method to extract point features and adopt fast point feature histograms (FPFH) to describe corresponding feature points simultaneously. Thirdly, we construct a similarity weight matrix of the source and target point data sets with bipartite graph structure. Moreover, the similarity weight threshold is used to reject some bipartite graph matching error-point pairs, which determines the dependencies of two data sets and completes the coarse alignment process. Finally, we introduce the trimmed iterative closest point (TrICP) algorithm to perform fine registration. A series of extensive experiments have been conducted to validate that, compared with other algorithms based on ICP and several representative coarse-to-fine alignment methods, the registration accuracy and efficiency of our method are more stable and robust in various scenes and are especially more applicable with scale factors.


2013 ◽  
Vol 34 (22) ◽  
pp. 8215-8234 ◽  
Author(s):  
Andrea Vaccari ◽  
Michael Stuecheli ◽  
Brian Bruckno ◽  
Edward Hoppe ◽  
Scott T. Acton

Acta Numerica ◽  
2014 ◽  
Vol 23 ◽  
pp. 289-368 ◽  
Author(s):  
Gunnar Carlsson

In this paper we discuss the adaptation of the methods of homology from algebraic topology to the problem of pattern recognition in point cloud data sets. The method is referred to aspersistent homology, and has numerous applications to scientific problems. We discuss the definition and computation of homology in the standard setting of simplicial complexes and topological spaces, then show how one can obtain useful signatures, called barcodes, from finite metric spaces, thought of as sampled from a continuous object. We present several different cases where persistent homology is used, to illustrate the different ways in which the method can be applied.


Author(s):  
Hsi-Yung Steve Feng ◽  
Daoshan OuYang ◽  
Nimun A. Jahangir ◽  
Hao Song

The problem of matching two point cloud data sets, or identifying the correct rigid-body transformation between them, arises in various areas such as manufacturing inspection and object recognition. Existing methods establish the correspondence between the two data sets via the measure of shortest Euclidean distance and rely on an iterative procedure to converge to the solution. The effectiveness of such methods is highly dependent on the initial condition for the numerical iteration. This paper proposes a robust scheme to automatically generate the needed initial matching condition. The initial matching scheme undertakes the alignment in a global manner and yields a rough match of the data sets. Instead of directly minimizing the distance measure between the data sets, the focus of the initial matching is on the alignment of shape features. This is achieved by evaluating Delaunay pole spheres for the point cloud data sets and analyzing their distributions to map out the intrinsic features of the underlying surface shape. The initial matching result is then fine-tuned by the final matching step via existing methods such as the iterative closest point method. Extensive case studies have shown that the proposed initial matching scheme is able to significantly improve the matching accuracy.


Author(s):  
M. Bassier ◽  
L. Mattheuwsen ◽  
M. Vergauwen

Abstract. The reconstruction of Building Information Modeling objects for as-built modeling is currently the subject of ongoing research. A popular method is to extract structure information from point cloud data to create a set of parametric objects. This requires the interpretation of the point cloud data which currently is a manual and labor intensive procedure. Automated processes have to cope with excessive occlusions and clutter in the data sets. To create an as-built BIM, it is vital to reconstruct the building’s structure i.e. wall geometry prior to the reconstruction of other objects.In this work, a novel method is presented to automatically reconstruct as-built BIM for generic buildings. We presented an unsupervised method that procedurally models the geometry of the walls based on point cloud data. A bottom-up process is defined where consecutively higher level information is extracted from the point cloud data using pre-trained machine learning models. Prior to the reconstruction, the data is segmented, classified and clustered to retrieve all the available observations of the walls. The resulting geometry is processed by the reconstruction algorithm. First, the necessary information is extracted from the observations for the creation of parametric solid objects. Subsequently, the final walls are created by updating their topology. The method is tested on a variety of scenes and shows promising results to reliably and accurately create as-built models. The accuracy of the generated geometry is similar to the precision of expert modelers. A key advantage is that that the algorithm creates Revit and Rhino native objects which makes the geometry directly applicable to a wide range of applications.


Sign in / Sign up

Export Citation Format

Share Document