I'm glad to inform that I already have a very very (once again very!) rough version of the DTW object. It's already measuring the distance between two series of numbers - although I have some doubts about the inlets, if I should receive the values as an array or list (currently list, because I didn't knew how to manipulate arrays - this is my first external). <br>
<br>I should post a alpha version when the code is more cleaned up. The implementation of the DTW iteself is based on Andrew Slater/John Coleman's code.<br><br>best regards,<br>Pedro<br><br><div class="gmail_quote">On Fri, Apr 30, 2010 at 6:39 PM, Pedro Lopes <span dir="ltr"><<a href="mailto:pedro.lopes@ist.utl.pt">pedro.lopes@ist.utl.pt</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hello, I'm trying to do a small project, for which I need an implementation of the DTW [1] (Dynamic Time Warping) algorithm. It takes to series of values and measures the similarity between them, considering that they can vary time or speed.<div>
<div><br></div>
<div>I've done a few searches but seems to be impossible to find a DTW external for Pd, is there one?</div><div><br></div><div>On the SMC2009 conference, a paper[2] was presented where they stated that they used DTW under Pd but I couldn't find their implementation anywhere (nor received feedback from the authors still). Also there is a reference to a Max/MSP implementation by Olaf Matthes [3] but once again... cannot find a Pd version.</div>
<div><br></div><div>So if anyone can be of help in this search for DTW inside Pd, it would be most helpful. </div><div><br></div><div>p.s.: As far as C alike implementations, I found this in C [4] and this C++ lib [5] seems to use a DTW implementation too.</div>
<div><br></div><div>[1] <a href="http://en.wikipedia.org/wiki/Dynamic_time_warping" target="_blank">http://en.wikipedia.org/wiki/Dynamic_time_warping</a></div><div>[2] <a href="http://smc2009.smcnetwork.org/programme/pdfs/321.pdf" target="_blank">http://smc2009.smcnetwork.org/programme/pdfs/321.pdf</a></div>
<div>[3] <a href="http://maxobjects.com/?v=authors&id_auteur=39" target="_blank">http://maxobjects.com/?v=authors&id_auteur=39</a><br><div class="gmail_quote"><div>[4] <a href="http://www.phon.ox.ac.uk/files/slp/Extras/dtw.html" target="_blank">http://www.phon.ox.ac.uk/files/slp/Extras/dtw.html</a></div>
<div>
[5] <a href="http://code.google.com/p/lbimproved/" target="_blank">http://code.google.com/p/lbimproved/</a></div><div><a href="http://code.google.com/p/lbimproved/" target="_blank"></a><br>-- <br>Pedro Lopes<br>contacto: <a href="mailto:jazz@radiozero.pt" target="_blank">jazz@radiozero.pt</a><br>
website: <a href="http://web.ist.utl.pt/Pedro.Lopes" target="_blank">http://web.ist.utl.pt/Pedro.Lopes</a> <br>
</div>
</div><br><br clear="all"><br>-- <br>Pedro Lopes<br>contacto: <a href="mailto:jazz@radiozero.pt" target="_blank">jazz@radiozero.pt</a><br>website: <a href="http://web.ist.utl.pt/Pedro.Lopes" target="_blank">http://web.ist.utl.pt/Pedro.Lopes</a> <br>
</div></div>
</blockquote></div><br><br clear="all"><br>-- <br>Pedro Lopes<br>contacto: <a href="mailto:jazz@radiozero.pt">jazz@radiozero.pt</a><br>website: <a href="http://web.ist.utl.pt/Pedro.Lopes">http://web.ist.utl.pt/Pedro.Lopes</a> <br>