Point Set Registration: Coherent Point Drift

@article{Myronenko2009PointSR,  title={Point Set Registration: Coherent Point Drift},  author={Andriy Myronenko and Xubo B. Song},  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},  year={2009},  volume={32},  pages={2262-2275},  url={https://api.semanticscholar.org/CorpusID:10809031}}
A probabilistic method, called the Coherent Point Drift (CPD) algorithm, is introduced for both rigid and nonrigid point set registration and a fast algorithm is introduced that reduces the method computation complexity to linear.

2,636 Citations

Non-Rigid Multiple Point Set Registration Using Latent Gaussian Mixture

A robust group-wise registration method from a probabilistic view and adopt non-rigid transformations to register multiple point sets without bias toward any given set is proposed.

A robust non-rigid point set registration algorithm using both local and global constraints

A significant number of experiments show that the proposed technique has higher registration accuracy than several other state-of-the-art algorithms when dealing with non-rigid registration problems, especially when the point set contains outliers and severely missing points.

Dependent landmark drift: robust point set registration with a Gaussian mixture model and a statistical shape model

A novel point set registration method using the Gaussian mixture model with prior shape information encoded as a statistical shape model that works effectively if the target point set includes outliers and missing regions, or if it is rotated.

Dependent landmark drift: robust point set registration based on the Gaussian mixture model with a statistical shape model

A novel point set registration method using the Gaussian mixture model with prior shape information encoded as a statistical shape model that works effectively if the target point set includes outliers and missing regions, or if it is rotated.

Registration of Human Point Set using Automatic Key Point Detection and Region-aware Features

A probabilistic, non-rigid point set registration method that uses the Stochastic Neighbor Embedding constraint to preserve the local neighborhood of the point set and outperforms the state-of-the-art methods.

Non-Rigid Point Set Registration by Preserving Global and Local Structures

The robustness of this approach under various types of distortions, such as deformation, noise, outliers, rotation, and occlusion, greatly outperforms the state-of-the-art methods, especially when the data is badly degraded.

Anisotropic Generalized Bayesian Coherent Point Drift for Point Set Registration

A novel, robust, and accurate three-dimensional (3D) rigid point set registration (PSR) method, which is achieved by generalizing the state-of-the-art (SOTA) Bayesian coherent point drift (BCPD) theory to the scenario that high-dimensional point sets (PSs) are aligned and the anisotropic positional noise is considered.

Robust point set registration method based on global structure and local constraints

A robust point set registration method using a popular probability model, Gaussian mixture model, to preserve the global structure of point set and a local constraint provided by some neighboring points to maintain the local structure of the point set.
...

53 References

Non-rigid point set registration: Coherent Point Drift

This work formulate the motion coherence constraint and derive a solution of regularized ML estimation through the variational approach, which leads to an elegant kernel form, and derives the EM algorithm for the penalized ML optimization with deterministic annealing.

A robust algorithm for point set registration using mixture of Gaussians

    B. JianB. Vemuri
    Computer Science, Engineering
    Tenth IEEE International Conference on Computer…
  • 2005
A novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers is proposed, which derives a closed-form expression for the L/sub 2/distance between two Gaussian mixtures, which leads to a computationally efficient registration algorithm.

A Method for Registration of 3-D Shapes

A general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces based on the iterative closest point (ICP) algorithm.

A Correlation-Based Approach to Robust Point Set Registration

The point set registration problem is defined as finding the maximum kernel correlation configuration of the the two point sets to be registered, and the new registration method has intuitive interpretations, simple to implement algorithm and easy to prove convergence property.

Simultaneous Covariance Driven Correspondence (CDC) and Transformation Estimation in the Expectation Maximization Framework

Experiments show that Co-variance Driven Correspondences has a broader domain of convergence than the well-known Iterative Closest Point (ICP) algorithm and is more robust to missing or extraneous structures in the data than RPM.

A New Affine Registration Algorithm for Matching 2D Point Sets

A novel affine registration algorithm for matching 2D feature points that does not require any optimization and in the absence of data noise, the algorithm will recover the exact affine transformation and the unknown correspondence.

A new algorithm for non-rigid point matching

We present a new robust point matching algorithm (RPM) that can jointly estimate the correspondence and non-rigid transformations between two point-sets that may be of different sizes. The algorithm…

A feature registration framework using mixture models

The authors formulate feature registration problems as maximum likelihood or Bayesian maximum a posteriori estimation problems using mixture models and embedding of the EM algorithm within a deterministic annealing scheme in order to directly control the fuzziness of the correspondences.

Iterative point matching for registration of free-form curves and surfaces

A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense3-D maps obtained by use a correlation-based stereoscopic system, and it is efficient and robust, and yields an accurate motion estimate.
...

Related Papers

Showing 1 through 3 of 0 Related Papers