Point-Set Registration: Coherent Point Drift

by   Andriy Myronenko, et al.

Point set registration is a key component in many computer vision tasks. The goal of point set registration is to assign correspondences between two sets of points and to recover the transformation that maps one point set to the other. Multiple factors, including an unknown non-rigid spatial transformation, large dimensionality of point set, noise and outliers, make the point set registration a challenging problem. We introduce a probabilistic method, called the Coherent Point Drift (CPD) algorithm, for both rigid and non-rigid point set registration. We consider the alignment of two point sets as a probability density estimation problem. We fit the GMM centroids (representing the first point set) to the data (the second point set) by maximizing the likelihood. We force the GMM centroids to move coherently as a group to preserve the topological structure of the point sets. In the rigid case, we impose the coherence constraint by re-parametrization of GMM centroid locations with rigid parameters and derive a closed form solution of the maximization step of the EM algorithm in arbitrary dimensions. In the non-rigid case, we impose the coherence constraint by regularizing the displacement field and using the variational calculus to derive the optimal transformation. We also introduce a fast algorithm that reduces the method computation complexity to linear. We test the CPD algorithm for both rigid and non-rigid transformations in the presence of noise, outliers and missing points, where CPD shows accurate results and outperforms current state-of-the-art methods.


page 10

page 11


The Coherent Point Drift for Clustered Point Sets

The problem of non-rigid point set registration is a key problem for man...

Partial Wasserstein Adversarial Network for Non-rigid Point Set Registration

Given two point sets, the problem of registration is to recover a transf...

3D non-rigid registration using color: Color Coherent Point Drift

Research into object deformations using computer vision techniques has b...

Fast and Globally Optimal Rigid Registration of 3D Point Sets by Transformation Decomposition

The rigid registration of two 3D point sets is a fundamental problem in ...

BARCHAN: Blob Alignment for Robust CHromatographic ANalysis

Comprehensive Two dimensional gas chromatography (GCxGC) plays a central...

DispVoxNets: Non-Rigid Point Set Alignment with Supervised Learning Proxies

We introduce a supervised-learning framework for non-rigid point set ali...

Coherent Point Drift Networks: Unsupervised Learning of Non-Rigid Point Set Registration

Given new pairs of source and target point sets, standard point set regi...

Please sign up or login with your details

Forgot password? Click here to reset