检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:卢浩然[1] 张宇[1] 牛苗苗 税午阳[1,2] 周明全[1,2]
机构地区:[1]北京师范大学信息科学与技术学院,北京100875 [2]文化遗产数字化保护与虚拟现实北京市重点实验室北京师范大学,北京100875
出 处:《系统仿真学报》2015年第12期3006-3011,3017,共7页Journal of System Simulation
基 金:国家自然科学基金(61001168;61402042);国家科技支撑计划(2012BAH33F04)
摘 要:利用三维激光扫描方式采集文物几何信息正变得越来越普遍,借助计算机技术可以实现破碎文物的虚拟复原。针对全自动几何驱动虚拟文物拼接的不足,提出一种利用Leap motion实现碎片交互拼接的方法。通过Leap Motion获得的数据实现手的运动模拟,交互地控制碎片模型的运动,实现两个碎片的初匹配。拼接结果将实时反馈给用户,用户可以通过控制碎片的位置优化碎片间的拼接关系。进一步采用最近点迭代算法实现两个碎片的精确匹配。将拼接结果作为新的碎片迭代地实现多个碎片的匹配和拼接。实验结果表明,该方法可以降低自动拼接技术对数据的高度依赖性实现邻接文物碎片的拼接。3D laser scanning technique has been widely used to acquire geometry information of artifacts. The broken relics can be virtually restored with the help of computer technologies. Aiming at solving the problems of the automatic virtual restoration for broken artifact fragments, a new method of semi-automatic reassembly was proposed. The motions of the user's hands were simulated by using the data captured by Leap Motion. The movement of each fragment model was controlled interactively so that two fragments could be roughly matched. The matching results were fed back to the user in real-time, and the user could optimize the matching by controlling the positions of the fragments. The iterative closest point algorithm was adopted to realize the fine matching for rough matching result. The fine matching results were considered as a new piece, and the above steps were iteratively performed multiple fragments matching and reassembly. The experiments illustrate that the method can overcome the problem of the high dependency for automatic matching and neighbor fragments can be matched using the approach.
关 键 词:Leap MOTION 人机交互 碎片拼接 最近点迭代
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30