A Bayesian Formulation of Coherent Point Drift

Coherent point drift is a well-known algorithm for solving point set registration problems, i.e., finding corresponding points between shapes represented as point sets. Despite its advantages over other state-of-the-art algorithms, theoretical and practical issues remain. Among theoretical issues, (1) it is unknown whether the algorithm always converges, and (2) the meaning of the parameters concerning motion coherence is unclear. Among practical issues, (3) the algorithm is relatively sensitive to target shape rotation, and (4) acceleration of the algorithm is restricted to the use of the Gaussian kernel. To overcome these issues and provide a different and more general perspective to the algorithm, we formulate coherent point drift in a Bayesian setting. The formulation brings the following consequences and advances to the field: convergence of the algorithm is guaranteed by variational Bayesian inference; the definition of motion coherence as a prior distribution provides a basis for interpretation of the parameters; rigid and non-rigid registration can be performed in a single algorithm, enhancing robustness against target rotation. We also propose an acceleration scheme for the algorithm that can be applied to non-Gaussian kernels and that provides greater efficiency than coherent point drift.

Automated summary

By formulating coherent point drift in a Bayesian setting, the algorithm now guarantees convergence through variational Bayesian inference, provides a basis for interpreting parameters with the motion coherence definition as a prior distribution, and allows for both rigid and non-rigid registration in a single algorithm, enhancing robustness against target rotation. Additionally, an acceleration scheme has been proposed that can be applied to non-Gaussian kernels, providing greater efficiency than traditional coherent point drift.