Frederik Brüning
YOU?
Author Swipe
View article: On the number of iterations of the DBA algorithm
On the number of iterations of the DBA algorithm Open
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point sequence that minimises the sum of dynamic time warping dist…
View article: On the number of iterations of the DBA algorithm
On the number of iterations of the DBA algorithm Open
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point sequence that minimises the sum of dynamic time warping dist…
View article: Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures
Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures Open
We study range spaces, where the ground set consists of either polygonal curves in $\mathbb{R}^d$ or polygonal regions in the plane that may contain holes and the ranges are balls defined by an elastic distance measure, such as the Hausdor…
View article: Faster Approximate Covering of Subcurves under the Fréchet Distance
Faster Approximate Covering of Subcurves under the Fréchet Distance Open
Subtrajectory clustering is an important variant of the trajectory clustering problem, where the start and endpoints of trajectory patterns within the collected trajectory data are not known in advance. We study this problem in the form of…
View article: Covering a Curve with Subtrajectories.
Covering a Curve with Subtrajectories. Open
We study subtrajectory clustering under the Frechet distance. Given a polygonal curve $P$ with $n$ vertices, and parameters $k$ and $\ell$, the goal is to find $k$ center curves of complexity at most $\ell$ such that every point on $P$ is …
View article: Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves
Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves Open
We study subtrajectory clustering under the Fréchet distance. Given one or more trajectories, the task is to split the trajectories into several parts, such that the parts have a good clustering structure. We approach this problem via a ne…