Search arXivSearch

arXiv · 1707.00532

Approximation of probability density functions on the Euclidean group parametrized by dual quaternions

Abstract

Perception is fundamental to many robot application areas especially in service robotics. Our aim is to perceive and model an unprepared kitchen scenario with many objects. We start with the perception of a single target object. The modeling relies especially on fusing and merging of weak information from the sensors of the robot in order to localize objects. This requires the representation of various probability distributions of pose in $S_3 \times \mathbb{R}^3$ as orientation and position have to be localized. In this thesis I present a framework for probabilistic modeling of poses in $S_3 \times \mathbb{R}^3$ that represents a large class of probability distributions and provides among others the operations of the fusion and the merge of estimates. Further it offers the propagation of uncertain information data. I work out why we choose to represent the orientation part of a pose by a unit quaternion. The translation part is described either by a 3-dimensional vector or by a purely imaginary quaternion. This depends on whether we define the probability density function or whether we want to represent a transformation which consists of a rotation and a translation by a dual quaternion. A basic probability den- sity function over the poses is defined by a tangent point on the hypersphere and a 6-dimensional Gaussian distribution. The hypersphere is embedded to the R4 which is representing a unit quaternions whereas the Gaussian is defined over the product of the tangent space of the sphere and of the space of translations. The projection of this Gaussian to the hypersphere induces a distribution over poses in $S_3 \times \mathbb{R}^3$. The set of mixtures of projected Gaussians can approximate the probability density functions that arise in our application. Moreover it is closed under the operations introduced in this framework and allows for an efficient implementation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muriel Lang. 2017-06-28. Approximation of probability density functions on the Euclidean group parametrized by dual quaternions. https://arxiv.org/abs/1707.00532

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Conditional Distributional Treatment Effects: Doubly Robust Estimation and Testing

Beyond conditional average treatment effects, treatments may impact the entire outcome distribution in covariate-dependent ways, for example, by altering the variance or tail risks for specific subpopulations. We propose a novel estimand to capture such conditional distributional treatment effects, and develop a doubly robust estimator that is minimax optimal in the local asymptotic sense. Using this, we develop a test for the global homogeneity of conditional potential outcome distributions that accommodates discrepancies beyond the maximum mean discrepancy (MMD), has provably valid type 1 error, and is consistent against fixed alternatives---the first test, to our knowledge, with such guarantees in this setting. We then provide a test that aggregates evidence across a grid of kernel-bandwidth choices. Furthermore, we derive exact closed-form expressions for two natural discrepancies (including the MMD), and provide a computationally efficient, permutation-free algorithm for our test.

stat.ML

Flow Matching for Count Data

High-dimensional count data arise in applications such as single-cell RNA sequencing and neural spike trains, where mappings between distributions across successive batches or time points form critical components of data analysis. The recent success of diffusion- and flow-based deep generative models for images, video, and text motivates extending these ideas to count-valued settings, but many existing methods either treat each count as a categorical state or transform counts into a continuous space, neither of which is natural or efficient when the count range is large. We propose count-FM, a flow-matching framework for count data based on a continuous-time birth-death process with local unit jumps. Count-FM learns marginal transitions efficiently in count space through simulation-free training of conditional transition rates, allowing transport between arbitrary count-distributed source and target populations. In simulation, count-FM variants achieve strong sample quality while using substantially fewer parameters. We further apply count-FM to scRNA-seq and neural spike-train data for unconditional generation, transport, and conditional generation. Across these tasks, count-FM yields improved sample quality, greater modeling efficiency, and interpretable transport paths.

stat.ML

Chaos Is a LADDER: Domain Generalization Beyond Invariance via Reweighting

Domain generalization (DG) aims to learn from multiple source domains and generalize to unseen target domains. Most DG methods pursue invariance: they seek a causal representation whose prediction rule is invariant across domains. This principle is effective when the causal mechanism is stable, but becomes restrictive when the domain itself modulates how causal content maps to the response. In this case, directly feeding domain style into the predictor can create misleading shortcuts, since style does not by itself cause the response. Yet the apparent chaos of multiple styles can become a ladder: style can locate the unseen target domain among source domains and guide which domain-dependent prediction rules should be trusted. We propose \emph{Latent Adaptive Domain Disentanglement and Environment Reweighting} (LADDER), a fixed-model DG pipeline that learns causal/style representations, freezes the encoders, fits source-specific classifiers, and uses an unlabeled target-domain covariate set only at inference to compute weights over these fixed classifiers, with no target labels or model-state updates. We establish theoretical guarantees for source reweighting and validate LADDER on simulations, FMoW, and a location-grouped iWildCam protocol, with gains in overall and group-averaged accuracy.

stat.ML