扫描配准与多尺度k-均值正态分布变换

Arun Das, Steven L. Waslander
{"title":"扫描配准与多尺度k-均值正态分布变换","authors":"Arun Das, Steven L. Waslander","doi":"10.1109/IROS.2012.6386185","DOIUrl":null,"url":null,"abstract":"The normal distributions transform (NDT) scan registration algorithm has been shown to produce good results, however, has a tendency to converge to a local minimum if the initial parameter error is large. In order to improve the convergence basin for NDT, a multi-scale k-means NDT (MSKM-NDT) variant is proposed. This approach divides the point cloud using k-means clustering and performs the optimization step at multiple scales of cluster sizes. The k-means clustering approach guarantees that the optimization will converge, as it resolves the issue of discontinuities in the cost function found in the standard NDT algorithm. The optimization step of the NDT algorithm is performed over a decreasing scale, which greatly improves the basin of convergence. Experiments show that this approach can be used to register partially overlapping scans with large initial transformation error.","PeriodicalId":6358,"journal":{"name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","volume":"53 4","pages":"2705-2710"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Scan registration with multi-scale k-means normal distributions transform\",\"authors\":\"Arun Das, Steven L. Waslander\",\"doi\":\"10.1109/IROS.2012.6386185\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The normal distributions transform (NDT) scan registration algorithm has been shown to produce good results, however, has a tendency to converge to a local minimum if the initial parameter error is large. In order to improve the convergence basin for NDT, a multi-scale k-means NDT (MSKM-NDT) variant is proposed. This approach divides the point cloud using k-means clustering and performs the optimization step at multiple scales of cluster sizes. The k-means clustering approach guarantees that the optimization will converge, as it resolves the issue of discontinuities in the cost function found in the standard NDT algorithm. The optimization step of the NDT algorithm is performed over a decreasing scale, which greatly improves the basin of convergence. Experiments show that this approach can be used to register partially overlapping scans with large initial transformation error.\",\"PeriodicalId\":6358,\"journal\":{\"name\":\"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"volume\":\"53 4\",\"pages\":\"2705-2710\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.2012.6386185\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2012.6386185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

摘要

正态分布变换(NDT)扫描配准算法已被证明具有良好的配准效果,但当初始参数误差较大时,有收敛到局部最小值的倾向。为了改善无损检测的收敛范围,提出了一种多尺度k-均值无损检测(MSKM-NDT)变体。该方法使用k-means聚类对点云进行划分,并在多个聚类大小尺度上执行优化步骤。k-means聚类方法保证了优化的收敛性,因为它解决了标准NDT算法中发现的代价函数不连续的问题。NDT算法的优化步骤是逐级递减的,大大提高了收敛范围。实验表明,该方法可用于初始变换误差较大的部分重叠扫描的配准。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Scan registration with multi-scale k-means normal distributions transform
The normal distributions transform (NDT) scan registration algorithm has been shown to produce good results, however, has a tendency to converge to a local minimum if the initial parameter error is large. In order to improve the convergence basin for NDT, a multi-scale k-means NDT (MSKM-NDT) variant is proposed. This approach divides the point cloud using k-means clustering and performs the optimization step at multiple scales of cluster sizes. The k-means clustering approach guarantees that the optimization will converge, as it resolves the issue of discontinuities in the cost function found in the standard NDT algorithm. The optimization step of the NDT algorithm is performed over a decreasing scale, which greatly improves the basin of convergence. Experiments show that this approach can be used to register partially overlapping scans with large initial transformation error.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
YES - YEt another object segmentation: Exploiting camera movement Scan registration with multi-scale k-means normal distributions transform Visual servoing using the sum of conditional variance Parallel sampling-based motion planning with superlinear speedup Tactile sensor based varying contact point manipulation strategy for dexterous robot hand manipulating unknown objects
×
引用
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