首页> 外文会议>IEEE International Conference on Robotics and Biomimetics >Non-rigid point set registration via mixture of asymmetric Gaussians with integrated local structures
【24h】

Non-rigid point set registration via mixture of asymmetric Gaussians with integrated local structures

机译:通过将非对称高斯混合与局部局部结构混合来进行非刚性点集配准

获取原文

摘要

As a fundamental problem in computer vision community, non-rigid point set registration is a challenging topic since the corresponding transformation model is often unknown and difficult to model. In this paper, we present a robust method for non-rigid point set registration. Firstly, a mixture of asymmetric Gaussian model (MoAG) is employed to capture spatially asymmetric distributions which the Gaussian mixture model (GMM) based methods neglect instinctively. Secondly, local structures among adjacent points are integrated into the MoAG-based point set registration framework to improve the correspondence estimation. Thirdly, Expectation-Maximization (EM) algorithm which provides a numerical method for finding maximum likelihood estimators is utilized to estimate parameters of the latent variable model in our proposed method. The transformation model is solved under regularization theory in the Reproducing Kernel Hilbert Space (RKHS). Conveniently, a fast implementation is achieved by the sparse approximation. Finally, experiments results show that the robustness of our algorithm outperforms the comparative state of art methods under various types of distortions, such as deformation, noise, outliers and occlusion.
机译:作为计算机视觉社区中的一个基本问题,非刚性点集注册是一个具有挑战性的话题,因为相应的转换模型通常是未知的且难以建模。在本文中,我们提出了一种用于非刚性点集配准的鲁棒方法。首先,采用非对称高斯模型(MoAG)的混合来捕获空间非对称分布,基于高斯混合模型(GMM)的方法本能地忽略了这种不对称分布。其次,将相邻点之间的局部结构集成到基于MoAG的点集注册框架中,以改进对应估计。第三,在我们提出的方法中,期望最大算法(EM)提供了一种寻找最大似然估计器的数值方法,用于估计潜在变量模型的参数。在正则化理论下,在再生核希尔伯特空间(RKHS)中求解了转换模型。便利地,通过稀疏近似实现了快速的实现。最后,实验结果表明,在各种类型的失真(例如变形,噪声,离群值和遮挡)下,我们算法的鲁棒性优于现有的比较方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号