Non-Rigid Point Set Registration Based on Global Prior and Local Structural Constraint

Xin Chang, Shun Fang, Shiqian Wu
{"title":"Non-Rigid Point Set Registration Based on Global Prior and Local Structural Constraint","authors":"Xin Chang, Shun Fang, Shiqian Wu","doi":"10.1109/ICCEA53728.2021.00074","DOIUrl":null,"url":null,"abstract":"Coherent point drift (CPD) is a classic non-rigid point set registration algorithm. Inspired by the CPD idea, an improved CPD method is proposed in this paper. Firstly, we establish a global prior based on the graph feature to dynamically allocate Gaussian components. Secondly, a new neighborhood is defined to flexibly adjust the range of unevenly distributed points. Finally, a local structure constraint based on local neighborhood is proposed, which ensures the structure stability of the point sets. Experimental results on synthetic and real data sets show that the proposed method achieves good performance in degraded data, such as deformation, rotation, and noise.","PeriodicalId":325790,"journal":{"name":"2021 International Conference on Computer Engineering and Application (ICCEA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer Engineering and Application (ICCEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEA53728.2021.00074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Coherent point drift (CPD) is a classic non-rigid point set registration algorithm. Inspired by the CPD idea, an improved CPD method is proposed in this paper. Firstly, we establish a global prior based on the graph feature to dynamically allocate Gaussian components. Secondly, a new neighborhood is defined to flexibly adjust the range of unevenly distributed points. Finally, a local structure constraint based on local neighborhood is proposed, which ensures the structure stability of the point sets. Experimental results on synthetic and real data sets show that the proposed method achieves good performance in degraded data, such as deformation, rotation, and noise.
基于全局先验和局部结构约束的非刚性点集配准
相干点漂移(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学术官方微信