Robust Initial Matching of Free-Form Objects Represented by Point Clouds

Abstract

he problem of best matching two point cloud data sets or, mathematically, identifying the best rigid-body transformation matrix between them, arises in many application areas such as geometric inspection and object recognition. Traditional 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 new 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 the traditional iterative closest point method. Case studies have been performed to validate the effectiveness of the proposed initial matching scheme.

A Voronoi diagram based framework for fast and accurate evaluation of 2D free-form profile errors

“…36 Samuel and Shunmugam 37 proposed using the farthest-point Voronoi diagram to estimate circularity. OuYang et al 38 developed a coarse registration technique (for point clouds) based on the concept of Delaunay Pole Spheres (DPS). This DPS is based on the poles concept proposed by Amenta and Bern 39 for surface reconstruction.…”