# HG changeset patch
# User cannam
# Date 1200667220 0
# Node ID dfe38135e4c72f1d384ea2d20062b6e4fbe5a9d0
# Parent  a251fb0de594051cb59ea2c7bf423af96f024e76
* Add cosine distance and the self-similarity matrix used for SB rhythmic
  similarity
* Pull out SB timbral similarity KL divergence into its own file

diff -r a251fb0de594 -r dfe38135e4c7 dsp/rhythm/BeatSpectrum.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/dsp/rhythm/BeatSpectrum.cpp	Fri Jan 18 14:40:20 2008 +0000
@@ -0,0 +1,55 @@
+/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
+
+/*
+    QM DSP Library
+
+    Centre for Digital Music, Queen Mary, University of London.
+    This file copyright 2008 Kurt Jacobson and QMUL.
+    All rights reserved.
+*/
+
+#include "BeatSpectrum.h"
+
+#include "maths/CosineDistance.h"
+
+using std::vector;
+
+vector<double> BeatSpectrum::process(const vector<vector<double> > &m)
+{
+    int origin = 0;
+    int sz = m.size()/2;
+
+    int i, j, k;
+
+    vector<double> v(sz);
+    for (i = 0; i < sz; ++i) v[i] = 0.0;
+
+    CosineDistance cd;
+
+    for (i = origin; i < origin + sz; ++i) {
+
+        k = 0;
+
+        for (j = i + 1; j < i + sz + 1; ++j) {
+
+            v[k++] += cd.distance(m[i], m[j]);
+        }
+    }
+
+    // normalize
+
+    double max = 0.0;
+
+    for (i = 0; i < sz; ++i) {
+        if (v[i] > max) max = v[i];
+    }
+
+    if (max > 0.0) {
+        for (i = 0; i < sz; ++i) {
+            v[i] /= max;
+        }
+    }
+
+    return v;
+}
+
diff -r a251fb0de594 -r dfe38135e4c7 dsp/rhythm/BeatSpectrum.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/dsp/rhythm/BeatSpectrum.h	Fri Jan 18 14:40:20 2008 +0000
@@ -0,0 +1,35 @@
+/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
+
+/*
+    QM DSP Library
+
+    Centre for Digital Music, Queen Mary, University of London.
+    This file copyright 2008 Kurt Jacobson and QMUL.
+    All rights reserved.
+*/
+
+#ifndef BEATSPECTRUM_H
+#define BEATSPECTRUM_H
+
+#include <vector>
+
+/**
+ * Given a matrix of "feature values", calculate a self-similarity
+ * vector.  The resulting vector will have half as many elements as
+ * the number of columns in the matrix.  This is based on the
+ * SoundBite rhythmic similarity code.
+ */
+
+class BeatSpectrum
+{
+public:
+    BeatSpectrum();
+    ~BeatSpectrum();
+
+    std::vector<double> process(const std::vector<std::vector<double> > &inmatrix);
+
+};
+
+#endif
+
+
diff -r a251fb0de594 -r dfe38135e4c7 maths/CosineDistance.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/maths/CosineDistance.cpp	Fri Jan 18 14:40:20 2008 +0000
@@ -0,0 +1,47 @@
+/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
+
+/*
+    QM DSP Library
+
+    Centre for Digital Music, Queen Mary, University of London.
+    This file copyright 2008 Kurt Jacobson.
+    All rights reserved.
+*/
+
+#include "CosineDistance.h"
+
+#include <iostream>
+#include <limits>
+
+using std::cerr;
+
+double CosineDistance::distance(const vector<double> &v1,
+                                const vector<double> &v2)
+{
+    dist = 1.0; dDenTot = 0; dDen1 = 0; dDen2 = 0; dSum1 =0;
+
+    //check if v1, v2 same size
+    if (v1.size() != v2.size())
+    {
+        cerr << "CosineDistance::distance: ERROR: vectors not the same size\n";
+        return 1.0;
+    }
+    else
+    {
+        for(int i=0; i<v1.size(); i++)
+        {
+            dSum1 += v1[i]*v2[i];
+            dDen1 += v1[i]*v1[i];
+            dDen2 += v2[i]*v2[i];
+        }
+        dDenTot = sqrt(fabs(dDen1*dDen2));
+        if(dDenTot == 0)
+        {
+            cerr << "CosineDistance::distance: WARNING: dividing by zero in cosine dist\n";
+            return 1.0;
+        }
+	
+        dist = 1-((dSum1)/dDenTot);
+        return dist;
+    }
+}
diff -r a251fb0de594 -r dfe38135e4c7 maths/CosineDistance.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/maths/CosineDistance.h	Fri Jan 18 14:40:20 2008 +0000
@@ -0,0 +1,32 @@
+/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
+
+/*
+    QM DSP Library
+
+    Centre for Digital Music, Queen Mary, University of London.
+    This file copyright 2008 Kurt Jacobson.
+    All rights reserved.
+*/
+
+#ifndef COSINEDISTANCE_H
+#define COSINEDISTANCE_H
+
+#include <vector>
+#include <math.h>
+
+using std::vector;
+
+class CosineDistance
+{
+public:
+    CosineDistance() { }
+    ~CosineDistance() { }
+
+    double distance(const vector<double> &v1, const vector<double> &v2);
+
+protected:
+    double dist, dDenTot, dDen1, dDen2, dSum1;
+};
+
+#endif
+
diff -r a251fb0de594 -r dfe38135e4c7 maths/KLDivergence.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/maths/KLDivergence.cpp	Fri Jan 18 14:40:20 2008 +0000
@@ -0,0 +1,30 @@
+/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
+
+/*
+    QM DSP Library
+
+    Centre for Digital Music, Queen Mary, University of London.
+    This file copyright 2008 QMUL
+    All rights reserved.
+*/
+
+#include "KLDivergence.h"
+
+double KLDivergence::distance(const vector<double> &m1,
+			      const vector<double> &v1,
+			      const vector<double> &m2,
+			      const vector<double> &v2)
+{
+    int sz = m1.size();
+
+    double d = -2.0 * sz;
+
+    for (int k = 0; k < sz; ++k) {
+        d += v1[k] / v2[k] + v2[k] / v1[k];
+        d += (m1[k] - m2[k]) * (1.0 / v1[k] + 1.0 / v2[k]) * (m1[k] - m2[k]);
+    }
+
+    d /= 2.0;
+
+    return d;
+}
diff -r a251fb0de594 -r dfe38135e4c7 maths/KLDivergence.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/maths/KLDivergence.h	Fri Jan 18 14:40:20 2008 +0000
@@ -0,0 +1,37 @@
+/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
+
+/*
+    QM DSP Library
+
+    Centre for Digital Music, Queen Mary, University of London.
+    This file copyright 2008 QMUL
+    All rights reserved.
+*/
+
+#ifndef KLDIVERGENCE_H
+#define KLDIVERGENCE_H
+
+#include <vector>
+
+using std::vector;
+
+/**
+ * Calculate a symmetrised Kullback-Leibler divergence of Gaussian
+ * models based on mean and variance vectors.  All input vectors must
+ * be of equal size.
+ */
+
+class KLDivergence
+{
+public:
+    KLDivergence() { }
+    ~KLDivergence() { }
+
+    double distance(const vector<double> &means1,
+		    const vector<double> &variances1,
+		    const vector<double> &means2,
+		    const vector<double> &variances2);
+};
+
+#endif
+
diff -r a251fb0de594 -r dfe38135e4c7 qm-dsp.pro
--- a/qm-dsp.pro	Fri Jan 18 13:24:12 2008 +0000
+++ b/qm-dsp.pro	Fri Jan 18 14:40:20 2008 +0000
@@ -31,6 +31,7 @@
            dsp/onsets/PeakPicking.h \
            dsp/phasevocoder/PhaseVocoder.h \
            dsp/rateconversion/Decimator.h \
+           dsp/rhythm/BeatSpectrum.h \
            dsp/segmentation/cluster_melt.h \
            dsp/segmentation/ClusterMeltSegmenter.h \
            dsp/segmentation/cluster_segmenter.h \
@@ -48,7 +49,9 @@
            dsp/transforms/FFT.h \
            hmm/hmm.h \
            maths/Correlation.h \
+           maths/CosineDistance.h \
            maths/Histogram.h \
+           maths/KLDivergence.h \
            maths/MathAliases.h \
            maths/MathUtilities.h \
            maths/Polyfit.h \
@@ -63,6 +66,7 @@
            dsp/onsets/PeakPicking.cpp \
            dsp/phasevocoder/PhaseVocoder.cpp \
            dsp/rateconversion/Decimator.cpp \
+           dsp/rhythm/BeatSpectrum.cpp \
            dsp/segmentation/cluster_melt.c \
            dsp/segmentation/ClusterMeltSegmenter.cpp \
            dsp/segmentation/cluster_segmenter.c \
@@ -79,5 +83,7 @@
            dsp/transforms/FFT.cpp \
            hmm/hmm.c \
            maths/Correlation.cpp \
+           maths/CosineDistance.cpp \
+           maths/KLDivergence.cpp \
            maths/MathUtilities.cpp \
            maths/pca/pca.c