Skip to main navigation Skip to search Skip to main content

A multi-frame graph matching algorithm for low-bandwidth RGB-D SLAM

  • Louisiana State University

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)107-117
Number of pages11
JournalCAD Computer Aided Design
Volume78
DOIs
StatePublished - 1 Sep 2016

Keywords

  • Low-bandwidth SLAM
  • Multi-frame graph matching
  • Partial matching
  • RGB-D reconstruction

Fingerprint

Dive into the research topics of 'A multi-frame graph matching algorithm for low-bandwidth RGB-D SLAM'. Together they form a unique fingerprint.

Cite this