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
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.”
MethodImage Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
TEASER: 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
Non-Rigid Point Set Registration by Preserving Global and Local Structures
Ma, J., Zhao, J., & Yuille, A. L. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2467217 · Cited by 334
Guided Locality Preserving Feature Matching for Remote Sensing Image Registration
Ma, J., Jiang, J., Zhou, H., Zhao, J., & Guo, X. (2018) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2018.2820040 · Cited by 283
3DRegNet: A Deep Neural Network for 3D Point Registration
Pais, G. D., Ramalingam, S., Govindu, V. M., Nascimento, J. C., Chellappa, R., & Miraldo, P. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00722 · Cited by 268
DeepGMR: Learning Latent Gaussian Mixture Models for Registration
Yuan, W., Eckart, B., Kim, K., Jampani, V., Fox, D., & Kautz, J. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58558-7_43 · Cited by 259
Normal cognitive and social development require posterior cerebellar activity
Badura, A., Verpeut, J. L., Metzger, J. W., Pereira, T. D., Pisano, T. J., Deverett, B., Bakshinskaya, D. E., & Wang, S. S.-H. (2018) · eLife · doi:10.7554/elife.36401 · Cited by 205
Zhang (2020) · doi:10.1145/3432192 · Cited by 126
A visual–omics foundation model to bridge histopathology with spatial transcriptomics
Chen, W., Zhang, P., Tran, T. N., Xiao, Y., Li, S., Shah, V. V., Cheng, H., Brannan, K. W., Youker, K., Lai, L., et al. (2025) · Nature Methods · doi:10.1038/s41592-025-02707-1 · Cited by 118
Auditory activity is diverse and widespread throughout the central brain of Drosophila
Pacheco, D. A., Thiberge, S. Y., Pnevmatikakis, E., & Murthy, M. (2021) · Nature Neuroscience · doi:10.1038/s41593-020-00743-y · Cited by 66
DeepMapping: Unsupervised Map Estimation From Multiple Point Clouds
Ding, L., & Feng, C. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00885 · Cited by 79
On-Board Cooperative Spacecraft Relative Navigation Fusing GNSS with Vision
Capuano, V., Harvard, A., & Chung, S.-J. (2022) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2021.100761 · Cited by 39
Koudelová, J., Dupej, J., Brůžek, J., Sedlak, P., & Velemínská, J. (2015) · Forensic Science International · doi:10.1016/j.forsciint.2014.12.005 · Cited by 28
Iterative Closest Graph Matching for Non-rigid 3d/2d Coronary Arteries Registration
Zhu, J., Li, H., Ai, D., Yang, Q., Fan, J., Huang, Y., Song, H., Han, Y., & Yang, J. (2021) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2020.105901 · Cited by 22
Endoscopic Navigation in the Clinic: Registration in the Absence of Preoperative Imaging
Sinha, A., Ishii, M., Hager, G. D., & Taylor, R. H. (2019) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-019-02005-0 · Cited by 9
Haalck, L., & Risse, B. (2021) · 2021 IEEE Winter Conference on Applications of Computer Vision (WACV) · doi:10.1109/wacv48630.2021.00189 · Cited by 3
A Perspective on Open Challenges in Deformable Object Manipulation
McKennaa, R. P., & Oyekan, J. (2026) · arXiv · doi:10.48550/arxiv.2602.22998 · Cited by 1
“• Gaussian Mixture Modeling (GMM) and Coherent Point Drift (CPD) need real-world dataset adaptations for effective use in unstructured environments [37] [38] [40].”
Statistical Mesh Shape Analysis with Nonlandmark Nonrigid Registration
Dupej, J., Krajicek, V., Veleminska, J., & Pelikan, J. (2014) · Eurographics Association · doi:10.2312/sgp20141384
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.