# CLOSURE: Fast Quantification of Pose Uncertainty Sets

arXiv: https://arxiv.org/abs/2403.09990 · HTML: https://mlsanity.com/paper/2403.09990/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Mar 2024.

## Built on by (most cited first, 6 of 6)

- [Adapting Prediction Sets to Distribution Shifts Without Labels](https://mlsanity.com/paper/2406.01416/) (2024)
- [WQLCP: Weighted Adaptive Conformal Prediction for Robust Uncertainty Quantification Under Distribution Shifts](https://mlsanity.com/paper/2505.19587/) (2025)
- [Uncertainty Quantification for Visual Object Pose Estimation: S-Lemma Ellipsoidal Bounds](https://mlsanity.com/paper/2511.21666/) (2025)
- [Deterministic Object Pose Confidence Region Estimation](https://mlsanity.com/paper/2506.22720/) (2025)
- [Achieving widetildeO(1/ε) Sample Complexity for Bilinear Systems Identification under Bounded Noises](https://mlsanity.com/paper/2603.20819/) (2026)
- [Adaptive Geodesic Conformal Prediction for Egocentric Camera Pose Estimation](https://mlsanity.com/paper/2605.00233/) (2026)

## Abstract (arXiv)

We investigate uncertainty quantification of 6D pose estimation from learned noisy measurements (e.g. keypoints and pose hypotheses). Assuming unknown-but-bounded measurement noises, a pose uncertainty set (PURSE) is a subset of SE(3) that contains all possible 6D poses compatible with the measurements. Despite being simple to formulate and its ability to embed uncertainty, the PURSE is difficult to manipulate and interpret due to the many abstract nonconvex polynomial constraints. An appealing simplification of PURSE is to find its minimum enclosing geodesic ball (MEGB), i.e., a point pose estimation with minimum worst-case error bound. We contribute (i) a geometric interpretation of the nonconvex PURSE, and (ii) a fast algorithm to inner approximate the MEGB. Particularly, we show the PURSE corresponds to the feasible set of a constrained dynamical system or the intersection of multiple geodesic balls, and this perspective allows us to design an algorithm to densely sample the boundary of the PURSE through strategic random walks. We then use the miniball algorithm to compute the MEGB of PURSE samples, leading to an inner approximation. Our algorithm is named CLOSURE (enClosing baLl frOm purSe boUndaRy samplEs) and it enables computing a certificate of approximation tightness by calculating the relative size ratio between the inner approximation and the outer approximation. Running on a single RTX 3090 GPU, CLOSURE achieves the relative ratio of 92.8% on the LM-O dataset, 91.4% on the 3DMatch dataset and 96.6% on the LM dataset with the average runtime less than 0.3 second. Obtaining comparable worst-case error bound but 398x 833x and 23.6x faster than the outer approximation GRCC, CLOSURE enables uncertainty quantification of 6D pose estimation to be implemented in real-time robot perception applications.