高级检索
李姬俊男, 耿国华, 周明全, 康馨月. 文物碎块虚拟拼接中的表面特征优化[J]. 计算机辅助设计与图形学学报, 2014, 26(12): 2149-2154.
引用本文: 李姬俊男, 耿国华, 周明全, 康馨月. 文物碎块虚拟拼接中的表面特征优化[J]. 计算机辅助设计与图形学学报, 2014, 26(12): 2149-2154.
Li Jijunnan, Geng Guohua, Zhou Mingquan, Kang Xinyue. Surface Feature Optimization for Virtual Matching of Relic Fragments[J]. Journal of Computer-Aided Design & Computer Graphics, 2014, 26(12): 2149-2154.
Citation: Li Jijunnan, Geng Guohua, Zhou Mingquan, Kang Xinyue. Surface Feature Optimization for Virtual Matching of Relic Fragments[J]. Journal of Computer-Aided Design & Computer Graphics, 2014, 26(12): 2149-2154.

文物碎块虚拟拼接中的表面特征优化

Surface Feature Optimization for Virtual Matching of Relic Fragments

  • 摘要: 为了有效地度量空间曲面相似性,针对噪声敏感、部分匹配的受损文物碎块模型,提出一种基于空间曲面特征优化的匹配算法.首先计算模型表面点体积积分不变量形成匹配约束簇,提取匹配约束簇特征,并结合曲面凹凸互补性得到初始匹配簇对;然后定义3类空间几何一致性约束,并采用最大独立集方法对非正确匹配对进行消除,求解粗匹配最优化问题;最后在粗匹配实验基础上,采用不变特征迭代最近点进行精确对齐.实验结果表明,该算法能较好地实现高噪声影响下存在部分匹配关系的受损文物虚拟拼接.

     

    Abstract: In this paper, apartial shape matching algorithm is proposed for high noise relic fragments based on surface feature optimization.We compute volume integral invariant of the fracture points under multi-scale and search similar feature points to build matching constraint clusters.Initial matching cluster pairs are obtained by extracting and representing feature for constrained cluster based on convex and concave correspondence of cluster surface.Then the rough matching problem can be converted to an optimization problem by applying the method of consistent constraint vote in geometric space and searching the maximum independent set to prune non-matching pairs.Finally two fragments can be precisely aligned based on the result of rough matching by using iterative closest points using invariant features.Experimental results show that the algorithm can achieve better matching and stitching.

     

/

返回文章
返回