Fast Coherent Point Drift

by   Xiang-Wei Feng, et al.

Nonrigid point set registration is widely applied in the tasks of computer vision and pattern recognition. Coherent point drift (CPD) is a classical method for nonrigid point set registration. However, to solve spatial transformation functions, CPD has to compute inversion of a M*M matrix per iteration with time complexity O(M3). By introducing a simple corresponding constraint, we develop a fast implementation of CPD. The most advantage of our method is to avoid matrix-inverse operation. Before the iteration begins, our method requires to take eigenvalue decomposition of a M*M matrix once. After iteration begins, our method only needs to update a diagonal matrix with linear computational complexity, and perform matrix multiplication operation with time complexity approximately O(M2) in each iteration. Besides, our method can be further accelerated by the low-rank matrix approximation. Experimental results in 3D point cloud data show that our method can significantly reduce computation burden of the registration process, and keep comparable performance with CPD on accuracy.



page 17


LSG-CPD: Coherent Point Drift with Local Surface Geometry for Point Cloud Registration

Probabilistic point cloud registration methods are becoming more popular...

Fast generalized Bruhat decomposition

The deterministic recursive pivot-free algorithms for the computation of...

A sparse approximate inverse for triangular matrices based on Jacobi iteration

In this paper, we propose a sparse approximate inverse for triangular ma...

Acceleration of rank-constrained spatial covariance matrix estimation for blind speech extraction

In this paper, we propose new accelerated update rules for rank-constrai...

Barnes-Hut Approximation for Point SetGeodesic Shooting

Geodesic shooting has been successfully applied to diffeo-morphic regist...

Simple exponential acceleration of the power iteration algorithm

Many real-world problems rely on finding eigenvalues and eigenvectors of...

Multi-view Registration Based on Weighted Low Rank and Sparse Matrix Decomposition of Motions

Recently, the low rank and sparse (LRS) matrix decomposition has been in...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.