Chris@34: /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
Chris@34: 
Chris@34: /*
Chris@34:   Silvet
Chris@34: 
Chris@34:   A Vamp plugin for note transcription.
Chris@34:   Centre for Digital Music, Queen Mary University of London.
Chris@34:     
Chris@34:   This program is free software; you can redistribute it and/or
Chris@34:   modify it under the terms of the GNU General Public License as
Chris@34:   published by the Free Software Foundation; either version 2 of the
Chris@34:   License, or (at your option) any later version.  See the file
Chris@34:   COPYING included with this distribution for more information.
Chris@34: */
Chris@34: 
Chris@34: #include "EM.h"
Chris@34: 
Chris@34: #include "data/include/templates.h"
Chris@34: 
Chris@36: #include <cstdlib>
Chris@42: #include <cmath>
Chris@36: 
Chris@36: #include <iostream>
Chris@36: 
Chris@91: #include "VectorOps.h"
Chris@91: #include "Allocators.h"
Chris@36: 
Chris@36: using std::vector;
Chris@36: using std::cerr;
Chris@36: using std::endl;
Chris@36: 
Chris@91: using namespace breakfastquay;
Chris@91: 
Chris@35: static double epsilon = 1e-16;
Chris@35: 
Chris@110: EM::EM(bool useShifts) :
Chris@45:     m_noteCount(SILVET_TEMPLATE_NOTE_COUNT),
Chris@110:     m_shiftCount(useShifts ? SILVET_TEMPLATE_MAX_SHIFT * 2 + 1 : 1),
Chris@45:     m_binCount(SILVET_TEMPLATE_HEIGHT),
Chris@91:     m_sourceCount(SILVET_TEMPLATE_COUNT),
Chris@42:     m_pitchSparsity(1.1),
Chris@83:     m_sourceSparsity(1.3),
Chris@83:     m_lowestPitch(silvet_templates_lowest_note),
Chris@83:     m_highestPitch(silvet_templates_highest_note)
Chris@35: {
Chris@91:     m_pitches = allocate<double>(m_noteCount);
Chris@100:     m_updatePitches = allocate<double>(m_noteCount);
Chris@55:     for (int n = 0; n < m_noteCount; ++n) {
Chris@55:         m_pitches[n] = drand48();
Chris@55:     }
Chris@35: 
Chris@113:     if (useShifts) {
Chris@113:         m_shifts = allocate_channels<double>(m_shiftCount, m_noteCount);
Chris@113:         m_updateShifts = allocate_channels<double>(m_shiftCount, m_noteCount);
Chris@113:         for (int f = 0; f < m_shiftCount; ++f) {
Chris@113:             for (int n = 0; n < m_noteCount; ++n) {
Chris@110:                 m_shifts[f][n] = drand48();
Chris@110:             }
Chris@55:         }
Chris@113:     } else {
Chris@113:         m_shifts = 0;
Chris@113:         m_updateShifts = 0;
Chris@35:     }
Chris@35:     
Chris@91:     m_sources = allocate_channels<double>(m_sourceCount, m_noteCount);
Chris@100:     m_updateSources = allocate_channels<double>(m_sourceCount, m_noteCount);
Chris@91:     for (int i = 0; i < m_sourceCount; ++i) {
Chris@55:         for (int n = 0; n < m_noteCount; ++n) {
Chris@35:             m_sources[i][n] = (inRange(i, n) ? 1.0 : 0.0);
Chris@35:         }
Chris@35:     }
Chris@35: 
Chris@91:     m_estimate = allocate<double>(m_binCount);
Chris@91:     m_q = allocate<double>(m_binCount);
Chris@35: }
Chris@35: 
Chris@35: EM::~EM()
Chris@35: {
Chris@92:     deallocate(m_q);
Chris@92:     deallocate(m_estimate);
Chris@92:     deallocate_channels(m_sources, m_sourceCount);
Chris@100:     deallocate_channels(m_updateSources, m_sourceCount);
Chris@92:     deallocate_channels(m_shifts, m_shiftCount);
Chris@100:     deallocate_channels(m_updateShifts, m_shiftCount);
Chris@92:     deallocate(m_pitches);
Chris@100:     deallocate(m_updatePitches);
Chris@35: }
Chris@35: 
Chris@45: void
Chris@45: EM::rangeFor(int instrument, int &minPitch, int &maxPitch)
Chris@45: {
Chris@55:     minPitch = silvet_templates[instrument].lowest;
Chris@55:     maxPitch = silvet_templates[instrument].highest;
Chris@45: }
Chris@45: 
Chris@35: bool
Chris@45: EM::inRange(int instrument, int pitch)
Chris@35: {
Chris@45:     int minPitch, maxPitch;
Chris@45:     rangeFor(instrument, minPitch, maxPitch);
Chris@45:     return (pitch >= minPitch && pitch <= maxPitch);
Chris@35: }
Chris@35: 
Chris@36: void
Chris@92: EM::normaliseColumn(double *column, int size)
Chris@36: {
Chris@92:     double sum = v_sum(column, size);
Chris@92:     v_scale(column, 1.0 / sum, size);
Chris@36: }
Chris@36: 
Chris@36: void
Chris@92: EM::normaliseGrid(double **grid, int size1, int size2)
Chris@53: {
Chris@122:     double *denominators = allocate_and_zero<double>(size2);
Chris@122: 
Chris@92:     for (int i = 0; i < size1; ++i) {
Chris@122:         for (int j = 0; j < size2; ++j) {
Chris@122:             denominators[j] += grid[i][j];
Chris@122:         }
Chris@53:     }
Chris@122: 
Chris@122:     for (int i = 0; i < size1; ++i) {
Chris@122:         v_divide(grid[i], denominators, size2);
Chris@122:     }
Chris@122: 
Chris@122:     deallocate(denominators);
Chris@53: }
Chris@53: 
Chris@53: void
Chris@92: EM::iterate(const double *column)
Chris@36: {
Chris@92:     double *norm = allocate<double>(m_binCount);
Chris@92:     v_copy(norm, column, m_binCount);
Chris@92:     normaliseColumn(norm, m_binCount);
Chris@92:     expectation(norm);
Chris@92:     maximisation(norm);
Chris@95:     deallocate(norm);
Chris@36: }
Chris@36: 
Chris@88: const double *
Chris@55: EM::templateFor(int instrument, int note, int shift)
Chris@45: {
Chris@113:     if (m_shifts) {
Chris@110:         return silvet_templates[instrument].data[note] + shift;
Chris@110:     } else {
Chris@110:         return silvet_templates[instrument].data[note] + 
Chris@110:             SILVET_TEMPLATE_MAX_SHIFT;
Chris@110:     }
Chris@45: }
Chris@45: 
Chris@36: void
Chris@92: EM::expectation(const double *column)
Chris@36: {
Chris@62: //    cerr << ".";
Chris@36: 
Chris@99:     v_set(m_estimate, epsilon, m_binCount);
Chris@36: 
Chris@91:     for (int i = 0; i < m_sourceCount; ++i) {
Chris@55:         for (int n = 0; n < m_noteCount; ++n) {
Chris@83:             const double pitch = m_pitches[n];
Chris@83:             const double source = m_sources[i][n];
Chris@55:             for (int f = 0; f < m_shiftCount; ++f) {
Chris@88:                 const double *w = templateFor(i, n, f);
Chris@113:                 const double shift = m_shifts ? m_shifts[f][n] : 1.0;
Chris@83:                 const double factor = pitch * source * shift;
Chris@111:                 v_add_with_gain(m_estimate, w, factor, m_binCount);
Chris@36:             }
Chris@36:         }
Chris@36:     }
Chris@36: 
Chris@45:     for (int i = 0; i < m_binCount; ++i) {
Chris@36:         m_q[i] = column[i] / m_estimate[i];
Chris@36:     }
Chris@36: }
Chris@36: 
Chris@36: void
Chris@92: EM::maximisation(const double *column)
Chris@36: {
Chris@100:     v_set(m_updatePitches, epsilon, m_noteCount);
Chris@113: 
Chris@92:     for (int i = 0; i < m_sourceCount; ++i) {
Chris@100:         v_set(m_updateSources[i], epsilon, m_noteCount);
Chris@92:     }
Chris@62: 
Chris@113:     if (m_shifts) {
Chris@113:         for (int i = 0; i < m_shiftCount; ++i) {
Chris@113:             v_set(m_updateShifts[i], epsilon, m_noteCount);
Chris@113:         }
Chris@113:     }
Chris@113: 
Chris@94:     double *contributions = allocate<double>(m_binCount);
Chris@36: 
Chris@55:     for (int n = 0; n < m_noteCount; ++n) {
Chris@85: 
Chris@85:         const double pitch = m_pitches[n];
Chris@85: 
Chris@85:         for (int f = 0; f < m_shiftCount; ++f) {
Chris@85: 
Chris@113:             const double shift = m_shifts ? m_shifts[f][n] : 1.0;
Chris@85: 
Chris@91:             for (int i = 0; i < m_sourceCount; ++i) {
Chris@85: 
Chris@83:                 const double source = m_sources[i][n];
Chris@89:                 const double factor = pitch * source * shift;
Chris@88:                 const double *w = templateFor(i, n, f);
Chris@85: 
Chris@94:                 v_copy(contributions, w, m_binCount);
Chris@95:                 v_multiply(contributions, m_q, m_binCount);
Chris@94: 
Chris@119:                 double total = factor * v_sum(contributions, m_binCount);
Chris@94: 
Chris@86:                 if (n >= m_lowestPitch && n <= m_highestPitch) {
Chris@85: 
Chris@100:                     m_updatePitches[n] += total;
Chris@85: 
Chris@85:                     if (inRange(i, n)) {
Chris@100:                         m_updateSources[i][n] += total;
Chris@55:                     }
Chris@36:                 }
Chris@55: 
Chris@113:                 if (m_shifts) {
Chris@113:                     m_updateShifts[f][n] += total;
Chris@113:                 }
Chris@42:             }
Chris@36:         }
Chris@36:     }
Chris@36: 
Chris@103:     if (m_pitchSparsity != 1.0) {
Chris@103:         for (int n = 0; n < m_noteCount; ++n) {
Chris@103:             m_updatePitches[n] = 
Chris@103:                 pow(m_updatePitches[n], m_pitchSparsity);
Chris@62:         }
Chris@103:     }
Chris@103: 
Chris@103:     if (m_sourceSparsity != 1.0) {
Chris@103:         for (int n = 0; n < m_noteCount; ++n) {
Chris@91:             for (int i = 0; i < m_sourceCount; ++i) {
Chris@103:                 m_updateSources[i][n] =
Chris@103:                     pow(m_updateSources[i][n], m_sourceSparsity);
Chris@62:             }
Chris@62:         }
Chris@62:     }
Chris@85: 
Chris@100:     normaliseColumn(m_updatePitches, m_noteCount);
Chris@112:     std::swap(m_pitches, m_updatePitches);
Chris@112: 
Chris@113:     normaliseGrid(m_updateSources, m_sourceCount, m_noteCount);
Chris@113:     std::swap(m_sources, m_updateSources);
Chris@113: 
Chris@113:     if (m_shifts) {
Chris@112:         normaliseGrid(m_updateShifts, m_shiftCount, m_noteCount);
Chris@112:         std::swap(m_shifts, m_updateShifts);
Chris@112:     }
Chris@36: }
Chris@36: 
Chris@36: