基于高斯混合模型的非刚性点集配准
Non-Rigid Point Set Registration Based on Gaussian Mixture Model
DOI: 10.12677/aam.2024.138364, PDF,   
作者: 石先英, 杨奋林:吉首大学数学与统计学院,湖南 吉首
关键词: 点集配准GMMEM算法Point Set Registration Gaussian Mixture Model EM Algorithm
摘要: 点集配准的目的是获取对应关系和估计模型点集到目标点集的变换。非刚性点集配准的求解难度大,且点集可能含有噪声、遮挡等失真使其求解更加复杂。概率点集配准方法因其对变形、噪声和遮挡具有鲁棒性,本文将点集配准视为概率密度估计问题,通过极大似然估计,并用EM算法求解对应关系及变换。在再生核希尔伯特空间中指定了两点集之间的变换,并对核函数(即高斯分布)中的高斯滤波器的宽度在迭代过程中逐渐缩小。在合成数据的实验表明,本文方法在变形、噪声等各种类型的畸变下具有鲁棒性,与CPD算法比较,本文方法比它的配准误差更小。
Abstract: The purpose of point set alignment is to obtain correspondences and estimate the transformation from the model point set to the target point set. Non-rigid point set alignment is difficult to solve, and the point set may contain distortions such as noise and occlusion to complicate its solution. Probabilistic point set alignment methods are robust to distortions, noise and occlusion, and in this paper, point set alignment is considered as a probability density estimation problem, which is estimated by great likelihood and solved by EM algorithms for the correspondences and transformations. The transformation between the two point sets is specified in the regenerated kernel Hilbert space, and the width of the Gaussian filter in the kernel function (i.e., the Gaussian distribution) is gradually narrowed down during the iteration process. Experiments on synthesized data show that the method of this paper is robust under various types of distortions such as deformation and noise, and compared with the CPD algorithm, the method of this paper has less alignment error than it.
文章引用:石先英, 杨奋林. 基于高斯混合模型的非刚性点集配准[J]. 应用数学进展, 2024, 13(8): 3826-3836. https://doi.org/10.12677/aam.2024.138364

参考文献

[1] Yang, C., Liu, Y., Jiang, X., Zhang, Z., Wei, L., Lai, T., et al. (2018) Non-Rigid Point Set Registration via Adaptive Weighted Objective Function. IEEE Access, 6, 75947-75960. [Google Scholar] [CrossRef
[2] Yang, Z., Dan, T. and Yang, Y. (2018) Multi-Temporal Remote Sensing Image Registration Using Deep Convolutional Features. IEEE Access, 6, 38544-38555. [Google Scholar] [CrossRef
[3] Leordeanu, M. and Hebert, M. (2005) A Spectral Technique for Correspondence Problems Using Pairwise Constraints. Tenth IEEE International Conference on Computer Vision (ICCV’05) Volume 1, Beijing, 17-21 October 2005, 1482-1489. [Google Scholar] [CrossRef
[4] Jian, B. and Vemuri, B.C. (2011) Robust Point Set Registration Using Gaussian Mixture Models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, 1633-1645. [Google Scholar] [CrossRef] [PubMed]
[5] Chui, H. and Rangarajan, A. (2000) A Feature Registration Framework Using Mixture Models. Proceedings IEEE Workshop on Mathematical Methods in Biomedical Image Analysis. MMBIA-2000 (Cat. No. PR00737), Hilton Head, 12 June 2000, 190-197. [Google Scholar] [CrossRef
[6] Myronenko, A., Song, X. and Carreira-Perpiñán, M.Á. (2007) Non-Rigid Point Set Registration: Coherent Point Drift. In: Schölkopf, B., Platt, J. and Hofmann, T., Eds., Advances in Neural Information Processing Systems 19, The MIT Press, 1009-1016. [Google Scholar] [CrossRef
[7] Gold, S., Rangarajan, A., Lu, C., Pappu, S. and Mjolsness, E. (1998) New Algorithms for 2D and 3D Point Matching. Pattern Recognition, 31, 1019-1031. [Google Scholar] [CrossRef
[8] Chui, H. and Rangarajan, A. (2003) A New Point Matching Algorithm for Non-Rigid Registration. Computer Vision and Image Understanding, 89, 114-141. [Google Scholar] [CrossRef
[9] Cross, A.D.J. and Hancock, E.R. (1998) Graph Matching with a Dual-Step EM Algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20, 1236-1253. [Google Scholar] [CrossRef
[10] Luo, B. and Hancock, E.R. (2003) A Unified Framework for Alignment and Correspondence. Computer Vision and Image Understanding, 92, 26-55. [Google Scholar] [CrossRef
[11] Myronenko, A. and Song, X. (2010) Point Set Registration: Coherent Point Drift. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32, 2262-2275. [Google Scholar] [CrossRef] [PubMed]
[12] Horaud, R., Forbes, F., Yguel, M., Dewaele, G. and Zhang, J. (2011) Rigid and Articulated Point Registration with Expectation Conditional Maximization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, 587-602. [Google Scholar] [CrossRef] [PubMed]
[13] Dempster, A.P., Laird, N.M. and Rubin, D.B. (1977) Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society Series B: Statistical Methodology, 39, 1-22. [Google Scholar] [CrossRef