arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.05342cs.RO
收藏

TT-SDF2PC:在内存高效的张量列车域中直接配准点云与压缩SDF

TT-SDF2PC: Registration of Point Cloud and Compressed SDF Directly in the Memory-Efficient Tensor Train Domain

AIRI Institute(AIRI研究所);Skolkovo Institute of Science and Technology (Skoltech)(斯科尔科沃科技学院(Skoltech))

Alexey I. Boyko, Anastasiia Kornilova, Rahim Tariverdizadeh, Mirfarid Musavian, Larisa Markeeva, Ivan Oseledets, Gonzalo Ferrer

AI总结:

本文提出TT-SDF2PC算法,利用张量列车分解压缩SDF并在TT域中高效计算导数,实现点云与压缩SDF的直接配准,在保持与SOTA方法相当性能的同时显著降低计算和内存资源需求。

摘要:

本文研究的问题是:“能否压缩详细的三维表示并将其直接用于点云配准?”。场景地图压缩可以通过对符号距离函数(SDF)表示进行张量列车(TT)分解来实现,该分解通过所谓的TT秩来控制数据减少量。基于这种表示,我们提出了一种算法,即TT-SDF2PC,该算法能够利用TT域中导数的高效计算,直接将点云配准到压缩SDF上,从而节省计算量和内存。我们在合成数据集和真实数据集上将TT-SDF2PC与最先进的局部和全局配准方法进行了比较,结果表明其性能相当,同时所需的资源显著减少。

英文摘要:

This paper addresses the following research question: ``can one compress a detailed 3D representation and use it directly for point cloud registration?''. Map compression of the scene can be achieved by the tensor train (TT) decomposition of the signed distance function (SDF) representation. It regulates the amount of data reduced by the so-called TT-ranks. Using this representation we have proposed an algorithm, the TT-SDF2PC, that is capable of directly registering a PC to the compressed SDF by making use of efficient calculations of its derivatives in the TT domain, saving computations and memory. We compare TT-SDF2PC with SOTA local and global registration methods in a synthetic dataset and a real dataset and show on par performance while requiring significantly less resources.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑