首页> 外文会议>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)的方法的空间不对称分布忽略本能地忽略。其次,相邻点之间的本地结构集成到基于Mog的点设置登记框架中以改善对应估计。第三,利用了用于查找最大似然估计器的数值方法的期望 - 最大化(EM)算法来估计我们所提出的方法中潜在变量模型的参数。在再生内核希尔伯特空间(RKHS)中,在正则化理论下解决了变换模型。方便地,通过稀疏近似实现快速实现。最后,实验结果表明,我们的算法的稳健性优于各种类型的扭曲下的现有技术的比较状态,例如变形,噪音,异常值和闭塞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号