Differences

This shows you the differences between two versions of the page.

--- sift:dynamic_time_warping:dynamic_time_warping [2024/07/17 15:10] – sgranger
+++ sift:dynamic_time_warping:dynamic_time_warping [2024/11/15 20:13] (current) – [Dynamic Time Warping] wikisysop
@@ Line 1: / Line 1: @@
-====== Dynamic_Time_Warping ======
+====== Dynamic Time Warping ======
-Dynamic Time warping is a distance based algorithm that allows you to compare and measure similarity between two time based sequences, by minimizing the Euclidean distance between points. Essentially, it aligns each point of one trace to a corresponding point on the other trace that require the least distance. All distances are added together to make the total cost function of the trace. The large the cost function, the less similar the two traces are. This can be useful when trying to identify a singular trace or to find outliers. To review supporting literature, see [[[https://ieeexplore.ieee.org/document/7023364%7Chere|[1]]]].
+Dynamic Time warping is a distance based algorithm that allows you to compare and measure similarity between two time based sequences, by minimizing the Euclidean distance between points. Essentially, it aligns each point of one trace to a corresponding point on the other trace that require the least distance. All distances are added together to make the total cost function of the trace. The larger the cost function, the less similar the two traces are. This can be useful when trying to identify a singular trace or to find outliers. To review supporting literature, see [[https://ieeexplore.ieee.org/document/7023364|[1]]].
 {{:DTWAlign.png}}
-==== Contents ====
-  * [[#Mathematics_of_Dynamic_Time_Warping|1 Mathematics of Dynamic Time Warping]]
-  * [[#Computing_Dynamic_Time_Warping_in_Sift|2 Computing Dynamic Time Warping in Sift]]
-    * [[#Exporting_Results|2.1 Exporting Results]]
-  * [[#References|3 References]]
 ==== Mathematics of Dynamic Time Warping ====