Abstract—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple C energy function, which is convex in a large neighborhood of the alignment parameters; allowing for the use of powerful standard optimization techniques. We show that the size of the region of convergence can be significantly extended reducing the need for close initialization and overcoming local convergence problems of the standard Iterative Closest Point (ICP) algorithms. Furthermore, the Gaussian criterion can be evaluated with linear computational complexity using Fast Gauss Transform methods, allowing for an efficient implementation of the registration algorithm. Experimental analysi...
We present a population registration framework that acts on large collections or populations of data...
International audienceIn this paper, we introduce a novel and efficient approach to dense image regi...
Registration of 3D data, in order to obtain 3D models, has been an area where much research has be...
This paper introduces a new and simple criterion forrig# reg-ITzBAxU based on Gaussian #elds. The ...
The focus of this research is on building 3D representations of real world scenes and objects using ...
This paper introduces a new method of registering point sets. The registration error is directly min...
The aim of this thesis is to provide a robust and globally optimal method for rigid point set regist...
In this paper, we present a new method for non-linear pairwise registration of point sets. In this m...
The iterative closest point algorithm is one of the most effi-cient algorithms for robust rigid regi...
In this paper, a globally optimal algorithm based on a maximum feasible subsystem framework is propo...
egistration is the problem of bringing together two or more 3D shapes, either of the same object or ...
We present an algorithm for the automatic alignment of two 3D shapes (data and model), without any a...
We present a population registration framework that acts on large collections or populations of data...
This paper presents a method for automatically registering multiple rigid three dimensional (3D) dat...
We introduce a stochastic algorithm for pairwise affine registration of partially overlapping 3D poi...
We present a population registration framework that acts on large collections or populations of data...
International audienceIn this paper, we introduce a novel and efficient approach to dense image regi...
Registration of 3D data, in order to obtain 3D models, has been an area where much research has be...
This paper introduces a new and simple criterion forrig# reg-ITzBAxU based on Gaussian #elds. The ...
The focus of this research is on building 3D representations of real world scenes and objects using ...
This paper introduces a new method of registering point sets. The registration error is directly min...
The aim of this thesis is to provide a robust and globally optimal method for rigid point set regist...
In this paper, we present a new method for non-linear pairwise registration of point sets. In this m...
The iterative closest point algorithm is one of the most effi-cient algorithms for robust rigid regi...
In this paper, a globally optimal algorithm based on a maximum feasible subsystem framework is propo...
egistration is the problem of bringing together two or more 3D shapes, either of the same object or ...
We present an algorithm for the automatic alignment of two 3D shapes (data and model), without any a...
We present a population registration framework that acts on large collections or populations of data...
This paper presents a method for automatically registering multiple rigid three dimensional (3D) dat...
We introduce a stochastic algorithm for pairwise affine registration of partially overlapping 3D poi...
We present a population registration framework that acts on large collections or populations of data...
International audienceIn this paper, we introduce a novel and efficient approach to dense image regi...
Registration of 3D data, in order to obtain 3D models, has been an area where much research has be...