scholarly journals AN IMPROVED COHERENT POINT DRIFT METHOD FOR TLS POINT CLOUD REGISTRATION OF COMPLEX SCENES

Author(s):  
Y. Zang ◽  
R. C. Lindenbergh

<p><strong>Abstract.</strong> Processing unorganized 3D point clouds is highly desirable, especially for the applications in complex scenes (such as: mountainous or vegetation areas). Registration is the precondition to obtain complete surface information of complex scenes. However, for complex environment, the automatic registration of TLS point clouds is still a challenging problem. In this research, we propose an automatic registration for TLS point clouds of complex scenes based on coherent point drift (CPD) algorithm combined with a robust covariance descriptor. Out method consists of three steps: the construction of the covariance descriptor, uniform sampling of point clouds, and CPD optimization procedures based on Expectation-Maximization (EM algorithm). In the first step, we calculate a feature vector to construct a covariance matrix for each point based on the estimated normal vectors. In the subsequent step, to ensure efficiency, we use uniform sampling to obtain a small point set from the original TLS data. Finally, we form an objective function combining the geometric information described by the proposed descriptor, and optimize the transformation iteratively by maximizing the likelihood function. The experimental results on the TLS datasets of various scenes demonstrate the reliability and efficiency of the proposed method. Especially for complex environments with disordered vegetation or point density variations, this method can be much more efficient than original CPD algorithm.</p>

2014 ◽  
Vol 571-572 ◽  
pp. 729-734
Author(s):  
Jia Li ◽  
Huan Lin ◽  
Duo Qiang Zhang ◽  
Xiao Lu Xue

Normal vector of 3D surface is important differential geometric property over localized neighborhood, and its abrupt change along the surface directly reflects the variation of geometric morphometric. Based on this observation, this paper presents a novel edge detection algorithm in 3D point clouds, which utilizes the change intensity and change direction of adjacent normal vectors and is composed of three steps. First, a two-dimensional grid is constructed according to the inherent data acquisition sequence so as to build up the topology of points. Second, by this topological structure preliminary edge points are retrieved, and the potential directions of edges passing through them are estimated according to the change of normal vectors between adjacent points. Finally, an edge growth strategy is designed to regain the missing edge points and connect them into complete edge lines. The results of experiment in a real scene demonstrate that the proposed algorithm can extract geometric edges from 3D point clouds robustly, and is able to reduce edge quality’s dependence on user defined parameters.


Author(s):  
W. Nguatem ◽  
M. Drauschke ◽  
H. Mayer

In this paper, we present a fully automatic approach to localize the outlines of facade objects (windows and doors) in 3D point clouds of facades. We introduce an approach to search for the main facade wall and locate the facade objects within a probabilistic framework. Our search routine is based on Monte Carlo Simulation (MC-Simulation). Templates containing control points of curves are used to approximate the possible shapes of windows and doors. These are interpolated using parametric B-spline curves. These templates are scored in a sliding window style over the entire facade using a likelihood function in a probabilistic matching procedure. This produces many competing results for which a two layered model selection based on Bayes factor is applied. A major thrust in our work is the introduction of a 2D shape-space of similar shapes under affine transform in this architectural scene. This transforms the initial parametric B-splines curves representing the outlines of objects to curves of affine similarity in a strongly reduced dimensionality thus facilitating the generation of competing hypotheses within the search space. A further computational speedup is achieved through the clustering of the search space to disjoint regions, thus enabling a parallel implementation. We obtain state-of-the results on self-acquired data sets. The robustness of our algorithm is evaluated on 3D point clouds from image matching and LiDAR data of diverse quality.


2018 ◽  
Vol 89 ◽  
pp. 120-134 ◽  
Author(s):  
Martín Bueno ◽  
Frédéric Bosché ◽  
Higinio González-Jorge ◽  
Joaquín Martínez-Sánchez ◽  
Pedro Arias

2015 ◽  
Author(s):  
Sunghan Kim ◽  
Mingyu Kim ◽  
Jeongtae Lee ◽  
Jinhwi Pyo ◽  
Heeyoung Heo ◽  
...  

In this paper, a software system for registration of point clouds is developed. The system consists of two modules for registration and user interaction. The registration module contains functions for manual and automatic registration. The manual method allows a user to select feature points or planes from the point clouds manually. The selected planes or features are then processed to establish the correspondence between the point clouds, and registration is performed to obtain one large point cloud. The automatic registration uses sphere targets. Sphere targets are attached to an object of interest. A scanner measures the object as well as the targets to produce point clouds, from which the targets are extracted using shape intrinsic properties. Then correspondence between the point clouds is obtained using the targets, and the registration is performed. The user interaction module provides a GUI environment which allows a user to navigate point clouds, to compute various features, to visualize point clouds and to select/unselect points interactively and the point-processing unit containing functions for filtering, estimation of geometric features, and various data structures for managing point clouds of large size. The developed system is tested with actual measurement data of various blocks in a shipyard.


Sign in / Sign up

Export Citation Format

Share Document