高级检索

增量式网格的快速对齐

Efficient Registration for Progressive Meshes

  • 摘要: 给出了一种基于增量式网格的快速对齐算法,在迭代最近点(ICP)算法的基础上,利用增量式网格多分辨率的特点,通过在不同粒度下的对齐来提高效率.还给出了一种在对齐前计算初始变化矩阵的方法,根据该方法计算出来的初始变化矩阵用于ICP算法中,可以保证网格对齐收敛于全局最佳.

     

    Abstract: This paper introduces a mult-i resolution-based method for the accurate and computationally efficient registration of complex triangle meshes. As an improved method of iterative closest point (ICP),our algorithm speeds up the convergence by using progressive mesh(PM) as the representation of a mult-i resolution mesh with the mesh registration under different granularity.In addition,we present a new method to guarantee the registration to converge on the desired global optimism. As we know,ICP starts with two meshes and an initial guess for their relative rigid-body transformation. When the initial guess is improper,it may fall into wrong local minima.Our method can find out an initial transformation which leads to a correct registration.

     

/

返回文章
返回