nips nips2006 nips2006-147 nips2006-147-reference knowledge-graph by maker-knowledge-mining

147 nips-2006-Non-rigid point set registration: Coherent Point Drift


Source: pdf

Author: Andriy Myronenko, Xubo Song, Miguel Á. Carreira-Perpiñán

Abstract: We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation problem with motion coherence constraint over the velocity field such that one point set moves coherently to align with the second set. We formulate the motion coherence constraint and derive a solution of regularized ML estimation through the variational approach, which leads to an elegant kernel form. We also derive the EM algorithm for the penalized ML optimization with deterministic annealing. The CPD method simultaneously finds both the non-rigid transformation and the correspondence between two point sets without making any prior assumption of the transformation model except that of motion coherence. This method can estimate complex non-linear non-rigid transformations, and is shown to be accurate on 2D and 3D examples and robust in the presence of outliers and missing points.


reference text

[1] G.L. Scott and H.C. Longuet-Higgins. An algorithm for associating the features of two images. Royal Society London Proc., B-244:21–26, 1991.

[2] P.J. Besl and N. D. McKay. A method for registration of 3-d shapes. IEEE Trans. Pattern Anal. Mach. Intell., 14(2):239–256, 1992.

[3] S. Rusinkiewicz and M. Levoy. Efficient variants of the ICP algorithm. Third International Conference on 3D Digital Imaging and Modeling, page 145, 2001.

[4] H Chui and A. Rangarajan. A new algorithm for non-rigid point matching. CVPR, 2:44–51, 2000.

[5] H. Chui and A. Rangarajan. A feature registration framework using mixture models. IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA), pages 190–197, 2000.

[6] F. L. Bookstein. Principal warps: Thin-plate splines and the decomposition of deformations. IEEE Trans. Pattern Anal. Mach. Intell., 11(6):567–585, 1989.

[7] R Sibson and G. Stone. Comp. of thin-plate splines. SIAM J. Sci. Stat. Comput., 12(6):1304–1313, 1991.

[8] Y. Tsin and T. Kanade. A correlation-based approach to robust point set registration. ECCV, 3:558–569, 2004.

[9] B. Jian and B.C. Vemuri. A robust algorithm for point set registration using mixture of gaussians. ICCV, pages 1246–1251, 2005.

[10] A.L. Yuille and N.M. Grzywacz. The motion coherence theory. Int. J. Computer Vision, 3:344–353, 1988. ´

[11] M. A. Carreira-Perpi˜ an, P. Dayan, and G. J. Goodhill. Differential priors for elastic nets. In Proc. of the n´ 6th Int. Conf. Intelligent Data Engineering and Automated Learning (IDEAL’05), pages 335–342, 2005. ´

[12] A. Myronenko, X Song, and M. A. Carreira-Perpi˜ an. Non-parametric image registration using generaln´ ized elastic nets. Int. Workshop on Math. Foundations of Comp. Anatomy: Geom. and Stat. Methods in Non-Linear Image Registration, MICCAI, pages 156–163, 2006.

[13] F. Girosi, M. Jones, and T. Poggio. Regularization theory and neural networks architectures. Neural Computation, 7(2):219–269, 1995.

[14] C. M. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, 1995.