Bayesian rigid point set registration using logarithmic double exponential prior

Jiajia Wu, Y. Wan, Zhenming Su
{"title":"Bayesian rigid point set registration using logarithmic double exponential prior","authors":"Jiajia Wu, Y. Wan, Zhenming Su","doi":"10.1109/ICIST.2013.6747790","DOIUrl":null,"url":null,"abstract":"Point set registration is a key problem in many computer vision tasks. The goal of point set registration is to match two sets of points and estimate the transformation parameter that maps one point set to the other. Among the many published registration methods, the recently proposed Coherent Point Drift (CPD) algorithm stands out for its accuracy. In this paper we show that by casting CPD in the Bayesian framework we can obtain even better results. In particular, in case of large translation amount, our proposed mathod has much less number of iterations than CPD without any loss of accuracy. Experimental results confirms the advantages of the proposed method and shows an overall speedup when compared with the CPD method.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2013.6747790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Point set registration is a key problem in many computer vision tasks. The goal of point set registration is to match two sets of points and estimate the transformation parameter that maps one point set to the other. Among the many published registration methods, the recently proposed Coherent Point Drift (CPD) algorithm stands out for its accuracy. In this paper we show that by casting CPD in the Bayesian framework we can obtain even better results. In particular, in case of large translation amount, our proposed mathod has much less number of iterations than CPD without any loss of accuracy. Experimental results confirms the advantages of the proposed method and shows an overall speedup when compared with the CPD method.
对数双指数先验贝叶斯刚体点集配准
点集配准是许多计算机视觉任务中的关键问题。点集配准的目标是匹配两个点集,并估计将一个点集映射到另一个点集的转换参数。在许多已发表的配准方法中,最近提出的相干点漂移(CPD)算法以其精度突出。在本文中,我们证明了在贝叶斯框架中浇铸CPD可以得到更好的结果。特别是在翻译量较大的情况下,我们提出的方法比CPD迭代次数少得多,而且精度没有损失。实验结果证实了该方法的优越性,与CPD方法相比,该方法的总体速度有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信