首页 | 本学科首页   官方微博 | 高级检索  
     

基于形状骨架图匹配的文物碎片自动重组方法
引用本文:张雨禾, 耿国华, 魏潇然, 张靖, 周明全. 基于形状骨架图匹配的文物碎片自动重组方法. 自动化学报, 2017, 43(4): 622-633. doi: 10.16383/j.aas.2017.c160336
作者姓名:张雨禾  耿国华  魏潇然  张靖  周明全
作者单位:1.西北大学信息科学与技术学院 西安 710127;;2.西北大学新闻传播学院 西安 710127;;3.北京师范大学信息科学与技术学院 北京 100875
基金项目:国家自然科学基金(61602380,61373117,61673319),陕西省教育厅科学研究项目(16JK2178),高等学校博士学科点专项科研基金(20136101110019)资助
摘    要:为了有效解决文物碎片自动重组中由于断裂部位受损造成几何信息丢失,采用传统几何驱动方法容易失效的问题,本文提出一种基于形状骨架图匹配的文物碎片自动重组方法,将碎片匹配问题转化为碎片表面纹饰中非完整纹元的互补匹配问题.首先,通过提取文物碎片表面特征线得到碎片表面的纹饰信息;然后根据完整纹元的特征确定非完整纹元互补匹配的约束条件,采用视觉骨架剪枝的方法提取完全位于断裂部位的非完整纹元的形状骨架图,基于形状骨架图语法及匹配约束条件判定非完整纹元是否互补匹配;接着,将碎片上非完整纹元的顺序作为上层约束条件,采用基于带剪枝深度优先的搜索方法搜索匹配碎片;最后,以邻接碎片上非完整纹元间公共弦的端点作为邻接约束点,采用最小二乘法计算刚体变换参数得到碎片的初始位置,并采用迭代最近点方法将邻接碎片精确对齐.实验结果表明,该方法能够有效解决断裂部位存在缺损文物碎片的自动重组问题.

关 键 词:碎片重组   特征线   表面邻接约束   形状匹配
收稿时间:2016-04-15

Reassembly of Fractured Fragments Based on Skeleton Graphs Matching
ZHANG Yu-He, GENG Guo-Hua, WEI Xiao-Ran, ZHANG Jing, ZHOU Ming-Quan. Reassembly of Fractured Fragments Based on Skeleton Graphs Matching. ACTA AUTOMATICA SINICA, 2017, 43(4): 622-633. doi: 10.16383/j.aas.2017.c160336
Authors:ZHANG Yu-He  GENG Guo-Hua  WEI Xiao-Ran  ZHANG Jing  ZHOU Ming-Quan
Affiliation:1. School of Information Science and Technology, Northwest University, Xi'an 710127;;2. School of Journalism and Communication, Northwest University, Xi'an 710127;;3. College of Information Science and Technology, Beijing Normal University, Beijing 100875
Abstract:In order to effectively address the problem that traditional geometry-driven methods fail to reassemble the fragments with incompleteness in fracture surfaces or break-curves, an automatic reassembly method based on skeleton graph of shape matching is proposed, which transfers the matching of fragments into complementary matching of incomplete geometry texels. Firstly, the surface ornamentation information is obtained by extracting the feature lines of the fragments. Secondly, the constraints for matching texels are designed according to the features of complete texels, and a visual skeleton pruning method is utilized to generate the skeletons of the shapes of the incomplete texels and the grammar of skeleton graphs is introduced. Then, the sequence of the incomplete texels is used as the upper constraint and a depth-first searching method with pruning for adjacent fragments is presented. Finally, the endpoints of the common chords of the incomplete texels on the adjacent fragments are used as the initial matching points in order to calculate the initial position of the fragment. After that, the iterated closest point (ICP) method is employed to precisely align the adjacent fragments. Experimental results show that the proposed method can successfully solve the reassembly problem of the fragments with incompleteness in fractured surfaces and break-curves.
Keywords:Reassembly of fragments  feature lines  surface adjacency constraints  shape matching
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号