Log In Sign Up

Similarity of Polygonal Curves in the Presence of Outliers

The Fréchet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of outliers. Since the presence of outliers is a frequently occurring phenomenon in practice, a robust variant of Fréchet distance is required which absorbs outliers. We study such a variant here. In this modified variant, our objective is to minimize the length of subcurves of two polygonal curves that need to be ignored (MinEx problem), or alternately, maximize the length of subcurves that are preserved (MaxIn problem), to achieve a given Fréchet distance. An exact solution to one problem would imply an exact solution to the other problem. However, we show that these problems are not solvable by radicals over Q and that the degree of the polynomial equations involved is unbounded in general. This motivates the search for approximate solutions. We present an algorithm, which approximates, for a given input parameter δ, optimal solutions for the and problems up to an additive approximation error δ times the length of the input curves. The resulting running time is upper bounded by O(n^3/δ(n/δ)), where n is the complexity of the input polygonal curves.


page 1

page 2

page 3

page 4


On Computing the k-Shortcut Fréchet Distance

The Fréchet distance is a popular measure of dissimilarity for polygonal...

Random projections and sampling algorithms for clustering of high-dimensional polygonal curves

We study the center and median clustering problems for high-dimensional ...

Approximating (k,ℓ)-Median Clustering for Polygonal Curves

In 2015, Driemel, Krivošija and Sohler introduced the (k,ℓ)-median probl...

FRESH: Fréchet Similarity with Hashing

Massive datasets of curves, such as time series and trajectories, are co...

Faster Approximate Covering of Subcurves under the Fréchet Distance

Subtrajectory clustering is an important variant of the trajectory clust...

Estimation via length-constrained generalized empirical principal curves under small noise

In this paper, we propose a method to build a sequence of generalized em...

On Flipping the Fréchet distance

The classical and extensively-studied Fréchet distance between two curve...