The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Point Set Registration: Coherent Point Drift
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
Spline Models for Observational Data.
Muller, H.-G., & Wahba, G. (1991) · Journal of the American Statistical Association · doi:10.2307/2290434 · Cited by 4,928
Principal warps: thin-plate splines and the decomposition of deformations
Bookstein, F. L. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.24792 · Cited by 4,913
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
Least-Squares Fitting of Two 3-D Point Sets
Arun, K. S., Huang, T. S., & Blostein, S. D. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767965 · Cited by 3,952
Efficient variants of the ICP algorithm
Rusinkiewicz, S., & Levoy, M. (2002) · Proceedings Third International Conference on 3-D Digital Imaging and Modeling · doi:10.1109/im.2001.924423 · Cited by 3,945
Least-squares estimation of transformation parameters between two point patterns
Umeyama, S. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.88573 · Cited by 2,420
(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
Iterative point matching for registration of free-form curves and surfaces
Zhang, Z. (1994) · International Journal of Computer Vision · doi:10.1007/bf01427149 · Cited by 2,402
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
A new point matching algorithm for non-rigid registration
Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560
Splines minimizing rotation-invariant semi-norms in Sobolev spaces
Duchon, J. (1977) · Lecture Notes in Mathematics · doi:10.1007/bfb0086566 · Cited by 1,380
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Vol. I: Theory
Cullum, J. K., & Willoughby, R. A. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719192 · Cited by 1,291
Some results on Tchebycheffian spline functions
Kimeldorf, G., & Wahba, G. (1971) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(71)90184-3 · Cited by 1,254
Robust registration of 2D and 3D point sets
Fitzgibbon, A. W. (2003) · Image and Vision Computing · doi:10.1016/j.imavis.2003.09.004 · Cited by 925
New algorithms for 2D and 3D point matching
Gold, S., Rangarajan, A., Lu, C.-P., Pappu, S., & Mjolsness, E. (1998) · Pattern Recognition · doi:10.1016/s0031-3203(98)80010-1 · Cited by 580
Greengard, L., & Strain, J. (1991) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0912004 · Cited by 491
An algorithm for associating the features of two images
(1991) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1991.0045 · Cited by 440
A new algorithm for non-rigid point matching
Chui, H., & Rangarajan, A. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.854733 · Cited by 440
A Correlation-Based Approach to Robust Point Set Registration
Tsin, Y., & Kanade, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_44 · Cited by 416
Improved fast gauss transform and efficient kernel density estimation
Yang, Duraiswami, Gumerov, & Davis (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238383 · Cited by 399
A robust algorithm for point set registration using mixture of Gaussians
Jian, B., & Vemuri, B. C. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.17 · Cited by 354
Structural graph matching using the EM algorithm and singular value decomposition
Luo, B., & Hancock, E. R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954602 · Cited by 345
Non-rigid point set registration: Coherent Point Drift
Myronenko, A., Song, X., & Carreira-Perpiñán, M. Á. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0131 · Cited by 339
Self-citationGraph matching with a dual-step EM algorithm
Cross, A. D. J., & Hancock, E. R. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.730557 · Cited by 216
Shape registration in implicit spaces using information theory and free form deformations
Huang, X., Paragios, N., & Metaxas, D. N. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.171 · Cited by 204
A mathematical analysis of the motion coherence theory
Yuille, A. L., & Grzywacz, N. M. (1989) · International Journal of Computer Vision · doi:10.1007/bf00126430 · Cited by 190
Using generative models for handwritten digit recognition
Revow, M., Williams, C. K. I., & Hinton, G. E. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.506410 · Cited by 190
A robust point-matching algorithm for autoradiograph alignment
Rangarajan, A., Chui, H., Mjolsness, E., Pappu, S., Davachi, L., Goldman‐Rakic, P. S., & Duncan, J. S. (1997) · Medical Image Analysis · doi:10.1016/s1361-8415(97)85008-6 · Cited by 184
A feature registration framework using mixture models
Chui, H., & Rangarajan, A. (2002) · IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA) · doi:10.1109/mmbia.2000.852377 · Cited by 180
Robust Registration of 2D and 3D Point Sets
Fitzgibbon, A. W. (2001) · British Machine Vision Conference (BMVC) · doi:10.5244/c.15.43 · Cited by 157
Yuille, A., & Grzywacz, N. M. (2005) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/ccv.1988.590011 · Cited by 131
On Different Facets of Regularization Theory
Chen, Z. S., & Haykin, S. (2002) · Neural Computation · doi:10.1162/089976602760805296 · Cited by 130
Statistical Approaches to Feature-Based Object Recognition
Wells, W. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007923522710 · Cited by 129
New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence
Gold, S., Lu, C.-P., Rangarajan, A., Pappu, S., & Mjolsness, E. (1994) · Cited by 109
Adaptive Elastic Models for Hand-Printed Character Recognition
Hinton, G. E., Williams, C. K. I., & Revow, M. D. (1991) · Cited by 84
Computation of Thin-Plate Splines
Sibson, R., & Stone, G. (1991) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0912070 · Cited by 69
Iterative Procrustes alignment with the EM algorithm
Luo, B., & Hancock, E. R. (2002) · Image and Vision Computing · doi:10.1016/s0262-8856(02)00010-0 · Cited by 53
On the closed-form solution of the rotation matrix arising in computer vision problemsPreprint
Myronenko, A., & Song, X. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.1613 · Cited by 49
Self-citationA unified framework for alignment and correspondence
Luo, B., & Hancock, E. R. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00097-3 · Cited by 48
Image Processing, 2006 IEEE International Conference on
McNeill, G., & Vijayakumar, S. (2006) · CiteSeer X (The Pennsylvania State University) · Cited by 43
A Probabilistic Approach to Robust Shape Matching
McNeill, G., & Vijayakumar, S. (2006) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2006.312629 · Cited by 33
Cited by
Deformable medical image registration: a survey
Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587
“In [318], registration was recast as a probability density estimation problem.”
MethodTEASER: Fast and Certifiable Point Cloud Registration
Yang, H., Shi, J., & Carlone, L. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3033695 · Cited by 895
Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid
Tam, G. K. L., Cheng, Z.-Q., Lai, Y.-K., Langbein, F. C., Liu, Y., Marshall, D., Martin, R. R., Sun, X.-F., & Rosin, P. L. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.310 · Cited by 679
Ma, J., Zhao, J., Jiang, J., Zhou, H., & Guo, X. (2019) · International Journal of Computer Vision · doi:10.1007/s11263-018-1117-z · Cited by 601
Winnubst, J., Bas, E., Ferreira, T. A., Wu, Z., Economo, M. N., Edson, P., Arthur, B. J., Bruns, C., Rokicki, K., Schauder, D., et al. (2019) · Cell · doi:10.1016/j.cell.2019.07.042 · Cited by 538
Metadata
- Authors
- Myronenko, A., & Song, X.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2010-12
- Volume
- 32
- Issue
- 12
- Pages
- 2262-2275
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2134236847
- Cited by
- 2,762
- References
- 49
- FWCI
- 64.11
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.