一种基于混合高斯的点集配准鲁棒算法。

Bing Jian, Baba C Vemuri
{"title":"一种基于混合高斯的点集配准鲁棒算法。","authors":"Bing Jian,&nbsp;Baba C Vemuri","doi":"10.1109/ICCV.2005.17","DOIUrl":null,"url":null,"abstract":"<p><p>This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented by a mixture of Gaussians and the point set registration is treated as a problem of aligning the two mixtures. We derive a closed-form expression for the L(2) distance between two Gaussian mixtures, which in turn leads to a computationally efficient registration algorithm. This new algorithm has an intuitive interpretation, is simple to implement and exhibits inherent statistical robustness. Experimental results indicate that our algorithm achieves very good performance in terms of both robustness and accuracy.</p>","PeriodicalId":74564,"journal":{"name":"Proceedings. IEEE International Conference on Computer Vision","volume":"2 ","pages":"1246-1251"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICCV.2005.17","citationCount":"380","resultStr":"{\"title\":\"A Robust Algorithm for Point Set Registration Using Mixture of Gaussians.\",\"authors\":\"Bing Jian,&nbsp;Baba C Vemuri\",\"doi\":\"10.1109/ICCV.2005.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented by a mixture of Gaussians and the point set registration is treated as a problem of aligning the two mixtures. We derive a closed-form expression for the L(2) distance between two Gaussian mixtures, which in turn leads to a computationally efficient registration algorithm. This new algorithm has an intuitive interpretation, is simple to implement and exhibits inherent statistical robustness. Experimental results indicate that our algorithm achieves very good performance in terms of both robustness and accuracy.</p>\",\"PeriodicalId\":74564,\"journal\":{\"name\":\"Proceedings. IEEE International Conference on Computer Vision\",\"volume\":\"2 \",\"pages\":\"1246-1251\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1109/ICCV.2005.17\",\"citationCount\":\"380\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Conference on Computer Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCV.2005.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Conference on Computer Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCV.2005.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 380

摘要

针对存在大量噪声和异常值的点集配准问题,提出了一种新颖的鲁棒方法。每个点集都由高斯分布的混合表示,点集配准被视为两个混合的对齐问题。我们推导了两个高斯混合物之间的L(2)距离的封闭表达式,这反过来又导致了计算效率高的配准算法。该算法具有直观的解释、简单的实现和固有的统计鲁棒性。实验结果表明,该算法在鲁棒性和准确性方面都取得了很好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Robust Algorithm for Point Set Registration Using Mixture of Gaussians.

This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented by a mixture of Gaussians and the point set registration is treated as a problem of aligning the two mixtures. We derive a closed-form expression for the L(2) distance between two Gaussian mixtures, which in turn leads to a computationally efficient registration algorithm. This new algorithm has an intuitive interpretation, is simple to implement and exhibits inherent statistical robustness. Experimental results indicate that our algorithm achieves very good performance in terms of both robustness and accuracy.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
PGFed: Personalize Each Client's Global Objective for Federated Learning. The Devil is in the Upsampling: Architectural Decisions Made Simpler for Denoising with Deep Image Prior. Enhancing Modality-Agnostic Representations via Meta-learning for Brain Tumor Segmentation. SimpleClick: Interactive Image Segmentation with Simple Vision Transformers. Improving Representation Learning for Histopathologic Images with Cluster Constraints.
×
引用
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