More flexible curve matching via the partial Fréchet similarity (Q2809313)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: More Flexible Curve Matching via the Partial Fréchet Similarity |
scientific article; zbMATH DE number 6586655
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More flexible curve matching via the partial Fréchet similarity |
scientific article; zbMATH DE number 6586655 |
Statements
27 May 2016
0 references
polygonal curves
0 references
Fréchet similarity
0 references
curve matching
0 references
0.8978799
0 references
0.89573085
0 references
0.89573085
0 references
0.89307034
0 references
0.8661457
0 references
More flexible curve matching via the partial Fréchet similarity (English)
0 references
Measuring the similarity of curves has a large variety of applications like, among others, analysis of spectroscopic data in the context of astroinformatics and the analysis of birds' migration trajectories. In this paper a modified version of the partial Fréchet similarity is studied motivated by such applications. In such tasks of curve matching it is often necessary to ignore outliers while dissimilarities regarding individual directions should be weighted by individual costs.NEWLINENEWLINEIn this paper, beside the new extended version of the partial Fréchet similarity, a polynomial-time algorithm that computes an optimal solution of it for two given polygonal curves is also presented. The extension allows both a more flexible compartment of these curves regarding their positioning to each other and a higher potential to approximate partial Fréchet similarity under an arbitrarily chosen \(L_{p}\) metric that is in general not exactly computable over the rational numbers.
0 references