/* Copyright (c) 2014, Calder Phillips-Grafflin (calder.pg@gmail.com) All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include #include #include "math.h" #include #include #include #include "string.h" #include #include #include #include #include using namespace DTW; SimpleDTW::SimpleDTW (csnd::Csound* csound, size_t x_size, size_t y_size, int mfcc_bands, MYFLT (*distance_fn)(MYFLT* p1, MYFLT* p2, int bands)) { distance_fn_ = distance_fn; this->mfcc_bands = mfcc_bands; x_dim_ = x_size + 1; y_dim_ = y_size + 1; // Resize the data data_ = (MYFLT*) csound->malloc(sizeof(MYFLT) * x_dim_ * y_dim_); //Populate matrix with starting values SetInDTWMatrix(0, 0, 0.0); for (size_t i = 1; i < x_dim_; i++) { SetInDTWMatrix(i, 0, INFINITY); } for (size_t i = 1; i < y_dim_; i++) { SetInDTWMatrix(0, i, INFINITY); } } double SimpleDTW::EvaluateWarpingCost(MYFLT* sequence_1, int seq1_items, MYFLT* sequence_2, int seq2_items) { //Compute DTW cost for the two sequences for (unsigned int i = 1; i <= seq1_items; i++) { for (unsigned int j = 1; j <= seq2_items; j++) { double index_cost = distance_fn_(sequence_1 + (i - 1), sequence_2 + (j - 1), mfcc_bands); double prev_cost = 0.0; // Get the three neighboring values from the matrix to use for the update double im1j = GetFromDTWMatrix(i - 1, j); double im1jm1 = GetFromDTWMatrix(i - 1, j - 1); double ijm1 = GetFromDTWMatrix(i, j - 1); // Start the update step if (im1j < im1jm1 && im1j < ijm1) { prev_cost = im1j; } else if (ijm1 < im1j && ijm1 < im1jm1) { prev_cost = ijm1; } else { prev_cost = im1jm1; } // Update the value in the matrix SetInDTWMatrix(i, j, index_cost + prev_cost); } } //Return total path cost return GetFromDTWMatrix(seq1_items, seq2_items); }