Semi-supervised Vector-Quantization in Visual SLAM using HGCN

Amir Zarringhalam, Saeed Shiry Ghidary, Ali Mohades Khorasani
7/14/2022
cs.CVcs.RO

No confident code implementation found for this paper.

Abstract

In this paper, two semi-supervised appearance based loop closure detection technique, HGCN-FABMAP and HGCN-BoW are introduced. Furthermore an extension to the current state of the art localization SLAM algorithm, ORB-SLAM, is presented. The proposed HGCN-FABMAP method is implemented in an off-line manner incorporating Bayesian probabilistic schema for loop detection decision making. Specifically, we let a Hyperbolic Graph Convolutional Neural Network (HGCN) to operate over the SURF features graph space, and perform vector quantization part of the SLAM procedure. This part previously was performed in an unsupervised manner using algorithms like HKmeans, kmeans++,..etc. The main Advantage of using HGCN, is that it scales linearly in number of graph edges. Experimental results shows that HGCN-FABMAP algorithm needs far more cluster centroids than HGCN-ORB, otherwise it fails to detect loop closures. Therefore we consider HGCN-ORB to be more efficient in terms of memory consumption, also we conclude the superiority of HGCN-BoW and HGCN-FABMAP with respect to other algorithms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zarringhalam2022semisupervised,
  title  = {Semi-supervised Vector-Quantization in Visual SLAM using HGCN},
  author = {Amir Zarringhalam and Saeed Shiry Ghidary and Ali Mohades Khorasani},
  year   = {2022},
  eprint = {2207.06738},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.06738v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.06738.svg)](https://codeofpaper.com/paper/2207.06738)

Discussion