Correspondence-Free Pose Estimation with Patterns: A Unified Approach for Multi-Dimensional Vision

Quan Quan, Dun Dai
2/26/2025
cs.CVcs.RO

No confident code implementation found for this paper.

Abstract

6D pose estimation is a central problem in robot vision. Compared with pose estimation based on point correspondences or its robust versions, correspondence-free methods are often more flexible. However, existing correspondence-free methods often rely on feature representation alignment or end-to-end regression. For such a purpose, a new correspondence-free pose estimation method and its practical algorithms are proposed, whose key idea is the elimination of unknowns by process of addition to separate the pose estimation from correspondence. By taking the considered point sets as patterns, feature functions used to describe these patterns are introduced to establish a sufficient number of equations for optimization. The proposed method is applicable to nonlinear transformations such as perspective projection and can cover various pose estimations from 3D-to-3D points, 3D-to-2D points, and 2D-to-2D points. Experimental results on both simulation and actual data are presented to demonstrate the effectiveness of the proposed method.

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{quan2025correspondencefree,
  title  = {Correspondence-Free Pose Estimation with Patterns: A Unified Approach for Multi-Dimensional Vision},
  author = {Quan Quan and Dun Dai},
  year   = {2025},
  eprint = {2503.00051},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.00051v1}
}

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

Discussion