Results of the break-out group: Similarity measures

Representation, Analysis and Visualization of Moving Objects

计算机科学;物理学;数学

Joachim Gudmundsson ; Harvey Miller ; Rodrigo Silveira ; Mathias Versichele ; Stefan van der Spek

Others  :  http://drops.dagstuhl.de/opus/volltexte/2011/2989/pdf/10491.SWM.ExtAbstract.2989.pdf
PID  :  26538

学科分类：计算机科学（综合）

来源: CEUR

【 摘 要 】

Many of the fundamental problems in trajectory analysis have one issue in common, namely calculating the similarity between two (sub)trajectories. Simplified, the problem is as follows. Given two (polygonal) curves P and Q, one would like to match them up in an optimal way (i.e., find a continuous mapping from the points of P to the points of Q, so that the mapping maps the endpoints of one curve to the endpoints of the other curve). Such a mapping is especially useful if it is associated with an appropriate metric between curves.[First Paragraph]