Marcus Baum

Marcus Baum, Uwe D. Hanebeck

We present a novel method called Kernel-SME filter for tracking multiple targets when the association of the measurements to the targets is unknown. The method is a further development of the Symmetric Measurement Equation (SME) filter, which removes the data association uncertainty of the original measurement equation with the help of a symmetric transformation. The underlying idea of the Kernel-SME filter is to construct a symmetric transformation by means of mapping the measurements to a Gaussian mixture. This transformation is scalable to a large number of targets and allows for deriving a Gaussian state estimator that has a cubic time complexity in the number of targets.

Shishan Yang, Marcus Baum

In this paper, we propose a novel method for estimating an elliptic shape approximation of a moving extended object that gives rise to multiple scattered measurements per frame. For this purpose, we parameterize the elliptic shape with its orientation and the lengths of the semi-axes. We relate an individual measurement with the ellipse parameters by means of a multiplicative noise model and derive a second-order extended Kalman filter for a closed-form recursive measurement update. The benefits of the new method are discussed by means of Monte Carlo simulations for both static and dynamic scenarios.

Laura M. Wolf, Marcus Baum

Herding is a technique to sequentially generate deterministic samples from a probability distribution. In this work, we propose a continuous herded Gibbs sampler that combines kernel herding on continuous densities with the Gibbs sampling idea. Our algorithm allows for deterministically sampling from high-dimensional multivariate probability densities, without directly sampling from the joint density. Experiments with Gaussian mixture densities indicate that the L2 error decreases similarly to kernel herding, while the computation time is significantly lower, i.e., linear in the number of dimensions.

Kolja Thormann, Marcus Baum

This paper considers the fusion of multiple estimates of a spatially extended object, where the object extent is modeled as an ellipse parameterized by the orientation and semiaxes lengths. For this purpose, we propose a novel systematic approach that employs a distance measure for ellipses, i.e., the Gaussian Wasserstein distance, as a cost function. We derive an explicit approximate expression for the Minimum Mean Gaussian Wasserstein distance (MMGW) estimate. Based on the concept of a MMGW estimator, we develop efficient methods for the fusion of extended target estimates. The proposed fusion methods are evaluated in a simulated experiment and the benefits of the novel methods are discussed.

Karl Granstrom, Marcus Baum, Stephan Reuter

This article provides an elaborate overview of current research in extended object tracking. We provide a clear definition of the extended object tracking problem and discuss its delimitation to other types of object tracking. Next, different aspects of extended object modelling are extensively discussed. Subsequently, we give a tutorial introduction to two basic and well used extended object tracking approaches - the random matrix approach and the Kalman filter-based approach for star-convex shapes. The next part treats the tracking of multiple extended objects and elaborates how the large number of feasible association hypotheses can be tackled using both Random Finite Set (RFS) and Non-RFS multi-object trackers. The article concludes with a summary of current applications, where four example applications involving camera, X-band radar, light detection and ranging (lidar), red-green-blue-depth (RGB-D) sensors are highlighted.