快速刚性三维配准解决方案:一种无需SVD和特征分解的简单方法
Fast Rigid 3D Registration Solution: A Simple Method Free of SVD and Eigen-Decomposition
AI总结:
本文提出一种无需SVD和特征分解的快速刚性三维配准方法,通过点交叉协方差矩阵的最优特征向量计算实现高效配准,验证了其在噪声点云中的鲁棒性和速度优势。
摘要:
本文提出了一种新的解决方案来解决刚性三维配准问题,受之前基于特征分解的方法启发。与现有求解器不同,所提算法不需要复杂的矩阵运算,如奇异值分解或特征值分解。相反,点交叉协方差矩阵的最优特征向量可以在几次迭代中计算出来。此外,证明了在不需要四元数的情况下可以直接计算最优旋转矩阵。该简单框架提供了在嵌入式平台上整数实现的非常简便方法。对噪声污染点云的仿真验证了所提方法的鲁棒性和计算速度。最终结果表明,所提算法准确、鲁棒,并且比代表方法计算时间减少了60%至80%。它还已应用于实际世界,以实现更快的相对机器人导航。
英文摘要:
A novel solution is obtained to solve the rigid 3D registration problem, motivated by previous eigen-decomposition approaches. Different from existing solvers, the proposed algorithm does not require sophisticated matrix operations e.g. singular value decomposition or eigenvalue decomposition. Instead, the optimal eigenvector of the point cross-covariance matrix can be computed within several iterations. It is also proven that the optimal rotation matrix can be directly computed for cases without need of quaternion. The simple framework provides very easy approach of integer-implementation on embedded platforms. Simulations on noise-corrupted point clouds have verified the robustness and computation speed of the proposed method. The final results indicate that the proposed algorithm is accurate, robust and owns over $60\% \sim 80\%$ less computation time than representatives. It has also been applied to real-world applications for faster relative robotic navigation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。