基于平面曲线的破碎铜镜重组匹配

Wuyang Shui, Mingquan Zhou, Liyang Zhang, Y. Wang
{"title":"基于平面曲线的破碎铜镜重组匹配","authors":"Wuyang Shui, Mingquan Zhou, Liyang Zhang, Y. Wang","doi":"10.1109/CISP.2013.6745308","DOIUrl":null,"url":null,"abstract":"Bronze mirror is one of the most famous bronze artifacts in ancient China, some of which have been broken into several small fractures after excavation. Recently, computer scientists collaborating with archeologists focused on fractures matching automatically according to geometry curve. In this paper, a novel method is proposed for several fractures automatic reassembling to improve the speed and accuracy. Firstly, the one-shot image is utilized to collect image data for broken bronze mirror by digital camera. Secondly, watershed algorithm is used to segment and mark each fracture. Thirdly, the longest common curve is found by combining corners detection, coarse matching and fine matching, taking length, angle and curvature into account. The curvature consistency is used to omit the outlier mirror external curve to guarantee matching correctly by circle-shaped structure. Finally, the least square method is performed to compute rigid transformation to reassemble neighbor fractures by matching increment. Experimental results on broken bronze mirror demonstrate the correctness and robustness of our method.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Plane-curve-based matching for broken bronze mirror reassembling\",\"authors\":\"Wuyang Shui, Mingquan Zhou, Liyang Zhang, Y. Wang\",\"doi\":\"10.1109/CISP.2013.6745308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bronze mirror is one of the most famous bronze artifacts in ancient China, some of which have been broken into several small fractures after excavation. Recently, computer scientists collaborating with archeologists focused on fractures matching automatically according to geometry curve. In this paper, a novel method is proposed for several fractures automatic reassembling to improve the speed and accuracy. Firstly, the one-shot image is utilized to collect image data for broken bronze mirror by digital camera. Secondly, watershed algorithm is used to segment and mark each fracture. Thirdly, the longest common curve is found by combining corners detection, coarse matching and fine matching, taking length, angle and curvature into account. The curvature consistency is used to omit the outlier mirror external curve to guarantee matching correctly by circle-shaped structure. Finally, the least square method is performed to compute rigid transformation to reassemble neighbor fractures by matching increment. Experimental results on broken bronze mirror demonstrate the correctness and robustness of our method.\",\"PeriodicalId\":442320,\"journal\":{\"name\":\"2013 6th International Congress on Image and Signal Processing (CISP)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 6th International Congress on Image and Signal Processing (CISP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISP.2013.6745308\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 6th International Congress on Image and Signal Processing (CISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISP.2013.6745308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

铜镜是中国古代最著名的青铜器之一,其中一些在挖掘后已经破碎成几条小裂缝。近年来,计算机科学家与考古学家合作,致力于根据几何曲线自动匹配裂缝。本文提出了一种多裂缝自动拼接的新方法,以提高拼接速度和精度。首先,利用数码相机采集破碎铜镜的单镜头图像数据。其次,采用分水岭算法对裂缝进行分割和标记;第三,综合考虑长度、角度和曲率,采用角点检测、粗匹配和精细匹配相结合的方法,找到最长的公共曲线;利用曲率一致性来省略离群镜外曲线,保证了圆形结构的正确匹配。最后,采用最小二乘法计算刚性变换,通过匹配增量对相邻裂缝进行重组。破碎铜镜的实验结果验证了该方法的正确性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Plane-curve-based matching for broken bronze mirror reassembling
Bronze mirror is one of the most famous bronze artifacts in ancient China, some of which have been broken into several small fractures after excavation. Recently, computer scientists collaborating with archeologists focused on fractures matching automatically according to geometry curve. In this paper, a novel method is proposed for several fractures automatic reassembling to improve the speed and accuracy. Firstly, the one-shot image is utilized to collect image data for broken bronze mirror by digital camera. Secondly, watershed algorithm is used to segment and mark each fracture. Thirdly, the longest common curve is found by combining corners detection, coarse matching and fine matching, taking length, angle and curvature into account. The curvature consistency is used to omit the outlier mirror external curve to guarantee matching correctly by circle-shaped structure. Finally, the least square method is performed to compute rigid transformation to reassemble neighbor fractures by matching increment. Experimental results on broken bronze mirror demonstrate the correctness and robustness of our method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信