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 #include "EM.h"
|
Chris@34
|
17
|
Chris@34
|
18 #include "data/include/templates.h"
|
Chris@34
|
19
|
Chris@36
|
20 #include <cstdlib>
|
Chris@42
|
21 #include <cmath>
|
Chris@36
|
22
|
Chris@36
|
23 #include <iostream>
|
Chris@36
|
24
|
Chris@91
|
25 #include "VectorOps.h"
|
Chris@91
|
26 #include "Allocators.h"
|
Chris@36
|
27
|
Chris@36
|
28 using std::vector;
|
Chris@36
|
29 using std::cerr;
|
Chris@36
|
30 using std::endl;
|
Chris@36
|
31
|
Chris@91
|
32 using namespace breakfastquay;
|
Chris@91
|
33
|
Chris@35
|
34 static double epsilon = 1e-16;
|
Chris@35
|
35
|
Chris@35
|
36 EM::EM() :
|
Chris@45
|
37 m_noteCount(SILVET_TEMPLATE_NOTE_COUNT),
|
Chris@45
|
38 m_shiftCount(SILVET_TEMPLATE_MAX_SHIFT * 2 + 1),
|
Chris@45
|
39 m_binCount(SILVET_TEMPLATE_HEIGHT),
|
Chris@91
|
40 m_sourceCount(SILVET_TEMPLATE_COUNT),
|
Chris@42
|
41 m_pitchSparsity(1.1),
|
Chris@83
|
42 m_sourceSparsity(1.3),
|
Chris@83
|
43 m_lowestPitch(silvet_templates_lowest_note),
|
Chris@83
|
44 m_highestPitch(silvet_templates_highest_note)
|
Chris@35
|
45 {
|
Chris@91
|
46 m_pitches = allocate<double>(m_noteCount);
|
Chris@55
|
47 for (int n = 0; n < m_noteCount; ++n) {
|
Chris@55
|
48 m_pitches[n] = drand48();
|
Chris@55
|
49 }
|
Chris@35
|
50
|
Chris@91
|
51 m_shifts = allocate_channels<double>(m_shiftCount, m_noteCount);
|
Chris@55
|
52 for (int f = 0; f < m_shiftCount; ++f) {
|
Chris@55
|
53 for (int n = 0; n < m_noteCount; ++n) {
|
Chris@55
|
54 m_shifts[f][n] = drand48();
|
Chris@55
|
55 }
|
Chris@35
|
56 }
|
Chris@35
|
57
|
Chris@91
|
58 m_sources = allocate_channels<double>(m_sourceCount, m_noteCount);
|
Chris@91
|
59 for (int i = 0; i < m_sourceCount; ++i) {
|
Chris@55
|
60 for (int n = 0; n < m_noteCount; ++n) {
|
Chris@35
|
61 m_sources[i][n] = (inRange(i, n) ? 1.0 : 0.0);
|
Chris@35
|
62 }
|
Chris@35
|
63 }
|
Chris@35
|
64
|
Chris@91
|
65 m_estimate = allocate<double>(m_binCount);
|
Chris@91
|
66 m_q = allocate<double>(m_binCount);
|
Chris@35
|
67 }
|
Chris@35
|
68
|
Chris@35
|
69 EM::~EM()
|
Chris@35
|
70 {
|
Chris@92
|
71 deallocate(m_q);
|
Chris@92
|
72 deallocate(m_estimate);
|
Chris@92
|
73 deallocate_channels(m_sources, m_sourceCount);
|
Chris@92
|
74 deallocate_channels(m_shifts, m_shiftCount);
|
Chris@92
|
75 deallocate(m_pitches);
|
Chris@35
|
76 }
|
Chris@35
|
77
|
Chris@45
|
78 void
|
Chris@45
|
79 EM::rangeFor(int instrument, int &minPitch, int &maxPitch)
|
Chris@45
|
80 {
|
Chris@55
|
81 minPitch = silvet_templates[instrument].lowest;
|
Chris@55
|
82 maxPitch = silvet_templates[instrument].highest;
|
Chris@45
|
83 }
|
Chris@45
|
84
|
Chris@35
|
85 bool
|
Chris@45
|
86 EM::inRange(int instrument, int pitch)
|
Chris@35
|
87 {
|
Chris@45
|
88 int minPitch, maxPitch;
|
Chris@45
|
89 rangeFor(instrument, minPitch, maxPitch);
|
Chris@45
|
90 return (pitch >= minPitch && pitch <= maxPitch);
|
Chris@35
|
91 }
|
Chris@35
|
92
|
Chris@36
|
93 void
|
Chris@92
|
94 EM::normaliseColumn(double *column, int size)
|
Chris@36
|
95 {
|
Chris@92
|
96 double sum = v_sum(column, size);
|
Chris@92
|
97 v_scale(column, 1.0 / sum, size);
|
Chris@36
|
98 }
|
Chris@36
|
99
|
Chris@36
|
100 void
|
Chris@92
|
101 EM::normaliseGrid(double **grid, int size1, int size2)
|
Chris@53
|
102 {
|
Chris@92
|
103 double *denominators = allocate_and_zero<double>(size2);
|
Chris@53
|
104
|
Chris@92
|
105 for (int i = 0; i < size1; ++i) {
|
Chris@92
|
106 for (int j = 0; j < size2; ++j) {
|
Chris@55
|
107 denominators[j] += grid[i][j];
|
Chris@53
|
108 }
|
Chris@53
|
109 }
|
Chris@53
|
110
|
Chris@92
|
111 for (int i = 0; i < size1; ++i) {
|
Chris@92
|
112 v_divide(grid[i], denominators, size2);
|
Chris@53
|
113 }
|
Chris@92
|
114
|
Chris@92
|
115 deallocate(denominators);
|
Chris@53
|
116 }
|
Chris@53
|
117
|
Chris@53
|
118 void
|
Chris@92
|
119 EM::iterate(const double *column)
|
Chris@36
|
120 {
|
Chris@92
|
121 double *norm = allocate<double>(m_binCount);
|
Chris@92
|
122 v_copy(norm, column, m_binCount);
|
Chris@92
|
123 normaliseColumn(norm, m_binCount);
|
Chris@92
|
124 expectation(norm);
|
Chris@92
|
125 maximisation(norm);
|
Chris@95
|
126 deallocate(norm);
|
Chris@36
|
127 }
|
Chris@36
|
128
|
Chris@88
|
129 const double *
|
Chris@55
|
130 EM::templateFor(int instrument, int note, int shift)
|
Chris@45
|
131 {
|
Chris@45
|
132 return silvet_templates[instrument].data[note] + shift;
|
Chris@45
|
133 }
|
Chris@45
|
134
|
Chris@36
|
135 void
|
Chris@92
|
136 EM::expectation(const double *column)
|
Chris@36
|
137 {
|
Chris@62
|
138 // cerr << ".";
|
Chris@36
|
139
|
Chris@99
|
140 v_set(m_estimate, epsilon, m_binCount);
|
Chris@36
|
141
|
Chris@91
|
142 for (int i = 0; i < m_sourceCount; ++i) {
|
Chris@55
|
143 for (int n = 0; n < m_noteCount; ++n) {
|
Chris@83
|
144 const double pitch = m_pitches[n];
|
Chris@83
|
145 const double source = m_sources[i][n];
|
Chris@55
|
146 for (int f = 0; f < m_shiftCount; ++f) {
|
Chris@88
|
147 const double *w = templateFor(i, n, f);
|
Chris@83
|
148 const double shift = m_shifts[f][n];
|
Chris@83
|
149 const double factor = pitch * source * shift;
|
Chris@99
|
150 v_add_with_gain(m_estimate, w, factor, m_binCount);
|
Chris@36
|
151 }
|
Chris@36
|
152 }
|
Chris@36
|
153 }
|
Chris@36
|
154
|
Chris@45
|
155 for (int i = 0; i < m_binCount; ++i) {
|
Chris@36
|
156 m_q[i] = column[i] / m_estimate[i];
|
Chris@36
|
157 }
|
Chris@36
|
158 }
|
Chris@36
|
159
|
Chris@36
|
160 void
|
Chris@92
|
161 EM::maximisation(const double *column)
|
Chris@36
|
162 {
|
Chris@92
|
163 double *newPitches = allocate<double>(m_noteCount);
|
Chris@92
|
164 v_set(newPitches, epsilon, m_noteCount);
|
Chris@92
|
165
|
Chris@92
|
166 double **newShifts = allocate_channels<double>(m_shiftCount, m_noteCount);
|
Chris@92
|
167 for (int i = 0; i < m_shiftCount; ++i) {
|
Chris@92
|
168 v_set(newShifts[i], epsilon, m_noteCount);
|
Chris@92
|
169 }
|
Chris@92
|
170
|
Chris@92
|
171 double **newSources = allocate_channels<double>(m_sourceCount, m_noteCount);
|
Chris@92
|
172 for (int i = 0; i < m_sourceCount; ++i) {
|
Chris@92
|
173 v_set(newSources[i], epsilon, m_noteCount);
|
Chris@92
|
174 }
|
Chris@36
|
175
|
Chris@94
|
176 double *contributions = allocate<double>(m_binCount);
|
Chris@94
|
177
|
Chris@55
|
178 for (int n = 0; n < m_noteCount; ++n) {
|
Chris@85
|
179
|
Chris@85
|
180 const double pitch = m_pitches[n];
|
Chris@85
|
181
|
Chris@85
|
182 for (int f = 0; f < m_shiftCount; ++f) {
|
Chris@85
|
183
|
Chris@85
|
184 const double shift = m_shifts[f][n];
|
Chris@85
|
185
|
Chris@91
|
186 for (int i = 0; i < m_sourceCount; ++i) {
|
Chris@85
|
187
|
Chris@83
|
188 const double source = m_sources[i][n];
|
Chris@89
|
189 const double factor = pitch * source * shift;
|
Chris@88
|
190 const double *w = templateFor(i, n, f);
|
Chris@85
|
191
|
Chris@94
|
192 v_copy(contributions, w, m_binCount);
|
Chris@95
|
193 v_multiply(contributions, m_q, m_binCount);
|
Chris@94
|
194 v_scale(contributions, factor, m_binCount);
|
Chris@94
|
195
|
Chris@94
|
196 double total = v_sum(contributions, m_binCount);
|
Chris@94
|
197
|
Chris@86
|
198 if (n >= m_lowestPitch && n <= m_highestPitch) {
|
Chris@85
|
199
|
Chris@94
|
200 newPitches[n] += total;
|
Chris@85
|
201
|
Chris@85
|
202 if (inRange(i, n)) {
|
Chris@94
|
203 newSources[i][n] += total;
|
Chris@55
|
204 }
|
Chris@36
|
205 }
|
Chris@86
|
206
|
Chris@94
|
207 newShifts[f][n] += total;
|
Chris@36
|
208 }
|
Chris@36
|
209 }
|
Chris@85
|
210 }
|
Chris@85
|
211
|
Chris@85
|
212 for (int n = 0; n < m_noteCount; ++n) {
|
Chris@42
|
213 if (m_pitchSparsity != 1.0) {
|
Chris@42
|
214 newPitches[n] = pow(newPitches[n], m_pitchSparsity);
|
Chris@42
|
215 }
|
Chris@85
|
216 if (m_sourceSparsity != 1.0) {
|
Chris@91
|
217 for (int i = 0; i < m_sourceCount; ++i) {
|
Chris@42
|
218 newSources[i][n] = pow(newSources[i][n], m_sourceSparsity);
|
Chris@42
|
219 }
|
Chris@36
|
220 }
|
Chris@36
|
221 }
|
Chris@85
|
222
|
Chris@92
|
223 normaliseColumn(newPitches, m_noteCount);
|
Chris@92
|
224 normaliseGrid(newShifts, m_shiftCount, m_noteCount);
|
Chris@92
|
225 normaliseGrid(newSources, m_sourceCount, m_noteCount);
|
Chris@92
|
226
|
Chris@92
|
227 deallocate(m_pitches);
|
Chris@92
|
228 deallocate_channels(m_shifts, m_shiftCount);
|
Chris@92
|
229 deallocate_channels(m_sources, m_sourceCount);
|
Chris@36
|
230
|
Chris@36
|
231 m_pitches = newPitches;
|
Chris@55
|
232 m_shifts = newShifts;
|
Chris@36
|
233 m_sources = newSources;
|
Chris@36
|
234 }
|
Chris@36
|
235
|
Chris@36
|
236
|