检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京师范大学信息科学与技术学院,北京100875 [2]北京师范大学艺术与传媒学院,北京100875 [3]西北大学可视化技术研究所,西安710027
出 处:《系统仿真学报》2014年第9期2176-2179,共4页Journal of System Simulation
基 金:国家科技支撑计划(2012BAH33F04);中央高校基本科研业务费专项资金资助(2013YB72)
摘 要:提出一种基于积分不变量的断裂面匹配算法,并利用3D打印技术实现修复结果的仿制。计算在多尺度下断面点的体积积分不变量,寻找邻域相似特征点集形成匹配约束簇。对约束簇进行特征提取及表示,根据簇表面的凹凸互补性,得到初始匹配簇对。运用空间几何一致性约束投票及寻找最大独立集的方法对非正确匹配对进行剪枝,即把粗匹配问题转成最优化问题。在粗匹配的基础上,采用ICPIF进行两两碎块精确对齐。利用三维快速成型设备,将每个文物碎片进行3D打印实现复原结果的仿制,进而验证匹配结果的正确性。实验结果表明,该算法能较好的实现碎块匹配和拼接,实现文物的虚拟修复。A fracture surface matching algorithm was proposed based on integral invariants and the 3D rapid manufacture technology was performed to create the physical object for virtual model. The points' volume descriptor for multi-scale was computed and similar feature points were found to build matching constraint clusters. Constrained cluster feature was extracted and represented according to convex and concave correspondence of cluster surface. The coarse matching cluster pairs were determined. The method combining spatial geometric consistency constraint's vote and searching the maximum independent set were performed to prune non-matching pairs. Two fragments could be precisely aligned by ICPIF method based on the result of coarse matching. The three dimension rapid manufacture was utilized to generate the physical object for each digital fragment so as to evaluate the accuracy of matching. Experimental results show that the algorithm can achieve better matching and reassemble.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15