基于点的三维刚性配准Unscented卡尔曼滤波算法的发展

F. Zamani, A. Beheshti
{"title":"基于点的三维刚性配准Unscented卡尔曼滤波算法的发展","authors":"F. Zamani, A. Beheshti","doi":"10.1109/ISTEL.2008.4651367","DOIUrl":null,"url":null,"abstract":"This paper proposes an effective algorithm for estimating the transformation parameters which align two data sets belonging to the rigid objects. This point based algorithm uses unscented Kalman filter for estimating the state vector of transformation which is a nonlinear function of translation and rotation. It is also assumed that the Gaussian noise is added to the fixed data set. In this paper, firstly we investigate the newest algorithm performance for point based rigid body registration using UKF and then we show the drawback of this algorithm in estimating of high range rotations. It is shown that the UKF algorithm is sensitive to selecting the appropriate initial sate vector. For solving limitation of the UKF algorithm, we propose an extended unscented kalman filter algorithm. It is shown that by exploiting this new algorithm which uses pre-registration, we can find an appropriate initial state vector. In this paper, we compare the results of EUKF algorithm with the previous UKF algorithm for different rotations. We demonstrate the effectiveness of the EUKF algorithm for estimation of high transformations between two data sets.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Development of Unscented Kalman filter algorithm for 3-D point based rigid registration\",\"authors\":\"F. Zamani, A. Beheshti\",\"doi\":\"10.1109/ISTEL.2008.4651367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an effective algorithm for estimating the transformation parameters which align two data sets belonging to the rigid objects. This point based algorithm uses unscented Kalman filter for estimating the state vector of transformation which is a nonlinear function of translation and rotation. It is also assumed that the Gaussian noise is added to the fixed data set. In this paper, firstly we investigate the newest algorithm performance for point based rigid body registration using UKF and then we show the drawback of this algorithm in estimating of high range rotations. It is shown that the UKF algorithm is sensitive to selecting the appropriate initial sate vector. For solving limitation of the UKF algorithm, we propose an extended unscented kalman filter algorithm. It is shown that by exploiting this new algorithm which uses pre-registration, we can find an appropriate initial state vector. In this paper, we compare the results of EUKF algorithm with the previous UKF algorithm for different rotations. We demonstrate the effectiveness of the EUKF algorithm for estimation of high transformations between two data sets.\",\"PeriodicalId\":133602,\"journal\":{\"name\":\"2008 International Symposium on Telecommunications\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTEL.2008.4651367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2008.4651367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种估计刚体两数据集对齐变换参数的有效算法。该算法采用无气味卡尔曼滤波来估计平移和旋转非线性函数变换的状态向量。它还假定高斯噪声被添加到固定的数据集。本文首先研究了基于UKF的点刚体配准的最新算法性能,然后指出了该算法在估计大范围旋转时的缺陷。结果表明,UKF算法对选择合适的初始安全向量非常敏感。针对UKF算法的局限性,提出了一种扩展的无气味卡尔曼滤波算法。结果表明,利用预配准的新算法可以找到合适的初始状态向量。在本文中,我们比较了EUKF算法和之前的UKF算法在不同旋转情况下的结果。我们证明了EUKF算法对于估计两个数据集之间的高变换的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Development of Unscented Kalman filter algorithm for 3-D point based rigid registration
This paper proposes an effective algorithm for estimating the transformation parameters which align two data sets belonging to the rigid objects. This point based algorithm uses unscented Kalman filter for estimating the state vector of transformation which is a nonlinear function of translation and rotation. It is also assumed that the Gaussian noise is added to the fixed data set. In this paper, firstly we investigate the newest algorithm performance for point based rigid body registration using UKF and then we show the drawback of this algorithm in estimating of high range rotations. It is shown that the UKF algorithm is sensitive to selecting the appropriate initial sate vector. For solving limitation of the UKF algorithm, we propose an extended unscented kalman filter algorithm. It is shown that by exploiting this new algorithm which uses pre-registration, we can find an appropriate initial state vector. In this paper, we compare the results of EUKF algorithm with the previous UKF algorithm for different rotations. We demonstrate the effectiveness of the EUKF algorithm for estimation of high transformations between two data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信