adamstark@5
|
1 //=======================================================================
|
adamstark@5
|
2 /** @file BTrack.cpp
|
adamstark@6
|
3 * @brief BTrack - a real-time beat tracker
|
adamstark@5
|
4 * @author Adam Stark
|
adamstark@5
|
5 * @copyright Copyright (C) 2008-2014 Queen Mary University of London
|
adamstark@5
|
6 *
|
adamstark@5
|
7 * This program is free software: you can redistribute it and/or modify
|
adamstark@5
|
8 * it under the terms of the GNU General Public License as published by
|
adamstark@5
|
9 * the Free Software Foundation, either version 3 of the License, or
|
adamstark@5
|
10 * (at your option) any later version.
|
adamstark@5
|
11 *
|
adamstark@5
|
12 * This program is distributed in the hope that it will be useful,
|
adamstark@5
|
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
adamstark@5
|
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
adamstark@5
|
15 * GNU General Public License for more details.
|
adamstark@5
|
16 *
|
adamstark@5
|
17 * You should have received a copy of the GNU General Public License
|
adamstark@5
|
18 * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
adamstark@5
|
19 */
|
adamstark@5
|
20 //=======================================================================
|
adamstark@5
|
21
|
adamstark@5
|
22 #include <cmath>
|
adamstark@15
|
23 #include <algorithm>
|
adamstark@5
|
24 #include "BTrack.h"
|
adamstark@5
|
25 #include "samplerate.h"
|
adamstark@5
|
26
|
adamstark@18
|
27 //=======================================================================
|
adamstark@20
|
28 BTrack::BTrack() : odf(512,1024,ComplexSpectralDifferenceHWR,HanningWindow)
|
adamstark@18
|
29 {
|
adamstark@18
|
30 initialise(512, 1024);
|
adamstark@18
|
31 }
|
adamstark@5
|
32
|
adamstark@14
|
33 //=======================================================================
|
adamstark@20
|
34 BTrack::BTrack(int hopSize_) : odf(hopSize_,2*hopSize_,ComplexSpectralDifferenceHWR,HanningWindow)
|
adamstark@5
|
35 {
|
adamstark@20
|
36 initialise(hopSize_, 2*hopSize_);
|
adamstark@18
|
37 }
|
adamstark@18
|
38
|
adamstark@18
|
39 //=======================================================================
|
adamstark@20
|
40 BTrack::BTrack(int hopSize_,int frameSize_) : odf(hopSize_,frameSize_,ComplexSpectralDifferenceHWR,HanningWindow)
|
adamstark@18
|
41 {
|
adamstark@20
|
42 initialise(hopSize_, frameSize_);
|
adamstark@18
|
43 }
|
adamstark@18
|
44
|
adamstark@18
|
45 //=======================================================================
|
adamstark@18
|
46 double BTrack::getBeatTimeInSeconds(long frameNumber,int hopSize,int fs)
|
adamstark@18
|
47 {
|
adamstark@18
|
48 double hop = (double) hopSize;
|
adamstark@18
|
49 double samplingFrequency = (double) fs;
|
adamstark@18
|
50 double frameNum = (double) frameNumber;
|
adamstark@18
|
51
|
adamstark@18
|
52 return ((hop / samplingFrequency) * frameNum);
|
adamstark@18
|
53 }
|
adamstark@18
|
54
|
adamstark@18
|
55 //=======================================================================
|
adamstark@18
|
56 double BTrack::getBeatTimeInSeconds(int frameNumber,int hopSize,int fs)
|
adamstark@18
|
57 {
|
adamstark@18
|
58 long frameNum = (long) frameNumber;
|
adamstark@18
|
59
|
adamstark@18
|
60 return getBeatTimeInSeconds(frameNum, hopSize, fs);
|
adamstark@18
|
61 }
|
adamstark@18
|
62
|
adamstark@18
|
63
|
adamstark@18
|
64
|
adamstark@18
|
65 //=======================================================================
|
adamstark@20
|
66 void BTrack::initialise(int hopSize_, int frameSize_)
|
adamstark@18
|
67 {
|
adamstark@18
|
68 double rayparam = 43;
|
adamstark@17
|
69 double pi = 3.14159265;
|
adamstark@5
|
70
|
adamstark@5
|
71
|
adamstark@5
|
72 // initialise parameters
|
adamstark@5
|
73 tightness = 5;
|
adamstark@5
|
74 alpha = 0.9;
|
adamstark@5
|
75 tempo = 120;
|
adamstark@21
|
76 estimatedTempo = 120.0;
|
adamstark@22
|
77 tempoToLagFactor = 60.*44100./512.;
|
adamstark@5
|
78
|
adamstark@5
|
79 m0 = 10;
|
adamstark@21
|
80 beatCounter = -1;
|
adamstark@5
|
81
|
adamstark@20
|
82 beatDueInFrame = false;
|
adamstark@5
|
83
|
adamstark@21
|
84
|
adamstark@5
|
85 // create rayleigh weighting vector
|
adamstark@5
|
86 for (int n = 0;n < 128;n++)
|
adamstark@5
|
87 {
|
adamstark@21
|
88 weightingVector[n] = ((double) n / pow(rayparam,2)) * exp((-1*pow((double)-n,2)) / (2*pow(rayparam,2)));
|
adamstark@5
|
89 }
|
adamstark@5
|
90
|
adamstark@5
|
91 // initialise prev_delta
|
adamstark@5
|
92 for (int i = 0;i < 41;i++)
|
adamstark@5
|
93 {
|
adamstark@21
|
94 prevDelta[i] = 1;
|
adamstark@5
|
95 }
|
adamstark@5
|
96
|
adamstark@17
|
97 double t_mu = 41/2;
|
adamstark@17
|
98 double m_sig;
|
adamstark@17
|
99 double x;
|
adamstark@5
|
100 // create tempo transition matrix
|
adamstark@5
|
101 m_sig = 41/8;
|
adamstark@5
|
102 for (int i = 0;i < 41;i++)
|
adamstark@5
|
103 {
|
adamstark@5
|
104 for (int j = 0;j < 41;j++)
|
adamstark@5
|
105 {
|
adamstark@5
|
106 x = j+1;
|
adamstark@5
|
107 t_mu = i+1;
|
adamstark@21
|
108 tempoTransitionMatrix[i][j] = (1 / (m_sig * sqrt(2*pi))) * exp( (-1*pow((x-t_mu),2)) / (2*pow(m_sig,2)) );
|
adamstark@5
|
109 }
|
adamstark@18
|
110 }
|
adamstark@5
|
111
|
adamstark@5
|
112 // tempo is not fixed
|
adamstark@21
|
113 tempoFixed = false;
|
adamstark@21
|
114
|
adamstark@21
|
115 // initialise latest cumulative score value
|
adamstark@21
|
116 // in case it is requested before any processing takes place
|
adamstark@21
|
117 latestCumulativeScoreValue = 0;
|
adamstark@18
|
118
|
adamstark@18
|
119 // initialise algorithm given the hopsize
|
adamstark@20
|
120 setHopSize(hopSize_);
|
adamstark@5
|
121 }
|
adamstark@5
|
122
|
adamstark@14
|
123 //=======================================================================
|
adamstark@20
|
124 void BTrack::setHopSize(int hopSize_)
|
adamstark@5
|
125 {
|
adamstark@20
|
126 hopSize = hopSize_;
|
adamstark@21
|
127 onsetDFBufferSize = (512*512)/hopSize; // calculate df buffer size
|
adamstark@5
|
128
|
adamstark@20
|
129 beatPeriod = round(60/((((double) hopSize)/44100)*tempo));
|
adamstark@26
|
130
|
adamstark@26
|
131 // set size of onset detection function buffer
|
adamstark@26
|
132 onsetDF.resize(onsetDFBufferSize);
|
adamstark@26
|
133
|
adamstark@26
|
134 // set size of cumulative score buffer
|
adamstark@26
|
135 cumulativeScore.resize(onsetDFBufferSize);
|
adamstark@5
|
136
|
adamstark@5
|
137 // initialise df_buffer to zeros
|
adamstark@21
|
138 for (int i = 0;i < onsetDFBufferSize;i++)
|
adamstark@5
|
139 {
|
adamstark@21
|
140 onsetDF[i] = 0;
|
adamstark@21
|
141 cumulativeScore[i] = 0;
|
adamstark@5
|
142
|
adamstark@5
|
143
|
adamstark@20
|
144 if ((i % ((int) round(beatPeriod))) == 0)
|
adamstark@5
|
145 {
|
adamstark@21
|
146 onsetDF[i] = 1;
|
adamstark@5
|
147 }
|
adamstark@5
|
148 }
|
adamstark@5
|
149 }
|
adamstark@5
|
150
|
adamstark@14
|
151 //=======================================================================
|
adamstark@28
|
152 void BTrack::updateHopAndFrameSize(int hopSize_,int frameSize_)
|
adamstark@28
|
153 {
|
adamstark@28
|
154 // update the onset detection function object
|
adamstark@29
|
155 odf.initialise(hopSize_, frameSize_);
|
adamstark@28
|
156
|
adamstark@28
|
157 // update the hop size being used by the beat tracker
|
adamstark@28
|
158 setHopSize(hopSize_);
|
adamstark@28
|
159 }
|
adamstark@28
|
160
|
adamstark@28
|
161 //=======================================================================
|
adamstark@20
|
162 bool BTrack::beatDueInCurrentFrame()
|
adamstark@20
|
163 {
|
adamstark@20
|
164 return beatDueInFrame;
|
adamstark@20
|
165 }
|
adamstark@20
|
166
|
adamstark@20
|
167 //=======================================================================
|
adamstark@20
|
168 int BTrack::getHopSize()
|
adamstark@20
|
169 {
|
adamstark@20
|
170 return hopSize;
|
adamstark@20
|
171 }
|
adamstark@20
|
172
|
adamstark@20
|
173 //=======================================================================
|
adamstark@21
|
174 double BTrack::getLatestCumulativeScoreValue()
|
adamstark@21
|
175 {
|
adamstark@21
|
176 return latestCumulativeScoreValue;
|
adamstark@21
|
177 }
|
adamstark@21
|
178
|
adamstark@21
|
179 //=======================================================================
|
adamstark@18
|
180 void BTrack::processAudioFrame(double *frame)
|
adamstark@18
|
181 {
|
adamstark@18
|
182 // calculate the onset detection function sample for the frame
|
adamstark@22
|
183 double sample = odf.calculateOnsetDetectionFunctionSample(frame);
|
adamstark@18
|
184
|
adamstark@19
|
185
|
adamstark@18
|
186
|
adamstark@18
|
187 // process the new onset detection function sample in the beat tracking algorithm
|
adamstark@18
|
188 processOnsetDetectionFunctionSample(sample);
|
adamstark@18
|
189 }
|
adamstark@18
|
190
|
adamstark@18
|
191 //=======================================================================
|
adamstark@18
|
192 void BTrack::processOnsetDetectionFunctionSample(double newSample)
|
adamstark@19
|
193 {
|
adamstark@19
|
194 // we need to ensure that the onset
|
adamstark@19
|
195 // detection function sample is positive
|
adamstark@19
|
196 newSample = fabs(newSample);
|
adamstark@19
|
197
|
adamstark@19
|
198 // add a tiny constant to the sample to stop it from ever going
|
adamstark@19
|
199 // to zero. this is to avoid problems further down the line
|
adamstark@19
|
200 newSample = newSample + 0.0001;
|
adamstark@19
|
201
|
adamstark@5
|
202 m0--;
|
adamstark@21
|
203 beatCounter--;
|
adamstark@20
|
204 beatDueInFrame = false;
|
adamstark@5
|
205
|
adamstark@5
|
206 // move all samples back one step
|
adamstark@21
|
207 for (int i=0;i < (onsetDFBufferSize-1);i++)
|
adamstark@5
|
208 {
|
adamstark@21
|
209 onsetDF[i] = onsetDF[i+1];
|
adamstark@5
|
210 }
|
adamstark@5
|
211
|
adamstark@5
|
212 // add new sample at the end
|
adamstark@21
|
213 onsetDF[onsetDFBufferSize-1] = newSample;
|
adamstark@5
|
214
|
adamstark@5
|
215 // update cumulative score
|
adamstark@20
|
216 updateCumulativeScore(newSample);
|
adamstark@5
|
217
|
adamstark@5
|
218 // if we are halfway between beats
|
adamstark@5
|
219 if (m0 == 0)
|
adamstark@5
|
220 {
|
adamstark@20
|
221 predictBeat();
|
adamstark@5
|
222 }
|
adamstark@5
|
223
|
adamstark@5
|
224 // if we are at a beat
|
adamstark@21
|
225 if (beatCounter == 0)
|
adamstark@5
|
226 {
|
adamstark@20
|
227 beatDueInFrame = true; // indicate a beat should be output
|
adamstark@5
|
228
|
adamstark@5
|
229 // recalculate the tempo
|
adamstark@20
|
230 resampleOnsetDetectionFunction();
|
adamstark@20
|
231 calculateTempo();
|
adamstark@5
|
232 }
|
adamstark@5
|
233 }
|
adamstark@5
|
234
|
adamstark@14
|
235 //=======================================================================
|
adamstark@20
|
236 void BTrack::setTempo(double tempo)
|
adamstark@5
|
237 {
|
adamstark@5
|
238
|
adamstark@5
|
239 /////////// TEMPO INDICATION RESET //////////////////
|
adamstark@5
|
240
|
adamstark@5
|
241 // firstly make sure tempo is between 80 and 160 bpm..
|
adamstark@5
|
242 while (tempo > 160)
|
adamstark@5
|
243 {
|
adamstark@5
|
244 tempo = tempo/2;
|
adamstark@5
|
245 }
|
adamstark@5
|
246
|
adamstark@5
|
247 while (tempo < 80)
|
adamstark@5
|
248 {
|
adamstark@5
|
249 tempo = tempo * 2;
|
adamstark@5
|
250 }
|
adamstark@5
|
251
|
adamstark@5
|
252 // convert tempo from bpm value to integer index of tempo probability
|
adamstark@5
|
253 int tempo_index = (int) round((tempo - 80)/2);
|
adamstark@5
|
254
|
adamstark@5
|
255 // now set previous tempo observations to zero
|
adamstark@5
|
256 for (int i=0;i < 41;i++)
|
adamstark@5
|
257 {
|
adamstark@21
|
258 prevDelta[i] = 0;
|
adamstark@5
|
259 }
|
adamstark@5
|
260
|
adamstark@5
|
261 // set desired tempo index to 1
|
adamstark@21
|
262 prevDelta[tempo_index] = 1;
|
adamstark@5
|
263
|
adamstark@5
|
264
|
adamstark@5
|
265 /////////// CUMULATIVE SCORE ARTIFICAL TEMPO UPDATE //////////////////
|
adamstark@5
|
266
|
adamstark@5
|
267 // calculate new beat period
|
adamstark@20
|
268 int new_bperiod = (int) round(60/((((double) hopSize)/44100)*tempo));
|
adamstark@5
|
269
|
adamstark@5
|
270 int bcounter = 1;
|
adamstark@5
|
271 // initialise df_buffer to zeros
|
adamstark@21
|
272 for (int i = (onsetDFBufferSize-1);i >= 0;i--)
|
adamstark@5
|
273 {
|
adamstark@5
|
274 if (bcounter == 1)
|
adamstark@5
|
275 {
|
adamstark@21
|
276 cumulativeScore[i] = 150;
|
adamstark@21
|
277 onsetDF[i] = 150;
|
adamstark@5
|
278 }
|
adamstark@5
|
279 else
|
adamstark@5
|
280 {
|
adamstark@21
|
281 cumulativeScore[i] = 10;
|
adamstark@21
|
282 onsetDF[i] = 10;
|
adamstark@5
|
283 }
|
adamstark@5
|
284
|
adamstark@5
|
285 bcounter++;
|
adamstark@5
|
286
|
adamstark@5
|
287 if (bcounter > new_bperiod)
|
adamstark@5
|
288 {
|
adamstark@5
|
289 bcounter = 1;
|
adamstark@5
|
290 }
|
adamstark@5
|
291 }
|
adamstark@5
|
292
|
adamstark@5
|
293 /////////// INDICATE THAT THIS IS A BEAT //////////////////
|
adamstark@5
|
294
|
adamstark@5
|
295 // beat is now
|
adamstark@21
|
296 beatCounter = 0;
|
adamstark@5
|
297
|
adamstark@5
|
298 // offbeat is half of new beat period away
|
adamstark@17
|
299 m0 = (int) round(((double) new_bperiod)/2);
|
adamstark@5
|
300 }
|
adamstark@5
|
301
|
adamstark@14
|
302 //=======================================================================
|
adamstark@20
|
303 void BTrack::fixTempo(double tempo)
|
adamstark@5
|
304 {
|
adamstark@5
|
305 // firstly make sure tempo is between 80 and 160 bpm..
|
adamstark@5
|
306 while (tempo > 160)
|
adamstark@5
|
307 {
|
adamstark@5
|
308 tempo = tempo/2;
|
adamstark@5
|
309 }
|
adamstark@5
|
310
|
adamstark@5
|
311 while (tempo < 80)
|
adamstark@5
|
312 {
|
adamstark@5
|
313 tempo = tempo * 2;
|
adamstark@5
|
314 }
|
adamstark@5
|
315
|
adamstark@5
|
316 // convert tempo from bpm value to integer index of tempo probability
|
adamstark@5
|
317 int tempo_index = (int) round((tempo - 80)/2);
|
adamstark@5
|
318
|
adamstark@5
|
319 // now set previous fixed previous tempo observation values to zero
|
adamstark@5
|
320 for (int i=0;i < 41;i++)
|
adamstark@5
|
321 {
|
adamstark@21
|
322 prevDeltaFixed[i] = 0;
|
adamstark@5
|
323 }
|
adamstark@5
|
324
|
adamstark@5
|
325 // set desired tempo index to 1
|
adamstark@21
|
326 prevDeltaFixed[tempo_index] = 1;
|
adamstark@5
|
327
|
adamstark@5
|
328 // set the tempo fix flag
|
adamstark@21
|
329 tempoFixed = true;
|
adamstark@5
|
330 }
|
adamstark@5
|
331
|
adamstark@14
|
332 //=======================================================================
|
adamstark@20
|
333 void BTrack::doNotFixTempo()
|
adamstark@5
|
334 {
|
adamstark@5
|
335 // set the tempo fix flag
|
adamstark@21
|
336 tempoFixed = false;
|
adamstark@5
|
337 }
|
adamstark@5
|
338
|
adamstark@14
|
339 //=======================================================================
|
adamstark@20
|
340 void BTrack::resampleOnsetDetectionFunction()
|
adamstark@5
|
341 {
|
adamstark@5
|
342 float output[512];
|
adamstark@21
|
343 float input[onsetDFBufferSize];
|
adamstark@17
|
344
|
adamstark@21
|
345 for (int i = 0;i < onsetDFBufferSize;i++)
|
adamstark@17
|
346 {
|
adamstark@21
|
347 input[i] = (float) onsetDF[i];
|
adamstark@17
|
348 }
|
adamstark@5
|
349
|
adamstark@21
|
350 double src_ratio = 512.0/((double) onsetDFBufferSize);
|
adamstark@21
|
351 int BUFFER_LEN = onsetDFBufferSize;
|
adamstark@5
|
352 int output_len;
|
adamstark@5
|
353 SRC_DATA src_data ;
|
adamstark@5
|
354
|
adamstark@5
|
355 //output_len = (int) floor (((double) BUFFER_LEN) * src_ratio) ;
|
adamstark@5
|
356 output_len = 512;
|
adamstark@5
|
357
|
adamstark@17
|
358 src_data.data_in = input;
|
adamstark@5
|
359 src_data.input_frames = BUFFER_LEN;
|
adamstark@5
|
360
|
adamstark@5
|
361 src_data.src_ratio = src_ratio;
|
adamstark@5
|
362
|
adamstark@5
|
363 src_data.data_out = output;
|
adamstark@5
|
364 src_data.output_frames = output_len;
|
adamstark@5
|
365
|
adamstark@5
|
366 src_simple (&src_data, SRC_SINC_BEST_QUALITY, 1);
|
adamstark@5
|
367
|
adamstark@5
|
368 for (int i = 0;i < output_len;i++)
|
adamstark@5
|
369 {
|
adamstark@21
|
370 resampledOnsetDF[i] = (double) src_data.data_out[i];
|
adamstark@5
|
371 }
|
adamstark@5
|
372 }
|
adamstark@5
|
373
|
adamstark@14
|
374 //=======================================================================
|
adamstark@20
|
375 void BTrack::calculateTempo()
|
adamstark@5
|
376 {
|
adamstark@5
|
377 // adaptive threshold on input
|
adamstark@21
|
378 adaptiveThreshold(resampledOnsetDF,512);
|
adamstark@5
|
379
|
adamstark@5
|
380 // calculate auto-correlation function of detection function
|
adamstark@21
|
381 calculateBalancedACF(resampledOnsetDF);
|
adamstark@5
|
382
|
adamstark@5
|
383 // calculate output of comb filterbank
|
adamstark@20
|
384 calculateOutputOfCombFilterBank();
|
adamstark@5
|
385
|
adamstark@5
|
386
|
adamstark@5
|
387 // adaptive threshold on rcf
|
adamstark@21
|
388 adaptiveThreshold(combFilterBankOutput,128);
|
adamstark@5
|
389
|
adamstark@5
|
390
|
adamstark@5
|
391 int t_index;
|
adamstark@5
|
392 int t_index2;
|
adamstark@22
|
393 // calculate tempo observation vector from beat period observation vector
|
adamstark@5
|
394 for (int i = 0;i < 41;i++)
|
adamstark@5
|
395 {
|
adamstark@22
|
396 t_index = (int) round(tempoToLagFactor / ((double) ((2*i)+80)));
|
adamstark@22
|
397 t_index2 = (int) round(tempoToLagFactor / ((double) ((4*i)+160)));
|
adamstark@5
|
398
|
adamstark@5
|
399
|
adamstark@21
|
400 tempoObservationVector[i] = combFilterBankOutput[t_index-1] + combFilterBankOutput[t_index2-1];
|
adamstark@5
|
401 }
|
adamstark@5
|
402
|
adamstark@5
|
403
|
adamstark@17
|
404 double maxval;
|
adamstark@17
|
405 double maxind;
|
adamstark@17
|
406 double curval;
|
adamstark@5
|
407
|
adamstark@5
|
408 // if tempo is fixed then always use a fixed set of tempi as the previous observation probability function
|
adamstark@21
|
409 if (tempoFixed)
|
adamstark@5
|
410 {
|
adamstark@5
|
411 for (int k = 0;k < 41;k++)
|
adamstark@5
|
412 {
|
adamstark@21
|
413 prevDelta[k] = prevDeltaFixed[k];
|
adamstark@5
|
414 }
|
adamstark@5
|
415 }
|
adamstark@5
|
416
|
adamstark@5
|
417 for (int j=0;j < 41;j++)
|
adamstark@5
|
418 {
|
adamstark@5
|
419 maxval = -1;
|
adamstark@5
|
420 for (int i = 0;i < 41;i++)
|
adamstark@5
|
421 {
|
adamstark@21
|
422 curval = prevDelta[i]*tempoTransitionMatrix[i][j];
|
adamstark@5
|
423
|
adamstark@5
|
424 if (curval > maxval)
|
adamstark@5
|
425 {
|
adamstark@5
|
426 maxval = curval;
|
adamstark@5
|
427 }
|
adamstark@5
|
428 }
|
adamstark@5
|
429
|
adamstark@21
|
430 delta[j] = maxval*tempoObservationVector[j];
|
adamstark@5
|
431 }
|
adamstark@5
|
432
|
adamstark@5
|
433
|
adamstark@20
|
434 normaliseArray(delta,41);
|
adamstark@5
|
435
|
adamstark@5
|
436 maxind = -1;
|
adamstark@5
|
437 maxval = -1;
|
adamstark@5
|
438
|
adamstark@5
|
439 for (int j=0;j < 41;j++)
|
adamstark@5
|
440 {
|
adamstark@5
|
441 if (delta[j] > maxval)
|
adamstark@5
|
442 {
|
adamstark@5
|
443 maxval = delta[j];
|
adamstark@5
|
444 maxind = j;
|
adamstark@5
|
445 }
|
adamstark@5
|
446
|
adamstark@21
|
447 prevDelta[j] = delta[j];
|
adamstark@5
|
448 }
|
adamstark@5
|
449
|
adamstark@20
|
450 beatPeriod = round((60.0*44100.0)/(((2*maxind)+80)*((double) hopSize)));
|
adamstark@5
|
451
|
adamstark@20
|
452 if (beatPeriod > 0)
|
adamstark@5
|
453 {
|
adamstark@21
|
454 estimatedTempo = 60.0/((((double) hopSize) / 44100.0)*beatPeriod);
|
adamstark@5
|
455 }
|
adamstark@5
|
456 }
|
adamstark@5
|
457
|
adamstark@14
|
458 //=======================================================================
|
adamstark@20
|
459 void BTrack::adaptiveThreshold(double *x,int N)
|
adamstark@5
|
460 {
|
adamstark@5
|
461 int i = 0;
|
adamstark@5
|
462 int k,t = 0;
|
adamstark@17
|
463 double x_thresh[N];
|
adamstark@5
|
464
|
adamstark@5
|
465 int p_post = 7;
|
adamstark@5
|
466 int p_pre = 8;
|
adamstark@5
|
467
|
adamstark@15
|
468 t = std::min(N,p_post); // what is smaller, p_post of df size. This is to avoid accessing outside of arrays
|
adamstark@5
|
469
|
adamstark@5
|
470 // find threshold for first 't' samples, where a full average cannot be computed yet
|
adamstark@5
|
471 for (i = 0;i <= t;i++)
|
adamstark@5
|
472 {
|
adamstark@15
|
473 k = std::min((i+p_pre),N);
|
adamstark@20
|
474 x_thresh[i] = calculateMeanOfArray(x,1,k);
|
adamstark@5
|
475 }
|
adamstark@5
|
476 // find threshold for bulk of samples across a moving average from [i-p_pre,i+p_post]
|
adamstark@5
|
477 for (i = t+1;i < N-p_post;i++)
|
adamstark@5
|
478 {
|
adamstark@20
|
479 x_thresh[i] = calculateMeanOfArray(x,i-p_pre,i+p_post);
|
adamstark@5
|
480 }
|
adamstark@5
|
481 // for last few samples calculate threshold, again, not enough samples to do as above
|
adamstark@5
|
482 for (i = N-p_post;i < N;i++)
|
adamstark@5
|
483 {
|
adamstark@15
|
484 k = std::max((i-p_post),1);
|
adamstark@20
|
485 x_thresh[i] = calculateMeanOfArray(x,k,N);
|
adamstark@5
|
486 }
|
adamstark@5
|
487
|
adamstark@5
|
488 // subtract the threshold from the detection function and check that it is not less than 0
|
adamstark@5
|
489 for (i = 0;i < N;i++)
|
adamstark@5
|
490 {
|
adamstark@5
|
491 x[i] = x[i] - x_thresh[i];
|
adamstark@5
|
492 if (x[i] < 0)
|
adamstark@5
|
493 {
|
adamstark@5
|
494 x[i] = 0;
|
adamstark@5
|
495 }
|
adamstark@5
|
496 }
|
adamstark@5
|
497 }
|
adamstark@5
|
498
|
adamstark@14
|
499 //=======================================================================
|
adamstark@20
|
500 void BTrack::calculateOutputOfCombFilterBank()
|
adamstark@5
|
501 {
|
adamstark@5
|
502 int numelem;
|
adamstark@5
|
503
|
adamstark@5
|
504 for (int i = 0;i < 128;i++)
|
adamstark@5
|
505 {
|
adamstark@21
|
506 combFilterBankOutput[i] = 0;
|
adamstark@5
|
507 }
|
adamstark@5
|
508
|
adamstark@5
|
509 numelem = 4;
|
adamstark@5
|
510
|
adamstark@5
|
511 for (int i = 2;i <= 127;i++) // max beat period
|
adamstark@5
|
512 {
|
adamstark@5
|
513 for (int a = 1;a <= numelem;a++) // number of comb elements
|
adamstark@5
|
514 {
|
adamstark@5
|
515 for (int b = 1-a;b <= a-1;b++) // general state using normalisation of comb elements
|
adamstark@5
|
516 {
|
adamstark@21
|
517 combFilterBankOutput[i-1] = combFilterBankOutput[i-1] + (acf[(a*i+b)-1]*weightingVector[i-1])/(2*a-1); // calculate value for comb filter row
|
adamstark@5
|
518 }
|
adamstark@5
|
519 }
|
adamstark@5
|
520 }
|
adamstark@5
|
521 }
|
adamstark@5
|
522
|
adamstark@14
|
523 //=======================================================================
|
adamstark@23
|
524 void BTrack::calculateBalancedACF(double *onsetDetectionFunction)
|
adamstark@5
|
525 {
|
adamstark@5
|
526 int l, n = 0;
|
adamstark@17
|
527 double sum, tmp;
|
adamstark@5
|
528
|
adamstark@5
|
529 // for l lags from 0-511
|
adamstark@5
|
530 for (l = 0;l < 512;l++)
|
adamstark@5
|
531 {
|
adamstark@5
|
532 sum = 0;
|
adamstark@5
|
533
|
adamstark@5
|
534 // for n samples from 0 - (512-lag)
|
adamstark@5
|
535 for (n = 0;n < (512-l);n++)
|
adamstark@5
|
536 {
|
adamstark@23
|
537 tmp = onsetDetectionFunction[n] * onsetDetectionFunction[n+l]; // multiply current sample n by sample (n+l)
|
adamstark@5
|
538 sum = sum + tmp; // add to sum
|
adamstark@5
|
539 }
|
adamstark@5
|
540
|
adamstark@5
|
541 acf[l] = sum / (512-l); // weight by number of mults and add to acf buffer
|
adamstark@5
|
542 }
|
adamstark@5
|
543 }
|
adamstark@5
|
544
|
adamstark@14
|
545 //=======================================================================
|
adamstark@22
|
546 double BTrack::calculateMeanOfArray(double *array,int startIndex,int endIndex)
|
adamstark@5
|
547 {
|
adamstark@5
|
548 int i;
|
adamstark@6
|
549 double sum = 0;
|
adamstark@6
|
550
|
adamstark@22
|
551 int length = endIndex - startIndex;
|
adamstark@5
|
552
|
adamstark@5
|
553 // find sum
|
adamstark@22
|
554 for (i = startIndex;i < endIndex;i++)
|
adamstark@5
|
555 {
|
adamstark@5
|
556 sum = sum + array[i];
|
adamstark@5
|
557 }
|
adamstark@5
|
558
|
adamstark@6
|
559 if (length > 0)
|
adamstark@6
|
560 {
|
adamstark@6
|
561 return sum / length; // average and return
|
adamstark@6
|
562 }
|
adamstark@6
|
563 else
|
adamstark@6
|
564 {
|
adamstark@6
|
565 return 0;
|
adamstark@6
|
566 }
|
adamstark@5
|
567 }
|
adamstark@5
|
568
|
adamstark@14
|
569 //=======================================================================
|
adamstark@20
|
570 void BTrack::normaliseArray(double *array,int N)
|
adamstark@5
|
571 {
|
adamstark@5
|
572 double sum = 0;
|
adamstark@5
|
573
|
adamstark@5
|
574 for (int i = 0;i < N;i++)
|
adamstark@5
|
575 {
|
adamstark@5
|
576 if (array[i] > 0)
|
adamstark@5
|
577 {
|
adamstark@5
|
578 sum = sum + array[i];
|
adamstark@5
|
579 }
|
adamstark@5
|
580 }
|
adamstark@5
|
581
|
adamstark@5
|
582 if (sum > 0)
|
adamstark@5
|
583 {
|
adamstark@5
|
584 for (int i = 0;i < N;i++)
|
adamstark@5
|
585 {
|
adamstark@5
|
586 array[i] = array[i] / sum;
|
adamstark@5
|
587 }
|
adamstark@5
|
588 }
|
adamstark@5
|
589 }
|
adamstark@5
|
590
|
adamstark@14
|
591 //=======================================================================
|
adamstark@22
|
592 void BTrack::updateCumulativeScore(double odfSample)
|
adamstark@5
|
593 {
|
adamstark@5
|
594 int start, end, winsize;
|
adamstark@17
|
595 double max;
|
adamstark@5
|
596
|
adamstark@21
|
597 start = onsetDFBufferSize - round(2*beatPeriod);
|
adamstark@21
|
598 end = onsetDFBufferSize - round(beatPeriod/2);
|
adamstark@5
|
599 winsize = end-start+1;
|
adamstark@5
|
600
|
adamstark@17
|
601 double w1[winsize];
|
adamstark@20
|
602 double v = -2*beatPeriod;
|
adamstark@17
|
603 double wcumscore;
|
adamstark@5
|
604
|
adamstark@5
|
605
|
adamstark@5
|
606 // create window
|
adamstark@5
|
607 for (int i = 0;i < winsize;i++)
|
adamstark@5
|
608 {
|
adamstark@20
|
609 w1[i] = exp((-1*pow(tightness*log(-v/beatPeriod),2))/2);
|
adamstark@5
|
610 v = v+1;
|
adamstark@5
|
611 }
|
adamstark@5
|
612
|
adamstark@5
|
613 // calculate new cumulative score value
|
adamstark@5
|
614 max = 0;
|
adamstark@5
|
615 int n = 0;
|
adamstark@5
|
616 for (int i=start;i <= end;i++)
|
adamstark@5
|
617 {
|
adamstark@21
|
618 wcumscore = cumulativeScore[i]*w1[n];
|
adamstark@5
|
619
|
adamstark@5
|
620 if (wcumscore > max)
|
adamstark@5
|
621 {
|
adamstark@5
|
622 max = wcumscore;
|
adamstark@5
|
623 }
|
adamstark@5
|
624 n++;
|
adamstark@5
|
625 }
|
adamstark@5
|
626
|
adamstark@5
|
627
|
adamstark@5
|
628 // shift cumulative score back one
|
adamstark@21
|
629 for (int i = 0;i < (onsetDFBufferSize-1);i++)
|
adamstark@5
|
630 {
|
adamstark@21
|
631 cumulativeScore[i] = cumulativeScore[i+1];
|
adamstark@5
|
632 }
|
adamstark@5
|
633
|
adamstark@5
|
634 // add new value to cumulative score
|
adamstark@22
|
635 cumulativeScore[onsetDFBufferSize-1] = ((1-alpha)*odfSample) + (alpha*max);
|
adamstark@5
|
636
|
adamstark@21
|
637 latestCumulativeScoreValue = cumulativeScore[onsetDFBufferSize-1];
|
adamstark@21
|
638
|
adamstark@5
|
639 }
|
adamstark@5
|
640
|
adamstark@14
|
641 //=======================================================================
|
adamstark@20
|
642 void BTrack::predictBeat()
|
adamstark@5
|
643 {
|
adamstark@21
|
644 int windowSize = (int) beatPeriod;
|
adamstark@21
|
645 double futureCumulativeScore[onsetDFBufferSize + windowSize];
|
adamstark@21
|
646 double w2[windowSize];
|
adamstark@5
|
647 // copy cumscore to first part of fcumscore
|
adamstark@21
|
648 for (int i = 0;i < onsetDFBufferSize;i++)
|
adamstark@5
|
649 {
|
adamstark@21
|
650 futureCumulativeScore[i] = cumulativeScore[i];
|
adamstark@5
|
651 }
|
adamstark@5
|
652
|
adamstark@5
|
653 // create future window
|
adamstark@17
|
654 double v = 1;
|
adamstark@21
|
655 for (int i = 0;i < windowSize;i++)
|
adamstark@5
|
656 {
|
adamstark@20
|
657 w2[i] = exp((-1*pow((v - (beatPeriod/2)),2)) / (2*pow((beatPeriod/2) ,2)));
|
adamstark@5
|
658 v++;
|
adamstark@5
|
659 }
|
adamstark@5
|
660
|
adamstark@5
|
661 // create past window
|
adamstark@20
|
662 v = -2*beatPeriod;
|
adamstark@21
|
663 int start = onsetDFBufferSize - round(2*beatPeriod);
|
adamstark@21
|
664 int end = onsetDFBufferSize - round(beatPeriod/2);
|
adamstark@5
|
665 int pastwinsize = end-start+1;
|
adamstark@17
|
666 double w1[pastwinsize];
|
adamstark@5
|
667
|
adamstark@5
|
668 for (int i = 0;i < pastwinsize;i++)
|
adamstark@5
|
669 {
|
adamstark@20
|
670 w1[i] = exp((-1*pow(tightness*log(-v/beatPeriod),2))/2);
|
adamstark@5
|
671 v = v+1;
|
adamstark@5
|
672 }
|
adamstark@5
|
673
|
adamstark@5
|
674
|
adamstark@5
|
675
|
adamstark@5
|
676 // calculate future cumulative score
|
adamstark@17
|
677 double max;
|
adamstark@5
|
678 int n;
|
adamstark@17
|
679 double wcumscore;
|
adamstark@21
|
680 for (int i = onsetDFBufferSize;i < (onsetDFBufferSize+windowSize);i++)
|
adamstark@5
|
681 {
|
adamstark@20
|
682 start = i - round(2*beatPeriod);
|
adamstark@20
|
683 end = i - round(beatPeriod/2);
|
adamstark@5
|
684
|
adamstark@5
|
685 max = 0;
|
adamstark@5
|
686 n = 0;
|
adamstark@5
|
687 for (int k=start;k <= end;k++)
|
adamstark@5
|
688 {
|
adamstark@21
|
689 wcumscore = futureCumulativeScore[k]*w1[n];
|
adamstark@5
|
690
|
adamstark@5
|
691 if (wcumscore > max)
|
adamstark@5
|
692 {
|
adamstark@5
|
693 max = wcumscore;
|
adamstark@5
|
694 }
|
adamstark@5
|
695 n++;
|
adamstark@5
|
696 }
|
adamstark@5
|
697
|
adamstark@21
|
698 futureCumulativeScore[i] = max;
|
adamstark@5
|
699 }
|
adamstark@5
|
700
|
adamstark@5
|
701
|
adamstark@5
|
702 // predict beat
|
adamstark@5
|
703 max = 0;
|
adamstark@5
|
704 n = 0;
|
adamstark@5
|
705
|
adamstark@21
|
706 for (int i = onsetDFBufferSize;i < (onsetDFBufferSize+windowSize);i++)
|
adamstark@5
|
707 {
|
adamstark@21
|
708 wcumscore = futureCumulativeScore[i]*w2[n];
|
adamstark@5
|
709
|
adamstark@5
|
710 if (wcumscore > max)
|
adamstark@5
|
711 {
|
adamstark@5
|
712 max = wcumscore;
|
adamstark@21
|
713 beatCounter = n;
|
adamstark@5
|
714 }
|
adamstark@5
|
715
|
adamstark@5
|
716 n++;
|
adamstark@5
|
717 }
|
adamstark@5
|
718
|
adamstark@5
|
719 // set next prediction time
|
adamstark@21
|
720 m0 = beatCounter+round(beatPeriod/2);
|
adamstark@5
|
721
|
adamstark@5
|
722
|
adamstark@5
|
723 } |