Full automation of the registration of 3D scan data is, in general, still an unsolved problem. If supplementary data is provided, either by human assistance, or by additional devices, the registration process can be completed. We have analyzed under which conditions supplementary data is required, where the conditions are specified as subsets of configuration space. As a matching tool an ICP-based (iterative closest point) algorithm was deployed. A point in configuration space represents the amount of translation and rotation needed to obtain a match between 3D scans of two partial overlapping surfaces. As a function of the coordinates in configuration space, we determine the successfulness of the algorithm and hence whether additiona...
To advance robotic science it is important to perform experiments that can be replicated by other re...
Abstract — This paper addresses the scan matching problem in three dimensional workspaces. The novel...
Automatic range image registration and matching is an attractive but unresolved problem in both the ...
Full automation of the registration of 3D scan data is, in general, still an unsolved problem. If su...
The iterative closest point algorithm is one of the most effi-cient algorithms for robust rigid regi...
The iterative closest point (ICP) algorithm is an efficient algorithm for robust rigid registration ...
Given that 3D scan matching is such a central part of the perception pipeline for robots, thorough a...
egistration is the problem of bringing together two or more 3D shapes, either of the same object or ...
This paper presents a method for automatically registering multiple rigid three dimensional (3D) dat...
Abstract — This paper presents a method for pairwise 3D alignment which solves data association by m...
AbstractThe registration of multi-view point sets is often used in surface reconstruction for comple...
Recently, progress has been made in restoring the accurate 3D shapes of objects in the real world us...
This paper describes a method for determining an object's pose given its 3D model and a 2D view...
The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accu...
Abstract — To advance robotic science it is important to per-form experiments that can be replicated...
To advance robotic science it is important to perform experiments that can be replicated by other re...
Abstract — This paper addresses the scan matching problem in three dimensional workspaces. The novel...
Automatic range image registration and matching is an attractive but unresolved problem in both the ...
Full automation of the registration of 3D scan data is, in general, still an unsolved problem. If su...
The iterative closest point algorithm is one of the most effi-cient algorithms for robust rigid regi...
The iterative closest point (ICP) algorithm is an efficient algorithm for robust rigid registration ...
Given that 3D scan matching is such a central part of the perception pipeline for robots, thorough a...
egistration is the problem of bringing together two or more 3D shapes, either of the same object or ...
This paper presents a method for automatically registering multiple rigid three dimensional (3D) dat...
Abstract — This paper presents a method for pairwise 3D alignment which solves data association by m...
AbstractThe registration of multi-view point sets is often used in surface reconstruction for comple...
Recently, progress has been made in restoring the accurate 3D shapes of objects in the real world us...
This paper describes a method for determining an object's pose given its 3D model and a 2D view...
The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accu...
Abstract — To advance robotic science it is important to per-form experiments that can be replicated...
To advance robotic science it is important to perform experiments that can be replicated by other re...
Abstract — This paper addresses the scan matching problem in three dimensional workspaces. The novel...
Automatic range image registration and matching is an attractive but unresolved problem in both the ...