Noisy Point Clouds Registration Using FFT Based on Multi-Stage Noise Removal

N. Byambajargal, B. Ankhbayar, Khorloo Oyundolgor, A. Enkhbayar
{"title":"Noisy Point Clouds Registration Using FFT Based on Multi-Stage Noise Removal","authors":"N. Byambajargal, B. Ankhbayar, Khorloo Oyundolgor, A. Enkhbayar","doi":"10.22353/mjeas.v1i01.911","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a multi-stage fine registration technique for registering noisy point clouds. At each stage, discrete surfaces that overlap each other are simultaneously transformed into a frequency domain by a fast Fourier transform (FFT) algorithm. In the frequency domain, an adjustable function is used as the low-pass filter, and then discrete surfaces are reconstructed by an inverse Fourier transform. The iterative closest point algorithm is used to register the newly generated surfaces and obtain the registration parameters. We then registered the original point clouds by using these parameters. The next stages are implemented in the same way as in the above; only the parameters are changed in the filter. After a few stages, our method can give a better result for the registration of noisy point clouds. We experimented with the proposed method for registering many types of noisy point clouds such as noisy point clouds with different noise levels or noisy and sparse point sets.","PeriodicalId":205479,"journal":{"name":"Mongolian Journal of Engineering and Applied Sciences","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mongolian Journal of Engineering and Applied Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22353/mjeas.v1i01.911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we introduce a multi-stage fine registration technique for registering noisy point clouds. At each stage, discrete surfaces that overlap each other are simultaneously transformed into a frequency domain by a fast Fourier transform (FFT) algorithm. In the frequency domain, an adjustable function is used as the low-pass filter, and then discrete surfaces are reconstructed by an inverse Fourier transform. The iterative closest point algorithm is used to register the newly generated surfaces and obtain the registration parameters. We then registered the original point clouds by using these parameters. The next stages are implemented in the same way as in the above; only the parameters are changed in the filter. After a few stages, our method can give a better result for the registration of noisy point clouds. We experimented with the proposed method for registering many types of noisy point clouds such as noisy point clouds with different noise levels or noisy and sparse point sets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多级去噪的FFT噪声点云配准
本文介绍了一种用于配准噪声点云的多级精细配准技术。在每个阶段,通过快速傅里叶变换(FFT)算法将相互重叠的离散曲面同时转换为频域。在频域,采用可调函数作为低通滤波器,然后通过傅里叶反变换重构离散曲面。采用迭代最近点算法对新生成的曲面进行配准,得到配准参数。然后使用这些参数对原始点云进行配准。接下来的阶段将以与上述相同的方式实现;只有参数在过滤器中被改变。经过几个步骤,我们的方法可以得到较好的配准结果。我们用所提出的方法对多种类型的噪声点云进行了配准实验,例如具有不同噪声水平的噪声点云或具有噪声和稀疏点集的噪声点云。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Халдлага илрүүлэх хосолмол загварыг юмсын интернэтийн сүлжээнд ашиглах нь Уртын дууны төрлийг шүлгийн өгөгдөл ашиглан машин сургалтын аргаар ангилах нь Байгууламжийн оновчтой байршил сонгоход олон шалгуурт шийдвэр гаргалтын аргуудыг хэрэглэх нь Хоорондын төвийн аргаар сүлжээг задлах Сурах бичгийн эхийн цогц тоон шинжилгээ
×
引用
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