A Probabilistic Relaxation of the Two-Stage Object Pose Estimation Paradigm

Onur Beker
6/1/2023
cs.ROcs.CV

No confident code implementation found for this paper.

Abstract

Existing object pose estimation methods commonly require a one-to-one point matching step that forces them to be separated into two consecutive stages: visual correspondence detection (e.g., by matching feature descriptors as part of a perception front-end) followed by geometric alignment (e.g., by optimizing a robust estimation objective for pointcloud registration or perspective-n-point). Instead, we propose a matching-free probabilistic formulation with two main benefits: i) it enables unified and concurrent optimization of both visual correspondence and geometric alignment, and ii) it can represent different plausible modes of the entire distribution of likely poses. This in turn allows for a more graceful treatment of geometric perception scenarios where establishing one-to-one matches between points is conceptually ill-defined, such as textureless, symmetrical and/or occluded objects and scenes where the correct pose is uncertain or there are multiple equally valid solutions.

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{beker2023probabilistic,
  title  = {A Probabilistic Relaxation of the Two-Stage Object Pose Estimation Paradigm},
  author = {Onur Beker},
  year   = {2023},
  eprint = {2306.00892},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.00892v1}
}

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

Discussion