A multi-frame graph matching algorithm for low-bandwidth RGB-D SLAM
This paper presents a novel multi-frame graph matching algorithm for reliable partial alignments among point clouds. We use this algorithm to stitch frames for 3D environment reconstruction. The idea is to utilize both descriptor similarity and mutual spatial coherency of features existed in multiple frames to match these frames. The proposed multi-frame matching algorithm can extract coarse correspondence among multiple point clouds more reliably than pairwise matching algorithms, especially when the data are noisy and the overlap is relatively small. When there are insufficient consistent features that appeared in all these frames, our algorithm reduces the number of frames to match to deal with it adaptively. Hence, it is particularly suitable for cost-efficient robotic Simultaneous Localization and Mapping (SLAM). We design a prototype system integrating our matching and reconstruction algorithm on a remotely controlled navigation iRobot, equipped with a Kinect and a Raspberry Pi. Our reconstruction experiments demonstrate the effectiveness of our algorithm and design.
Publication Source (Journal or Book title)
CAD Computer Aided Design
Zheng, S., Hong, J., Zhang, K., Li, B., & Li, X. (2016). A multi-frame graph matching algorithm for low-bandwidth RGB-D SLAM. CAD Computer Aided Design, 78, 107-117. https://doi.org/10.1016/j.cad.2016.05.009