Holmes Steven A, Klein Georg, Murray David W
Department of Engineering Science, University of Oxford, Oxford OX1 3PJ, UK.
IEEE Trans Pattern Anal Mach Intell. 2009 Jul;31(7):1251-63. doi: 10.1109/TPAMI.2008.189.
This paper develops a Square Root Unscented Kalman Filter (SRUKF) for performing video-rate visual simultaneous localization and mapping (SLAM) using a single camera. The conventional UKF has been proposed previously for SLAM, improving the handling of nonlinearities compared with the more widely used Extended Kalman Filter (EKF). However, no account was taken of the comparative complexity of the algorithms: In SLAM, the UKF scales as O(N;{3}) in the state length, compared to the EKF's O(N;{2}), making it unsuitable for video-rate applications with other than unrealistically few scene points. Here, it is shown that the SRUKF provides the same results as the UKF to within machine accuracy and that it can be reposed with complexity O(N;{2}) for state estimation in visual SLAM. This paper presents results from video-rate experiments on live imagery. Trials using synthesized data show that the consistency of the SRUKF is routinely better than that of the EKF, but that its overall cost settles at an order of magnitude greater than the EKF for large scenes.
本文开发了一种平方根无迹卡尔曼滤波器(SRUKF),用于使用单目相机执行视频速率的视觉同步定位与地图构建(SLAM)。传统的无迹卡尔曼滤波器(UKF)此前已被提出用于SLAM,与应用更为广泛的扩展卡尔曼滤波器(EKF)相比,它在处理非线性方面有所改进。然而,此前并未考虑算法的相对复杂度:在SLAM中,UKF的计算量随状态长度呈O(N³) 增长,而EKF为O(N²),这使得UKF不适用于场景点数量并非少到不切实际的视频速率应用。本文表明,SRUKF在机器精度范围内与UKF给出相同结果,并且在视觉SLAM的状态估计中,它可以以O(N²) 的复杂度实现。本文展示了对实时图像进行视频速率实验的结果。使用合成数据的试验表明,SRUKF的一致性通常优于EKF,但对于大场景,其总体计算量比EKF高出一个数量级。