A Probabilistic Relaxation of the Two-Stage Object Pose Estimation Paradigm
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 42 references that are in the map. First posted on arXiv 1 Jun 2023.
Builds on
21 of 42 references.
References · 21
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017Mask R-CNNcited by 7,259
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,682
- 2022OpenScene: 3D Scene Understanding with Open Vocabulariescited by 556
- 2016Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Agecited by 405
- 2023ConceptFusion: Open-set Multimodal 3D Mappingcited by 302
- 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
- 2021Neural Descriptor Fields: SE(3)-Equivariant Object Representations for Manipulationcited by 204
- 2019Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mappingcited by 181
9 more
- 2019Kaolin: A PyTorch Library for Accelerating 3D Deep Learning Researchcited by 98
- 2019Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejectioncited by 92
- 2018Sampling Can Be Faster Than Optimizationcited by 68
- 2023Object Pose Estimation with Statistical Guarantees: Conformal Keypoint Detection and Geometric Uncertainty Propagationcited by 33
- 2021Self-supervised Geometric Perceptioncited by 26
- 2021Certifiably Optimal Outlier-Robust Geometric Perception: Semidefinite Relaxations and Scalable Global Optimizationcited by 21
- 2021Geometric Fabrics: Generalizing Classical Mechanics to Capture the Physics of Behaviorcited by 17
- 2020Generalized Nonlinear and Finsler Geometry for Roboticscited by 10
- 2020Optimization Fabricscited by 4
Built on by
Not cited yet.