Robust Point Set Registration with Mixture Re-Weighting Based on Relative Geometric Structures

Yucheng Shu, Zhenlong Liao, Dan Luo
{"title":"Robust Point Set Registration with Mixture Re-Weighting Based on Relative Geometric Structures","authors":"Yucheng Shu, Zhenlong Liao, Dan Luo","doi":"10.1109/ICTAI.2019.00114","DOIUrl":null,"url":null,"abstract":"Point set registration is one of the challenging tasks in computer vision. One critical step is to find the corresponding relationship between the model point set and the scene point set. Existing registration algorithms primarily utilize the information of global and local shape, yet neglect the credibility of corresponding relation, therefore they may lead to the insufficient estimation of spatial transformation. To tackle this problem, we firstly adopt a relative polar coordinate system, it performs spatial pooling operation and further divides the feature extraction region into sub-areas with different scales. Then, based on the Relative Average Distance (RAD) and the Relative Average Offset Angle (RAOA), we propose multi-granular MRGS descriptor to extract visual structures of the point set. The similarity between the model point set and scene point set is then represented by the Gaussian Mixture Model, where the weights can be dynamically adjusted during the process of registration. Finally, we apply the robust mixture re-weighting to reduce the impact of false corresponding pairs and reinforce the weight of correct matching points. Experimental results on synthetic data and medical image data not only show that our method outperform state-of-the-art methods, but also demonstrate the robustness of our method when the non-grid transformation of point sets suffers from deformations, noises and outliers.","PeriodicalId":346657,"journal":{"name":"2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2019.00114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Point set registration is one of the challenging tasks in computer vision. One critical step is to find the corresponding relationship between the model point set and the scene point set. Existing registration algorithms primarily utilize the information of global and local shape, yet neglect the credibility of corresponding relation, therefore they may lead to the insufficient estimation of spatial transformation. To tackle this problem, we firstly adopt a relative polar coordinate system, it performs spatial pooling operation and further divides the feature extraction region into sub-areas with different scales. Then, based on the Relative Average Distance (RAD) and the Relative Average Offset Angle (RAOA), we propose multi-granular MRGS descriptor to extract visual structures of the point set. The similarity between the model point set and scene point set is then represented by the Gaussian Mixture Model, where the weights can be dynamically adjusted during the process of registration. Finally, we apply the robust mixture re-weighting to reduce the impact of false corresponding pairs and reinforce the weight of correct matching points. Experimental results on synthetic data and medical image data not only show that our method outperform state-of-the-art methods, but also demonstrate the robustness of our method when the non-grid transformation of point sets suffers from deformations, noises and outliers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于相对几何结构的混合重加权鲁棒点集配准
点集配准是计算机视觉中具有挑战性的任务之一。关键的一步是找到模型点集和场景点集之间的对应关系。现有的配准算法主要利用全局和局部形状信息,忽略了对应关系的可信度,导致对空间变换估计不足。为了解决这一问题,我们首先采用相对极坐标系统,进行空间池化操作,并进一步将特征提取区域划分为不同尺度的子区域。然后,基于相对平均距离(RAD)和相对平均偏移角(RAOA),提出多粒度MRGS描述符提取点集的视觉结构;然后用高斯混合模型表示模型点集与场景点集的相似度,该模型可以在配准过程中动态调整权值。最后,我们应用鲁棒混合重赋权来减少错误对应对的影响,增强正确匹配点的权重。在合成数据和医学图像数据上的实验结果表明,该方法不仅优于现有方法,而且在点集的非网格变换存在变形、噪声和离群点的情况下,也证明了该方法的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Monaural Music Source Separation using a ResNet Latent Separator Network Graph-Based Attention Networks for Aspect Level Sentiment Analysis A Multi-channel Neural Network for Imbalanced Emotion Recognition Scaling up Prediction of Psychosis by Natural Language Processing Improving Bandit-Based Recommendations with Spatial Context Reasoning: An Online Evaluation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1