Mercurial > hg > match-vamp
view src/DistanceMetric.cpp @ 143:6914a6a01ffc refactors
Transplant the distance metric parameter structure from silence_penalty branch (even though normalisation is currently the only thing in it)
author | Chris Cannam |
---|---|
date | Fri, 16 Jan 2015 10:18:00 +0000 |
parents | cfba9aec7569 |
children | ecfb4ada171b |
line wrap: on
line source
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */ /* Vamp feature extraction plugin using the MATCH audio alignment algorithm. Centre for Digital Music, Queen Mary, University of London. This file copyright 2007 Simon Dixon, Chris Cannam and QMUL. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. See the file COPYING included with this distribution for more information. */ #include "DistanceMetric.h" #include <cassert> #include <cmath> #include <iostream> using namespace std; //#define DEBUG_DISTANCE_METRIC 1 DistanceMetric::DistanceMetric(Parameters params) : m_params(params) { #ifdef DEBUG_DISTANCE_METRIC cerr << "*** DistanceMetric: norm = " << m_params.norm << endl; #endif } double DistanceMetric::calcDistance(const vector<double> &f1, const vector<double> &f2) { double d = 0; double sum1 = 0; double sum2 = 0; double sum = 0; int featureSize = f1.size(); assert(int(f2.size()) == featureSize); for (int i = 0; i < featureSize; i++) { d += fabs(f1[i] - f2[i]); sum1 += fabs(f1[i]); sum2 += fabs(f2[i]); } sum = sum1 + sum2; if (sum == 0) { return 0; } double distance = 0; if (m_params.norm == NormaliseDistanceToSum) { distance = d / sum; // 0 <= d/sum <= 2 } else if (m_params.norm == NormaliseDistanceToLogSum) { // note if this were to be restored, it would have to use // totalEnergies vector instead of f1[freqMapSize] which used to // store the total energy: // double weight = (5 + Math.log(f1[freqMapSize] + f2[freqMapSize]))/10.0; double weight = (8 + log(sum)) / 10.0; if (weight < 0) weight = 0; else if (weight > 1) weight = 1; distance = d / sum * weight; } else { distance = d; } return distance; }