计算机科学
瓶颈
加速
k-最近邻算法
膨胀(度量空间)
体素
点云
迭代最近点
加速度
并行计算
算法
图像配准
光流
人工智能
计算科学
数学
图像(数学)
几何学
物理
经典力学
嵌入式系统
作者
Weimin Wang,Qiong Chang
标识
DOI:10.1109/icassp49357.2023.10095859
摘要
The Iterative Closest Points (ICP) algorithm and its variants have been widely applied for 3D point cloud registration which estimates the rigid transformation. As the most computationally intensive step in ICP, nearest neighbor search (NNS) takes up most of the execution time, hindering the practical applications of ICP registration. To overcome the bottleneck, we propose a novel GPU-friendly approximate nearest neighbor search (ANNS) acceleration scheme, named Voxel dilAtioN (VAN), which can efficiently convert the global search to local $\left. {\mathcal{O}(n)} \right)$. Extensive experiments demonstrate that our VAN can drastically boost the NNS processing while keeping high registration accuracy. Specifically, our GPU-based VAN-ICP achieves 2.7x, 7.6x, and 13.4x speedup on three datasets compared with the CPU-based ICP implementation of Point Cloud Library (PCL). Source codes are available at https://github.com/mfxox/VAN-ICP.
科研通智能强力驱动
Strongly Powered by AbleSci AI