annotate src/BTrack.cpp @ 66:b387d8327729

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