Fast Coherent Point Drift

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.

[1]  David S. Doermann,et al.  Robust point matching for nonrigid shapes by preserving local neighborhood structures , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Jitendra Malik,et al.  Recognizing Objects in Range Data Using Regional Point Descriptors , 2004, ECCV.

[3]  Sim Heng Ong,et al.  A robust global and local mixture distance based non-rigid point set registration , 2015, Pattern Recognit..

[4]  Yi Luo,et al.  Non-rigid point set registration using dual-feature finite mixture model and global-local structural preservation , 2018, Pattern Recognit..

[5]  Nico Blodow,et al.  Fast Point Feature Histograms (FPFH) for 3D registration , 2009, 2009 IEEE International Conference on Robotics and Automation.

[6]  Tom Drummond,et al.  Faster and Better: A Machine Learning Approach to Corner Detection , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Quan Z. Sheng,et al.  Nonrigid Point Set Registration With Robust Transformation Learning Under Manifold Regularization , 2019, IEEE Transactions on Neural Networks and Learning Systems.

[8]  Q. M. Jonathan Wu,et al.  Multiple Kernel Point Set Registration , 2016, IEEE Transactions on Medical Imaging.

[9]  Haibin Ling,et al.  Shape Classification Using the Inner-Distance , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Wenbing Tao,et al.  Robust Point Sets Matching by Fusing Feature and Spatial Information Using Nonuniform Gaussian Mixture Models , 2015, IEEE Transactions on Image Processing.

[11]  Andriy Myronenko,et al.  Point Set Registration: Coherent Point Drift , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Takeo Kanade,et al.  A Correlation-Based Approach to Robust Point Set Registration , 2004, ECCV.

[13]  Anand Rangarajan,et al.  A new point matching algorithm for non-rigid registration , 2003, Comput. Vis. Image Underst..

[14]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[15]  Guoliang Fan,et al.  Topology-aware non-rigid point set registration via global–local topology preservation , 2019, Machine Vision and Applications.

[16]  Gang Wang,et al.  A robust non-rigid point set registration method based on asymmetric gaussian representation , 2015, Comput. Vis. Image Underst..

[17]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[18]  Alexander M. Bronstein,et al.  Efficient Computation of Isometry-Invariant Distances Between Surfaces , 2006, SIAM J. Sci. Comput..

[19]  H. Chui,et al.  A feature registration framework using mixture models , 2000, Proceedings IEEE Workshop on Mathematical Methods in Biomedical Image Analysis. MMBIA-2000 (Cat. No.PR00737).

[20]  Gang Wang,et al.  Robust Non-Rigid Point Set Registration Using Spatially Constrained Gaussian Fields , 2017, IEEE Transactions on Image Processing.

[21]  Xianqiang Yang,et al.  Nonrigid Point Set Registration by Preserving Local Connectivity , 2018, IEEE Transactions on Cybernetics.

[22]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..