The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2010 vol.32)
pp: 2262-2275
Andriy Myronenko , Oregon Health and Science University, Beaverton
Xubo Song , Oregon Health and Science University, Beaverton
ABSTRACT
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 nonrigid 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 nonrigid point set registration. We consider the alignment of two point sets as a probability density estimation problem. We fit the Gaussian mixture model (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 reparameterization 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 nonrigid 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 nonrigid transformations in the presence of noise, outliers, and missing points, where CPD shows accurate results and outperforms current state-of-the-art methods.
INDEX TERMS
Registration, correspondence, matching, alignment, rigid, nonrigid, point sets, Coherent Point Drift (CPD), Gaussian mixture model (GMM), coherence, regularization, EM algorithm.
CITATION
Andriy Myronenko, Xubo Song, "Point Set Registration: Coherent Point Drift", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.32, no. 12, pp. 2262-2275, December 2010, doi:10.1109/TPAMI.2010.46
REFERENCES
[1] P.J. Besl and N.D. McKay, "A Method for Registration of 3-D Shapes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239-256, Feb. 1992.
[2] Z. Zhang, "Iterative Point Matching for Registration of Free-Form Curves and Surfaces," Int'l J. Computer Vision, vol. 13, no. 2, pp. 119-152, Oct. 1994.
[3] A.W. Fitzgibbon, "Robust Registration of 2D and 3D Point Sets," Image and Vision Computing, vol. 21, pp. 1145-1153, 2003.
[4] S. Rusinkiewicz and M. Levoy, "Efficient Variants of the ICP Algorithm," Proc. Int'l Conf. 3D Digital Imaging and Modeling, pp. 145-152, 2001.
[5] A. Rangarajan, H. Chui, E. Mjolsness, L. Davachi, P.S. Goldman-Rakic, and J.S. Duncan, "A Robust Point Matching Algorithm for Autoradiograph Alignment," Medical Image Analysis, vol. 1, no. 4, pp. 379-398, 1997.
[6] B. Luo and E.R. Hancock, "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1120-1136, Oct. 2001.
[7] S. Gold, C.P. Lu, A. Rangarajan, S. Pappu, and E. Mjolsness, "New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence," Proc. Advances in Neural Information Processing Systems, vol. 7, pp. 957-964, 1994.
[8] H. Chui and A. Rangarajan, "A New Point Matching Algorithm for Non-Rigid Registration," Computer Vision and Image Understanding, vol. 89, nos. 2/3, pp. 114-141, Feb. 2003.
[9] H. Chui and A. Rangarajan, "A Feature Registration Framework Using Mixture Models," Proc. IEEE Workshop Math. Methods in Biomedical Image Analysis, pp. 190-197, June 2000.
[10] A. Joshi and C.-H. Lee, "On the Problem of Correspondence in Range Data and Some Inelastic Uses for Elastic Nets," IEEE Trans. Neural Networks, vol. 6, no. 3, pp. 716-723, May 1995.
[11] W.M. Wells, "Statistical Approaches to Feature-Based Object Recognition," Int'l J. Computer Vision, vol. 22, nos. 1/2, pp. 63-98, Jan. 1997.
[12] A.D. Cross and E.R. Hancock, "Graph Matching with Dual Step EM Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 1, pp. 1236-1253, Jan. 1998.
[13] B. Luo and E.R. Hancock, "A Unified Framework for Alignment and Correspondence," Computer Vision and Image Understanding, vol. 92, no. 1, pp. 26-55, 2003.
[14] G. McNeill and S. Vijayakumar, "A Probabilistic Approach to Robust Shape Matching," Proc. IEEE Int'l Conf. Image Processing, pp. 937-940, 2006.
[15] G.L. Scott and C. Longuet-Higgins, "An Algorithm for Associating the Features of Two Images," Proc. Royal Soc. London: Biological Sciences, vol. 244, no. 1309, pp. 21-26, Apr. 1991.
[16] H. Li and R. Hartley, "A New and Compact Algorithm for Simultaneously Matching and Estimation," Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, 2004.
[17] J. Ho, M.H. Yang, A. Rangarajan, and B. Vemuri, "A New Affine Registration Algorithm for Matching 2D Point Sets," Proc. Eighth IEEE Workshop Applications of Computer Vision, p. 25, 2007.
[18] S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002.
[19] G.E. Hinton, C.K.I. Williams, and M.D. Revow, "Adaptive Elastic Models for Hand-Printed Character Recognition," Proc. Advances in Neural Information Processing Systems, vol. 4, pp. 512-519, 1992.
[20] M. Revow, C.K.I. Williams, and G.E. Hinton, "Using Generative Models for Handwritten Digit Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 6, pp. 592-606, June 1996.
[21] G. Wahba, Spline Models for Observational Data. SIAM, 1990.
[22] F.L. Bookstein, "Principal Warps: Thin-Plate Splines and the Decomposition of Deformations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 6, pp. 567-585, June 1989.
[23] Y. Tsin and T. Kanade, "A Correlation-Based Approach to Robust Point Set Registration," Proc. Eighth European Conf. Computer Vision, vol. 3, pp. 558-569, 2004.
[24] B. Jian and B.C. Vemuri, "A Robust Algorithm for Point Set Registration Using Mixture of Gaussians," Proc. 10th IEEE Int'l Conf. Computer Vision, vol. 2, pp. 1246-1251, Oct. 2005.
[25] X. Huang, N. Paragios, and D.N. Metaxas, "Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 8, pp. 1303-1318, Aug. 2006.
[26] A. Myronenko, X. Song, and M.Á. Carreira-Perpiñán, "Non-Rigid Point Set Registration: Coherent Point Drift," Proc. Advances in Neural Information Processing Systems, pp. 1009-1016, 2007.
[27] A.L. Yuille and N.M. Grzywacz, "The Motion Coherence Theory," Proc. IEEE Int'l Conf. Computer Vision, vol. 3, pp. 344-353, 1988.
[28] A.L. Yuille and N.M. Grzywacz, "A Mathematical Analysis of the Motion Coherence Theory," Int'l J. Computer Vision, vol. 3, no. 2, pp. 155-175, June 1989.
[29] A. Dempster, N. Laird, and D. Rubin, "Maximum Likelihood From Incomplete Data via the EM Algorithm," J. Royal Statistical Soc. Series B (Methodological), vol. 39, no. 1, pp. 1-38, 1977.
[30] C.M. Bishop, Neural Networks for Pattern Recognition. Oxford Univ. Press, 1995.
[31] K. Arun, T.S. Huang, and S.D. Blostein, "Least-Squares Fitting of Two 3-D Point Sets," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 5, pp. 698-700, Sept. 1987.
[32] S. Umeyama, "Least-Squares Estimation of Transformation Parameters Between Two Point Patterns," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 4, pp. 376-380, Apr. 1991.
[33] A. Myronenko and X. Song, "On the Closed-Form Solution of the Rotation Matrix Arising in Computer Vision Problems," Technical Report arXiv:0904.1613v1, Oregon Health and Science Univ., 2009.
[34] B. Luo and E.R. Hancock, "Iterative Procrustes Alignment with the EM Algorithm," Image and Vision Computing, vol. 20, nos. 5/6, pp. 377-396, Apr. 2002.
[35] A.N. Tikhonov and V.I. Arsenin, Solutions of Ill-Posed Problems. Winston and Sons, 1977.
[36] Z. Chen and S. Haykin, "On Different Facets of Regularization Theory," Neural Computation, vol. 14, no. 12, pp. 2791-2846, 2002.
[37] B. Schölkopf and A.J. Smola, Learning with Kernels. MIT Press, 2002.
[38] F. Girosi, M. Jones, and T. Poggio, "Regularization Theory and Neural Networks Architectures," Neural Computation, vol. 7, no. 2, pp. 219-269, 1995.
[39] G. Kimeldorf and G. Wahba, "Some Results on Tchebycheffian Spline Functions," J. Math. Analysis and Applications, vol. 33, no. 1, pp. 82-95, 1971.
[40] R.M. Neal and G.E. Hinton, "A View of the EM Algorithm that Justifies Incremental, Sparse, and Other Variants," Learning in Graphical Models, M.I. Jordan, ed., Kluwer Academic Publishers, 1998.
[41] J. Duchon, "Splines Minimizing Rotation-Invariant Semi-Norms in Sobolev Spaces," Constructive Theory of Functions of Several Variables, vol. 571, pp. 85-100, Springer, 1977.
[42] R. Sibson and G. Stone, "Computation of Thin-Plate Splines," SIAM J. Scientific and Statistical Computing, vol. 12, no. 6, pp. 1304-1313, Nov. 1991.
[43] L. Greengard and J. Strain, "The Fast Gauss Transform," SIAM J. Scientific and Statistical Computing, vol. 12, no. 1, pp. 79-94, 1991.
[44] C. Yang, R. Duraiswami, N.A. Gumerov, and L. Davis, "Improved FGT and Efficient Kernel Density Estimation," Proc. Ninth IEEE Int'l Conf. Computer Vision, p. 464, 2003.
[45] G.H. Golub and C.F.V. Loan, Matrix Computations, second ed. Johns Hopkins Univ. Press, 1989.
[46] J.K. Cullum and R.A. Willoughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, vol. 1. Cambridge, 2002.
[47] S. Paris, "Research Web Page," www.lsis.orgfiche.php?nom= sebastien_paris , 2009.
[48] "The Stanford 3D Scanning Repository," http://graphics.stanford. edu/data3Dscanrep /, 2010.
[49] A. Myronenko, X. Song, and D.J. Sahn, "LV Motion Tracking from 3D Echocardiography Using Textural and Structural Information," Proc. Int'l Conf. Medical Image Computing and Computer Assisted Intervention, vol. 4792, pp. 428-435, Oct. 2007.
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool