断裂考古文物的半自动几何驱动重组

Nicolas Mellado, Patrick Reuter, C. Schlick
{"title":"断裂考古文物的半自动几何驱动重组","authors":"Nicolas Mellado, Patrick Reuter, C. Schlick","doi":"10.2312/VAST/VAST10/033-038","DOIUrl":null,"url":null,"abstract":"3D laser scanning of broken cultural heritage content is becoming increasingly popular, resulting in large col- lections of detailed fractured archeological 3D objects that have to be reassembled virtually. In this paper, we present a new semi-automatic reassembly approach for pairwise matching of the fragments, that makes it possible to take into account both the archeologist's expertise, as well as the power of automatic geometry-driven match- ing algorithms. Our semi-automatic reassembly approach is based on a real-time interaction loop: an expert user steadily specifies approximate initial relative positions and orientations between two fragments by means of a bimanual tangible user interface. These initial poses are continuously corrected and validated in real-time by an algorithm based on the Iterative Closest Point (ICP): the potential contact surface of the two fragments is identi- fied by efficiently pruning insignificant areas of a pair of two bounding sphere hierarchies, that is combined with a k-d tree for closest vertex queries. The locally optimal relative pose for the best match is robustly estimated by taking into account the distance of the closest vertices as well as their normals. We provide feedback to the user by a visual representation of the locally optimal best match and its associated error. Our first results on a concrete dataset show that our system is capable of assisting an expert user in real-time during the pairwise matching of downsampled 3D fragments.","PeriodicalId":168094,"journal":{"name":"IEEE Conference on Visual Analytics Science and Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Semi-Automatic Geometry-Driven Reassembly of Fractured Archeological Objects\",\"authors\":\"Nicolas Mellado, Patrick Reuter, C. Schlick\",\"doi\":\"10.2312/VAST/VAST10/033-038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"3D laser scanning of broken cultural heritage content is becoming increasingly popular, resulting in large col- lections of detailed fractured archeological 3D objects that have to be reassembled virtually. In this paper, we present a new semi-automatic reassembly approach for pairwise matching of the fragments, that makes it possible to take into account both the archeologist's expertise, as well as the power of automatic geometry-driven match- ing algorithms. Our semi-automatic reassembly approach is based on a real-time interaction loop: an expert user steadily specifies approximate initial relative positions and orientations between two fragments by means of a bimanual tangible user interface. These initial poses are continuously corrected and validated in real-time by an algorithm based on the Iterative Closest Point (ICP): the potential contact surface of the two fragments is identi- fied by efficiently pruning insignificant areas of a pair of two bounding sphere hierarchies, that is combined with a k-d tree for closest vertex queries. The locally optimal relative pose for the best match is robustly estimated by taking into account the distance of the closest vertices as well as their normals. We provide feedback to the user by a visual representation of the locally optimal best match and its associated error. Our first results on a concrete dataset show that our system is capable of assisting an expert user in real-time during the pairwise matching of downsampled 3D fragments.\",\"PeriodicalId\":168094,\"journal\":{\"name\":\"IEEE Conference on Visual Analytics Science and Technology\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Conference on Visual Analytics Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2312/VAST/VAST10/033-038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Visual Analytics Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/VAST/VAST10/033-038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

摘要

对破碎的文化遗产内容进行三维激光扫描正变得越来越流行,导致大量详细破碎的考古三维物体必须在虚拟环境中重新组装。在本文中,我们提出了一种新的半自动重组方法,用于碎片的成对匹配,这使得考虑到考古学家的专业知识以及自动几何驱动匹配算法的能力成为可能。我们的半自动重组方法基于实时交互循环:专家用户通过手动有形用户界面稳定地指定两个片段之间的近似初始相对位置和方向。这些初始姿态通过基于迭代最近点(ICP)的算法不断地进行实时校正和验证:通过有效地修剪一对两个边界球层次的不重要区域来识别两个碎片的潜在接触面,并结合k-d树进行最近顶点查询。通过考虑最近顶点的距离和它们的法线,鲁棒地估计出最佳匹配的局部最优相对姿态。我们通过局部最优匹配及其相关误差的可视化表示向用户提供反馈。我们在一个具体数据集上的第一个结果表明,我们的系统能够在下采样3D片段的成对匹配过程中实时帮助专家用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Semi-Automatic Geometry-Driven Reassembly of Fractured Archeological Objects
3D laser scanning of broken cultural heritage content is becoming increasingly popular, resulting in large col- lections of detailed fractured archeological 3D objects that have to be reassembled virtually. In this paper, we present a new semi-automatic reassembly approach for pairwise matching of the fragments, that makes it possible to take into account both the archeologist's expertise, as well as the power of automatic geometry-driven match- ing algorithms. Our semi-automatic reassembly approach is based on a real-time interaction loop: an expert user steadily specifies approximate initial relative positions and orientations between two fragments by means of a bimanual tangible user interface. These initial poses are continuously corrected and validated in real-time by an algorithm based on the Iterative Closest Point (ICP): the potential contact surface of the two fragments is identi- fied by efficiently pruning insignificant areas of a pair of two bounding sphere hierarchies, that is combined with a k-d tree for closest vertex queries. The locally optimal relative pose for the best match is robustly estimated by taking into account the distance of the closest vertices as well as their normals. We provide feedback to the user by a visual representation of the locally optimal best match and its associated error. Our first results on a concrete dataset show that our system is capable of assisting an expert user in real-time during the pairwise matching of downsampled 3D fragments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信