Geodesic-Based Bayesian Coherent Point Drift

Coherent point drift is a well-known algorithm for non-rigid registration, i.e., a procedure for deforming a shape to match another shape. Despite its prevalence, the algorithm has a major drawback that remains unsolved: It unnaturally deforms the different parts of a shape, e.g., human legs, when they are neighboring each other. The inappropriate deformations originate from a proximity-based deformation constraint, called motion coherence. This study proposes a non-rigid registration method that addresses the drawback. The key to solving the problem is to redefine the motion coherence using a geodesic, i.e., the shortest route between points on a shape's surface. We also propose the accelerated variant of the registration method. In numerical studies, we demonstrate that the algorithms can circumvent the drawback of coherent point drift. We also show that the accelerated algorithm can be applied to shapes comprising several millions of points.

[1]  Bailin Deng,et al.  Fast and Robust Non-Rigid Registration Using Accelerated Majorization-Minimization , 2022, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  J. Nagy,et al.  Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets , 2021, SIAM J. Matrix Anal. Appl..

[3]  Dimitrios Tzionas,et al.  Embodied Hands: Modeling and Capturing Hands and Bodies Together , 2022, ArXiv.

[4]  Xavier Pennec,et al.  Geodesic squared exponential kernel for non-rigid shape registration , 2021, 2021 16th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2021).

[5]  M. Meng,et al.  Generalized Coherent Point Drift With Multi-Variate Gaussian Distribution and Watson Distribution , 2021, IEEE Robotics and Automation Letters.

[6]  Takafumi Taketomi,et al.  4DComplete: Non-Rigid Motion Estimation Beyond the Observable Surface , 2021, 2021 IEEE/CVF International Conference on Computer Vision (ICCV).

[7]  Osamu Hirose,et al.  Acceleration of Non-Rigid Point Set Registration With Downsampling and Gaussian Process Regression , 2020, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Yufei Chen,et al.  SCM: Spatially Coherent Matching With Gaussian Field Learning for Nonrigid Point Set Registration , 2020, IEEE Transactions on Neural Networks and Learning Systems.

[9]  Osamu Hirose,et al.  A Bayesian Formulation of Coherent Point Drift , 2020, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Bailin Deng,et al.  Quasi-Newton Solver for Robust Non-Rigid Registration , 2020, 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR).

[11]  Leonidas J. Guibas,et al.  Synchronizing Probability Measures on Rotations via Optimal Transport , 2020, 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR).

[12]  Umberto Castellani,et al.  FARM: Functional Automatic Registration Method for 3D Human Bodies , 2018, Comput. Graph. Forum.

[13]  Max Q.-H. Meng,et al.  Generalized Non-rigid Point Set Registration with Hybrid Mixture Models Considering Anisotropic Positional Uncertainties , 2019, MICCAI.

[14]  Didier Stricker,et al.  Accelerated Gravitational Point Set Alignment With Altered Physical Laws , 2019, 2019 IEEE/CVF International Conference on Computer Vision (ICCV).

[15]  Yusuf Sahillioğlu,et al.  Recent advances in shape correspondence , 2019, The Visual Computer.

[16]  Maks Ovsjanikov,et al.  Correspondence-Free Region Localization for Partial Shape Similarity via Hamiltonian Spectrum Alignment , 2019, 2019 International Conference on 3D Vision (3DV).

[17]  Ron Kimmel,et al.  Unsupervised Learning of Dense Shape Correspondence , 2019, 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR).

[18]  Yusuf Sahillioglu,et al.  A Genetic Isometric Shape Correspondence Algorithm with Adaptive Sampling , 2018, ACM Trans. Graph..

[19]  Gang Wang,et al.  Gaussian field consensus: A robust nonparametric matching method for outlier rejection , 2018, Pattern Recognit..

[20]  Jiayi Ma,et al.  Locality Preserving Matching , 2017, International Journal of Computer Vision.

[21]  Thomas Gerig,et al.  Gaussian Process Morphable Models , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Michael Möller,et al.  Regularized Pointwise Map Recovery from Functional Correspondence , 2017, Comput. Graph. Forum.

[23]  Michael J. Black,et al.  Learning a model of facial shape and expression from 4D scans , 2017, ACM Trans. Graph..

[24]  Daniel Cremers,et al.  Efficient Deformable Shape Correspondence via Kernel Matching , 2017, 2017 International Conference on 3D Vision (3DV).

[25]  Michael J. Black,et al.  Dynamic FAUST: Registering Human Bodies in Motion , 2017, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[26]  Gang Wang,et al.  Robust Non-Rigid Point Set Registration Using Spatially Constrained Gaussian Fields , 2017, IEEE Transactions on Image Processing.

[27]  Pierre Alliez,et al.  A Survey of Surface Reconstruction from Point Clouds , 2017, Comput. Graph. Forum.

[28]  Daniel Cremers,et al.  Partial Functional Correspondence , 2017 .

[29]  Didier Stricker,et al.  Joint pre-alignment and robust rigid point set registration , 2016, 2016 IEEE International Conference on Image Processing (ICIP).

[30]  Søren Hauberg,et al.  Open Problem: Kernel methods on manifolds and metric spaces. What is the probability of a positive definite geodesic exponential kernel? , 2016, COLT.

[31]  Didier Stricker,et al.  Gravitational Approach for Point Set Registration , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[32]  Alan L. Yuille,et al.  Non-Rigid Point Set Registration by Preserving Global and Local Structures , 2016, IEEE Transactions on Image Processing.

[33]  Michael Möller,et al.  Point-wise Map Recovery and Refinement from Functional Correspondence , 2015, VMV.

[34]  Hongdong Li,et al.  Kernel Methods on Riemannian Manifolds with Gaussian RBF Kernels , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[35]  Søren Hauberg,et al.  Geodesic exponential kernels: When curvature and linearity conflict , 2014, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[36]  Michael J. Black,et al.  FAUST: Dataset and Evaluation for 3D Mesh Registration , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[37]  Michael J. Black,et al.  Coregistration: Simultaneous Alignment and Modeling of Articulated 3D Shape , 2012, ECCV.

[38]  Adrian Hilton,et al.  A FACS valid 3D dynamic action unit database with applications to 3D dynamic morphable facial modeling , 2011, 2011 International Conference on Computer Vision.

[39]  Baba C. Vemuri,et al.  Robust Point Set Registration Using Gaussian Mixture Models , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[40]  Darius Burschka,et al.  Deformable 3D Shape Registration Based on Local Similarity Transforms , 2011, Comput. Graph. Forum.

[41]  Yücel Yemez,et al.  3D Shape correspondence by isometry-driven greedy optimization , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[42]  Andriy Myronenko,et al.  Point Set Registration: Coherent Point Drift , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[43]  Alexander M. Bronstein,et al.  Numerical Geometry of Non-Rigid Shapes , 2009, Monographs in Computer Science.

[44]  Hao Li,et al.  Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans , 2008, Comput. Graph. Forum.

[45]  Radford M. Neal Pattern Recognition and Machine Learning , 2007, Technometrics.

[46]  Sami Romdhani,et al.  Optimal Step Nonrigid ICP Algorithms for Surface Registration , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[47]  Hao Zhang,et al.  Robust 3D Shape Correspondence in the Spectral Domain , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[48]  Dragomir Anguelov,et al.  SCAPE: shape completion and animation of people , 2005, ACM Trans. Graph..

[49]  Steven M. Seitz,et al.  Spacetime faces , 2004, ACM Trans. Graph..

[50]  Remco C. Veltkamp,et al.  A survey of content based 3D shape retrieval methods , 2004, Proceedings Shape Modeling Applications, 2004..

[51]  Jitendra Malik,et al.  Spectral grouping using the Nystrom method , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[52]  Zoran Popovic,et al.  The space of human body shapes: reconstruction and parameterization from range scans , 2003, ACM Trans. Graph..

[53]  Anand Rangarajan,et al.  A new point matching algorithm for non-rigid registration , 2003, Comput. Vis. Image Underst..

[54]  Neil A. Dodgson,et al.  Fast Marching farthest point sampling , 2003, Eurographics.

[55]  Jitendra Malik,et al.  Spectral Partitioning with Indefinite Kernels Using the Nyström Extension , 2002, ECCV.

[56]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[57]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[58]  N. Higham COMPUTING A NEAREST SYMMETRIC POSITIVE SEMIDEFINITE MATRIX , 1988 .

[59]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.