annotate src/EM.h @ 114:b2f0967cb8d1 bqvec-openmp

Pull out shifted templates into separate arrays with proper alignment (trading off memory occupied against getting the alignments right)
author Chris Cannam
date Wed, 07 May 2014 09:43:15 +0100
parents c4eae816bdb3
children
rev   line source
Chris@34 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
Chris@34 2
Chris@34 3 /*
Chris@34 4 Silvet
Chris@34 5
Chris@34 6 A Vamp plugin for note transcription.
Chris@34 7 Centre for Digital Music, Queen Mary University of London.
Chris@34 8
Chris@34 9 This program is free software; you can redistribute it and/or
Chris@34 10 modify it under the terms of the GNU General Public License as
Chris@34 11 published by the Free Software Foundation; either version 2 of the
Chris@34 12 License, or (at your option) any later version. See the file
Chris@34 13 COPYING included with this distribution for more information.
Chris@34 14 */
Chris@34 15
Chris@34 16 #ifndef SILVET_EM_H
Chris@34 17 #define SILVET_EM_H
Chris@34 18
Chris@34 19 #include <vector>
Chris@34 20
Chris@34 21 class EM
Chris@34 22 {
Chris@34 23 public:
Chris@110 24 EM(bool useShifts);
Chris@34 25 ~EM();
Chris@34 26
Chris@114 27 static void initialise();
Chris@114 28
Chris@91 29 int getBinCount() const { return m_binCount; } // size of input column
Chris@91 30 int getNoteCount() const { return m_noteCount; } // size of pitch column
Chris@91 31 int getSourceCount() const { return m_sourceCount; }
Chris@34 32
Chris@92 33 void iterate(const double *column);
Chris@91 34
Chris@91 35 const double *getEstimate() const { // bin count
Chris@38 36 return m_estimate;
Chris@38 37 }
Chris@91 38 const double *getPitchDistribution() const { // note count
Chris@38 39 return m_pitches;
Chris@38 40 }
Chris@92 41 const double *const *getSources() const { // source count * note count
Chris@38 42 return m_sources;
Chris@38 43 }
Chris@38 44
Chris@34 45 private:
Chris@91 46 double *m_pitches;
Chris@91 47 double **m_shifts;
Chris@91 48 double **m_sources;
Chris@55 49
Chris@100 50 double *m_updatePitches;
Chris@100 51 double **m_updateShifts;
Chris@100 52 double **m_updateSources;
Chris@34 53
Chris@91 54 double *m_estimate;
Chris@91 55 double *m_q;
Chris@114 56
Chris@114 57 static bool m_initialised;
Chris@114 58 static double ****m_templates; // [source][note][shift][bin]
Chris@55 59
Chris@83 60 const int m_noteCount;
Chris@83 61 const int m_shiftCount; // 1 + 2 * max template shift
Chris@83 62 const int m_binCount;
Chris@91 63 const int m_sourceCount;
Chris@55 64
Chris@83 65 const double m_pitchSparsity;
Chris@83 66 const double m_sourceSparsity;
Chris@36 67
Chris@83 68 const int m_lowestPitch;
Chris@83 69 const int m_highestPitch;
Chris@35 70
Chris@91 71 void normaliseColumn(double *column, int size);
Chris@92 72 void normaliseGrid(double **grid, int size1, int size2);
Chris@35 73
Chris@92 74 void expectation(const double *column); // size is m_binCount
Chris@92 75 void maximisation(const double *column); // size is m_binCount
Chris@36 76
Chris@88 77 const double *templateFor(int instrument, int note, int shift);
Chris@45 78 void rangeFor(int instrument, int &minPitch, int &maxPitch);
Chris@45 79 bool inRange(int instrument, int pitch);
Chris@34 80 };
Chris@34 81
Chris@34 82 #endif