A Geometric Gaussian Mixture Representation of Curves and Trajectories in Euclidean Space

Curves and trajectories in $\mathbb{R}^d$ are basic objects in tracking and sensor data fusion. \acp{GMM} are widely used as flexible parametric \acp{PDF} over the object state space. \acp{GMM} are usually obtained by applying \ac{EM}-based schemes to point samples. When the underlying geometric structure is known deterministically - for example a road centerline in map-assisted tracking, a nominal flight path, or a planned robot trajectory - such iterative fitting is unnecessary, can be slow, and only indirectly reflects the curve or trajectory. We propose a purely arithmetic, geometry-driven construction that maps a curve or trajectory in $\mathbb{R}^d$ with user-defined transverse uncertainty directly to a \ac{GMM} in a single pass, without \ac{EM} or any iterative optimization. Starting from a parametrized curve $\alpha \colon I \to \mathbb{R}^d$, we form a \ac{UDPP} and assign each segment a normal-subspace standard deviation, obtaining thin curve-aligned primitives encoding position, tangent, normal, and length scale together with transverse uncertainty. Choosing component weights proportional to segment length distributes probability uniformly over arc length, so all \ac{GMM} parameters follow directly from the discretized curve and uncertainty profile. The construction applies to smooth, open, closed, non-regular, and self-intersecting curves and trajectories in $\mathbb{R}^d$. It supports adaptive discretization and spatially varying uncertainty and yields differentiable \acp{GMM} that directly encode geometric structure. We demonstrate the approach on canonical planar curves and nominal trajectories and include a simulation study in higher-dimensional Euclidean spaces comparing approximation quality and runtime against \ac{EM}-based fitting. Applications include map- and road-constrained tracking and sensor data fusion, uncertainty-aware trajectory planning, probabilistic obstacle and boundary modeling in robotics, and uncertainty-aware CAD and digital twins.

Authors

Publication Details

Journal
KITopen
Published
2026-11-02
DOI
https://doi.org/10.5445/ir/1000198400
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Geometric Gaussian Mixture Representation of Curves and Trajectories in Euclidean Space

Emadedin Soufian, Ali Darijani, Benedikt Stratmann, Jürgen Beyerer
KITopen
Target Tracking and Data Fusion in Sensor Networks
article

A Geometric Gaussian Mixture Representation of Curves and Trajectories in Euclidean Space

Emadedin Soufian, Ali Darijani, Benedikt Stratmann, Jürgen Beyerer
article en

Abstract

Curves and trajectories in $\mathbb{R}^d$ are basic objects in tracking and sensor data fusion. \acp{GMM} are widely used as flexible parametric \acp{PDF} over the object state space. \acp{GMM} are usually obtained by applying \ac{EM}-based schemes to point samples. When the underlying geometric structure is known deterministically - for example a road centerline in map-assisted tracking, a nominal flight path, or a planned robot trajectory - such iterative fitting is unnecessary, can be slow, and only indirectly reflects the curve or trajectory. We propose a purely arithmetic, geometry-driven construction that maps a curve or trajectory in $\mathbb{R}^d$ with user-defined transverse uncertainty directly to a \ac{GMM} in a single pass, without \ac{EM} or any iterative optimization. Starting from a parametrized curve $\alpha \colon I \to \mathbb{R}^d$, we form a \ac{UDPP} and assign each segment a normal-subspace standard deviation, obtaining thin curve-aligned primitives encoding position, tangent, normal, and length scale together with transverse uncertainty. Choosing component weights proportional to segment length distributes probability uniformly over arc length, so all \ac{GMM} parameters follow directly from the discretized curve and uncertainty profile. The construction applies to smooth, open, closed, non-regular, and self-intersecting curves and trajectories in $\mathbb{R}^d$. It supports adaptive discretization and spatially varying uncertainty and yields differentiable \acp{GMM} that directly encode geometric structure. We demonstrate the approach on canonical planar curves and nominal trajectories and include a simulation study in higher-dimensional Euclidean spaces comparing approximation quality and runtime against \ac{EM}-based fitting. Applications include map- and road-constrained tracking and sensor data fusion, uncertainty-aware trajectory planning, probabilistic obstacle and boundary modeling in robotics, and uncertainty-aware CAD and digital twins.

KITopen
Openalex Percentile: Top 17%
Target Tracking and Data Fusion in Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon