一种有效的秦俑碎块匹配算法  

Effective Blocks Matching Algorithm of Terracotta Warrior

作　　者：赵夫群[1,2] 周明全[2] ZHAO Fu-Qun ZHOU Ming-Quan(School of Education Science, Xianyang Normal University, Xianyang 712000, China School of Information Science and Technology, Northwest University, Xi＇ an 710127, China)

机构地区：[1]咸阳师范学院教育科学学院,咸阳712000 [2]西北大学信息科学与技术学院,西安710127

出　　处：《计算机系统应用》2017年第3期198-203,共6页Computer Systems & Applications

基　　金：国家自然科学基金(61373117)

摘　　要：针对秦俑碎块的三维网格数据模型,提出了一种基于特征轮廓线的碎块断裂面匹配算法.首先,对数据模型进行纹理贴图、去噪、补洞、简化数据模型等预处理,然后提取碎块的主轮廓线和次轮廓线,进而提取出碎块的特征轮廓线,最后根据角点对特征轮廓线进行分段,并采用计算最长公共子序列的方法对分段曲线进行匹配,完成特征轮廓线的匹配,从而实现碎块断裂面的匹配.实验结果表明,该算法是一种有效的、精确的秦俑碎块匹配方法.Aiming at 3D mesh data model of Terracotta Warrior blocks, a block fracture surface matching algorithm based on feature contour is proposed in the paper. Firstly, the data model is pretreated, such as texture map, data denoising, hole filling, data model simplification and so on. Secondly, the primary contour and secondary contour are extracted, and then the feature contour is extracted too. Lastly, the feature contour is segmented according to the corner point in order to match the feature contour by the longest common subsequence method, then the contour feature matching is completed, and the fracture surface matching is achieved. The experimental results show that the algorithm proposed in the paper is an effective and accurate Terracotta Warrior blocks matching method.

关 键 词：秦俑 碎块匹配 特征轮廓线 角点 最长公共子序列 曲率 挠率 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]