Hierarchical Attention and Graph Neural Networks: Toward Drift-Free Pose Estimation

Kathia Melbouci, Fawzi Nashashibi
9/18/2023
cs.CVcs.LGcs.RO

No confident code implementation found for this paper.

Abstract

The most commonly used method for addressing 3D geometric registration is the iterative closet-point algorithm, this approach is incremental and prone to drift over multiple consecutive frames. The Common strategy to address the drift is the pose graph optimization subsequent to frame-to-frame registration, incorporating a loop closure process that identifies previously visited places. In this paper, we explore a framework that replaces traditional geometric registration and pose graph optimization with a learned model utilizing hierarchical attention mechanisms and graph neural networks. We propose a strategy to condense the data flow, preserving essential information required for the precise estimation of rigid poses. Our results, derived from tests on the KITTI Odometry dataset, demonstrate a significant improvement in pose estimation accuracy. This improvement is especially notable in determining rotational components when compared with results obtained through conventional multi-way registration via pose graph optimization. The code will be made available upon completion of the review process.

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{melbouci2023hierarchical,
  title  = {Hierarchical Attention and Graph Neural Networks: Toward Drift-Free Pose Estimation},
  author = {Kathia Melbouci and Fawzi Nashashibi},
  year   = {2023},
  eprint = {2309.09934},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.09934v1}
}

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/2309.09934.svg)](https://codeofpaper.com/paper/2309.09934)

Discussion