Robotic grinding is considered as an alternative towards the efficient and intelligent
machining of complex components by virtue of its flexibility, intelligence and cost efficiency …

Non‐rigid registration computes an alignment between a source surface with a target
surface in a non‐rigid manner. In the past decade, with the advances in 3D sensing …

The iterative closest point (ICP) algorithm and its variants are a fundamental technique for
rigid registration between two point sets, with wide applications in different areas from …

Deformable image registration is a fundamental task in medical image processing. Among
its most important applications, one may cite: 1) multi-modality fusion, where information …

Three-dimensional surface registration transforms multiple three-dimensional data sets into
the same coordinate system so as to align overlapping components of these sets. Recent …

Rigid registration of two geometric data sets is essential in many applications, including
robot navigation, surface reconstruction, and shape matching. Most commonly, variants of …

The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process
of accurate registration of 3D point cloud data. The algorithm requires a proper initial value …

This paper describes PLICP, an ICP (iterative closest/corresponding point) variant that uses
a point-to-line metric, and an exact closed-form for minimizing such metric. The resulting …

The Iterative Closest Point (ICP) algorithm, commonly used for alignment of 3D models, has
previously been defined using either a point-to-point or point-to-plane objective …

We propose a method to automatically register two point clouds acquired with a terrestrial
laser scanner without placing any markers in the scene. What makes this task challenging …