annotate src/BTrack.cpp @ 22:a8e3e95d14e4 develop

Renamed many variables, functions and arguments so they have more sensible names. Also removed an apparently redundant variable in OnsetDetectionFunction called wframe
author Adam <adamstark.uk@gmail.com>
date Fri, 24 Jan 2014 21:45:55 +0000
parents ef4721e7466c
children 92ee4ace9d46
rev   line source
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@5 130
adamstark@21 131 onsetDF = new double[onsetDFBufferSize]; // create df_buffer
adamstark@21 132 cumulativeScore = new double[onsetDFBufferSize]; // create cumscore
adamstark@5 133
adamstark@5 134
adamstark@5 135 // initialise df_buffer to zeros
adamstark@21 136 for (int i = 0;i < onsetDFBufferSize;i++)
adamstark@5 137 {
adamstark@21 138 onsetDF[i] = 0;
adamstark@21 139 cumulativeScore[i] = 0;
adamstark@5 140
adamstark@5 141
adamstark@20 142 if ((i % ((int) round(beatPeriod))) == 0)
adamstark@5 143 {
adamstark@21 144 onsetDF[i] = 1;
adamstark@5 145 }
adamstark@5 146 }
adamstark@5 147 }
adamstark@5 148
adamstark@14 149 //=======================================================================
adamstark@20 150 bool BTrack::beatDueInCurrentFrame()
adamstark@20 151 {
adamstark@20 152 return beatDueInFrame;
adamstark@20 153 }
adamstark@20 154
adamstark@20 155 //=======================================================================
adamstark@20 156 int BTrack::getHopSize()
adamstark@20 157 {
adamstark@20 158 return hopSize;
adamstark@20 159 }
adamstark@20 160
adamstark@20 161 //=======================================================================
adamstark@21 162 double BTrack::getLatestCumulativeScoreValue()
adamstark@21 163 {
adamstark@21 164 return latestCumulativeScoreValue;
adamstark@21 165 }
adamstark@21 166
adamstark@21 167 //=======================================================================
adamstark@18 168 void BTrack::processAudioFrame(double *frame)
adamstark@18 169 {
adamstark@18 170 // calculate the onset detection function sample for the frame
adamstark@22 171 double sample = odf.calculateOnsetDetectionFunctionSample(frame);
adamstark@18 172
adamstark@19 173
adamstark@18 174
adamstark@18 175 // process the new onset detection function sample in the beat tracking algorithm
adamstark@18 176 processOnsetDetectionFunctionSample(sample);
adamstark@18 177 }
adamstark@18 178
adamstark@18 179 //=======================================================================
adamstark@18 180 void BTrack::processOnsetDetectionFunctionSample(double newSample)
adamstark@19 181 {
adamstark@19 182 // we need to ensure that the onset
adamstark@19 183 // detection function sample is positive
adamstark@19 184 newSample = fabs(newSample);
adamstark@19 185
adamstark@19 186 // add a tiny constant to the sample to stop it from ever going
adamstark@19 187 // to zero. this is to avoid problems further down the line
adamstark@19 188 newSample = newSample + 0.0001;
adamstark@19 189
adamstark@5 190 m0--;
adamstark@21 191 beatCounter--;
adamstark@20 192 beatDueInFrame = false;
adamstark@5 193
adamstark@5 194 // move all samples back one step
adamstark@21 195 for (int i=0;i < (onsetDFBufferSize-1);i++)
adamstark@5 196 {
adamstark@21 197 onsetDF[i] = onsetDF[i+1];
adamstark@5 198 }
adamstark@5 199
adamstark@5 200 // add new sample at the end
adamstark@21 201 onsetDF[onsetDFBufferSize-1] = newSample;
adamstark@5 202
adamstark@5 203 // update cumulative score
adamstark@20 204 updateCumulativeScore(newSample);
adamstark@5 205
adamstark@5 206 // if we are halfway between beats
adamstark@5 207 if (m0 == 0)
adamstark@5 208 {
adamstark@20 209 predictBeat();
adamstark@5 210 }
adamstark@5 211
adamstark@5 212 // if we are at a beat
adamstark@21 213 if (beatCounter == 0)
adamstark@5 214 {
adamstark@20 215 beatDueInFrame = true; // indicate a beat should be output
adamstark@5 216
adamstark@5 217 // recalculate the tempo
adamstark@20 218 resampleOnsetDetectionFunction();
adamstark@20 219 calculateTempo();
adamstark@5 220 }
adamstark@5 221 }
adamstark@5 222
adamstark@14 223 //=======================================================================
adamstark@20 224 void BTrack::setTempo(double tempo)
adamstark@5 225 {
adamstark@5 226
adamstark@5 227 /////////// TEMPO INDICATION RESET //////////////////
adamstark@5 228
adamstark@5 229 // firstly make sure tempo is between 80 and 160 bpm..
adamstark@5 230 while (tempo > 160)
adamstark@5 231 {
adamstark@5 232 tempo = tempo/2;
adamstark@5 233 }
adamstark@5 234
adamstark@5 235 while (tempo < 80)
adamstark@5 236 {
adamstark@5 237 tempo = tempo * 2;
adamstark@5 238 }
adamstark@5 239
adamstark@5 240 // convert tempo from bpm value to integer index of tempo probability
adamstark@5 241 int tempo_index = (int) round((tempo - 80)/2);
adamstark@5 242
adamstark@5 243 // now set previous tempo observations to zero
adamstark@5 244 for (int i=0;i < 41;i++)
adamstark@5 245 {
adamstark@21 246 prevDelta[i] = 0;
adamstark@5 247 }
adamstark@5 248
adamstark@5 249 // set desired tempo index to 1
adamstark@21 250 prevDelta[tempo_index] = 1;
adamstark@5 251
adamstark@5 252
adamstark@5 253 /////////// CUMULATIVE SCORE ARTIFICAL TEMPO UPDATE //////////////////
adamstark@5 254
adamstark@5 255 // calculate new beat period
adamstark@20 256 int new_bperiod = (int) round(60/((((double) hopSize)/44100)*tempo));
adamstark@5 257
adamstark@5 258 int bcounter = 1;
adamstark@5 259 // initialise df_buffer to zeros
adamstark@21 260 for (int i = (onsetDFBufferSize-1);i >= 0;i--)
adamstark@5 261 {
adamstark@5 262 if (bcounter == 1)
adamstark@5 263 {
adamstark@21 264 cumulativeScore[i] = 150;
adamstark@21 265 onsetDF[i] = 150;
adamstark@5 266 }
adamstark@5 267 else
adamstark@5 268 {
adamstark@21 269 cumulativeScore[i] = 10;
adamstark@21 270 onsetDF[i] = 10;
adamstark@5 271 }
adamstark@5 272
adamstark@5 273 bcounter++;
adamstark@5 274
adamstark@5 275 if (bcounter > new_bperiod)
adamstark@5 276 {
adamstark@5 277 bcounter = 1;
adamstark@5 278 }
adamstark@5 279 }
adamstark@5 280
adamstark@5 281 /////////// INDICATE THAT THIS IS A BEAT //////////////////
adamstark@5 282
adamstark@5 283 // beat is now
adamstark@21 284 beatCounter = 0;
adamstark@5 285
adamstark@5 286 // offbeat is half of new beat period away
adamstark@17 287 m0 = (int) round(((double) new_bperiod)/2);
adamstark@5 288 }
adamstark@5 289
adamstark@14 290 //=======================================================================
adamstark@20 291 void BTrack::fixTempo(double tempo)
adamstark@5 292 {
adamstark@5 293 // firstly make sure tempo is between 80 and 160 bpm..
adamstark@5 294 while (tempo > 160)
adamstark@5 295 {
adamstark@5 296 tempo = tempo/2;
adamstark@5 297 }
adamstark@5 298
adamstark@5 299 while (tempo < 80)
adamstark@5 300 {
adamstark@5 301 tempo = tempo * 2;
adamstark@5 302 }
adamstark@5 303
adamstark@5 304 // convert tempo from bpm value to integer index of tempo probability
adamstark@5 305 int tempo_index = (int) round((tempo - 80)/2);
adamstark@5 306
adamstark@5 307 // now set previous fixed previous tempo observation values to zero
adamstark@5 308 for (int i=0;i < 41;i++)
adamstark@5 309 {
adamstark@21 310 prevDeltaFixed[i] = 0;
adamstark@5 311 }
adamstark@5 312
adamstark@5 313 // set desired tempo index to 1
adamstark@21 314 prevDeltaFixed[tempo_index] = 1;
adamstark@5 315
adamstark@5 316 // set the tempo fix flag
adamstark@21 317 tempoFixed = true;
adamstark@5 318 }
adamstark@5 319
adamstark@14 320 //=======================================================================
adamstark@20 321 void BTrack::doNotFixTempo()
adamstark@5 322 {
adamstark@5 323 // set the tempo fix flag
adamstark@21 324 tempoFixed = false;
adamstark@5 325 }
adamstark@5 326
adamstark@14 327 //=======================================================================
adamstark@20 328 void BTrack::resampleOnsetDetectionFunction()
adamstark@5 329 {
adamstark@5 330 float output[512];
adamstark@21 331 float input[onsetDFBufferSize];
adamstark@17 332
adamstark@21 333 for (int i = 0;i < onsetDFBufferSize;i++)
adamstark@17 334 {
adamstark@21 335 input[i] = (float) onsetDF[i];
adamstark@17 336 }
adamstark@5 337
adamstark@21 338 double src_ratio = 512.0/((double) onsetDFBufferSize);
adamstark@21 339 int BUFFER_LEN = onsetDFBufferSize;
adamstark@5 340 int output_len;
adamstark@5 341 SRC_DATA src_data ;
adamstark@5 342
adamstark@5 343 //output_len = (int) floor (((double) BUFFER_LEN) * src_ratio) ;
adamstark@5 344 output_len = 512;
adamstark@5 345
adamstark@17 346 src_data.data_in = input;
adamstark@5 347 src_data.input_frames = BUFFER_LEN;
adamstark@5 348
adamstark@5 349 src_data.src_ratio = src_ratio;
adamstark@5 350
adamstark@5 351 src_data.data_out = output;
adamstark@5 352 src_data.output_frames = output_len;
adamstark@5 353
adamstark@5 354 src_simple (&src_data, SRC_SINC_BEST_QUALITY, 1);
adamstark@5 355
adamstark@5 356 for (int i = 0;i < output_len;i++)
adamstark@5 357 {
adamstark@21 358 resampledOnsetDF[i] = (double) src_data.data_out[i];
adamstark@5 359 }
adamstark@5 360 }
adamstark@5 361
adamstark@14 362 //=======================================================================
adamstark@20 363 void BTrack::calculateTempo()
adamstark@5 364 {
adamstark@5 365 // adaptive threshold on input
adamstark@21 366 adaptiveThreshold(resampledOnsetDF,512);
adamstark@5 367
adamstark@5 368 // calculate auto-correlation function of detection function
adamstark@21 369 calculateBalancedACF(resampledOnsetDF);
adamstark@5 370
adamstark@5 371 // calculate output of comb filterbank
adamstark@20 372 calculateOutputOfCombFilterBank();
adamstark@5 373
adamstark@5 374
adamstark@5 375 // adaptive threshold on rcf
adamstark@21 376 adaptiveThreshold(combFilterBankOutput,128);
adamstark@5 377
adamstark@5 378
adamstark@5 379 int t_index;
adamstark@5 380 int t_index2;
adamstark@22 381 // calculate tempo observation vector from beat period observation vector
adamstark@5 382 for (int i = 0;i < 41;i++)
adamstark@5 383 {
adamstark@22 384 t_index = (int) round(tempoToLagFactor / ((double) ((2*i)+80)));
adamstark@22 385 t_index2 = (int) round(tempoToLagFactor / ((double) ((4*i)+160)));
adamstark@5 386
adamstark@5 387
adamstark@21 388 tempoObservationVector[i] = combFilterBankOutput[t_index-1] + combFilterBankOutput[t_index2-1];
adamstark@5 389 }
adamstark@5 390
adamstark@5 391
adamstark@17 392 double maxval;
adamstark@17 393 double maxind;
adamstark@17 394 double curval;
adamstark@5 395
adamstark@5 396 // if tempo is fixed then always use a fixed set of tempi as the previous observation probability function
adamstark@21 397 if (tempoFixed)
adamstark@5 398 {
adamstark@5 399 for (int k = 0;k < 41;k++)
adamstark@5 400 {
adamstark@21 401 prevDelta[k] = prevDeltaFixed[k];
adamstark@5 402 }
adamstark@5 403 }
adamstark@5 404
adamstark@5 405 for (int j=0;j < 41;j++)
adamstark@5 406 {
adamstark@5 407 maxval = -1;
adamstark@5 408 for (int i = 0;i < 41;i++)
adamstark@5 409 {
adamstark@21 410 curval = prevDelta[i]*tempoTransitionMatrix[i][j];
adamstark@5 411
adamstark@5 412 if (curval > maxval)
adamstark@5 413 {
adamstark@5 414 maxval = curval;
adamstark@5 415 }
adamstark@5 416 }
adamstark@5 417
adamstark@21 418 delta[j] = maxval*tempoObservationVector[j];
adamstark@5 419 }
adamstark@5 420
adamstark@5 421
adamstark@20 422 normaliseArray(delta,41);
adamstark@5 423
adamstark@5 424 maxind = -1;
adamstark@5 425 maxval = -1;
adamstark@5 426
adamstark@5 427 for (int j=0;j < 41;j++)
adamstark@5 428 {
adamstark@5 429 if (delta[j] > maxval)
adamstark@5 430 {
adamstark@5 431 maxval = delta[j];
adamstark@5 432 maxind = j;
adamstark@5 433 }
adamstark@5 434
adamstark@21 435 prevDelta[j] = delta[j];
adamstark@5 436 }
adamstark@5 437
adamstark@20 438 beatPeriod = round((60.0*44100.0)/(((2*maxind)+80)*((double) hopSize)));
adamstark@5 439
adamstark@20 440 if (beatPeriod > 0)
adamstark@5 441 {
adamstark@21 442 estimatedTempo = 60.0/((((double) hopSize) / 44100.0)*beatPeriod);
adamstark@5 443 }
adamstark@5 444 }
adamstark@5 445
adamstark@14 446 //=======================================================================
adamstark@20 447 void BTrack::adaptiveThreshold(double *x,int N)
adamstark@5 448 {
adamstark@5 449 int i = 0;
adamstark@5 450 int k,t = 0;
adamstark@17 451 double x_thresh[N];
adamstark@5 452
adamstark@5 453 int p_post = 7;
adamstark@5 454 int p_pre = 8;
adamstark@5 455
adamstark@15 456 t = std::min(N,p_post); // what is smaller, p_post of df size. This is to avoid accessing outside of arrays
adamstark@5 457
adamstark@5 458 // find threshold for first 't' samples, where a full average cannot be computed yet
adamstark@5 459 for (i = 0;i <= t;i++)
adamstark@5 460 {
adamstark@15 461 k = std::min((i+p_pre),N);
adamstark@20 462 x_thresh[i] = calculateMeanOfArray(x,1,k);
adamstark@5 463 }
adamstark@5 464 // find threshold for bulk of samples across a moving average from [i-p_pre,i+p_post]
adamstark@5 465 for (i = t+1;i < N-p_post;i++)
adamstark@5 466 {
adamstark@20 467 x_thresh[i] = calculateMeanOfArray(x,i-p_pre,i+p_post);
adamstark@5 468 }
adamstark@5 469 // for last few samples calculate threshold, again, not enough samples to do as above
adamstark@5 470 for (i = N-p_post;i < N;i++)
adamstark@5 471 {
adamstark@15 472 k = std::max((i-p_post),1);
adamstark@20 473 x_thresh[i] = calculateMeanOfArray(x,k,N);
adamstark@5 474 }
adamstark@5 475
adamstark@5 476 // subtract the threshold from the detection function and check that it is not less than 0
adamstark@5 477 for (i = 0;i < N;i++)
adamstark@5 478 {
adamstark@5 479 x[i] = x[i] - x_thresh[i];
adamstark@5 480 if (x[i] < 0)
adamstark@5 481 {
adamstark@5 482 x[i] = 0;
adamstark@5 483 }
adamstark@5 484 }
adamstark@5 485 }
adamstark@5 486
adamstark@14 487 //=======================================================================
adamstark@20 488 void BTrack::calculateOutputOfCombFilterBank()
adamstark@5 489 {
adamstark@5 490 int numelem;
adamstark@5 491
adamstark@5 492 for (int i = 0;i < 128;i++)
adamstark@5 493 {
adamstark@21 494 combFilterBankOutput[i] = 0;
adamstark@5 495 }
adamstark@5 496
adamstark@5 497 numelem = 4;
adamstark@5 498
adamstark@5 499 for (int i = 2;i <= 127;i++) // max beat period
adamstark@5 500 {
adamstark@5 501 for (int a = 1;a <= numelem;a++) // number of comb elements
adamstark@5 502 {
adamstark@5 503 for (int b = 1-a;b <= a-1;b++) // general state using normalisation of comb elements
adamstark@5 504 {
adamstark@21 505 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 506 }
adamstark@5 507 }
adamstark@5 508 }
adamstark@5 509 }
adamstark@5 510
adamstark@14 511 //=======================================================================
adamstark@20 512 void BTrack::calculateBalancedACF(double *df_thresh)
adamstark@5 513 {
adamstark@5 514 int l, n = 0;
adamstark@17 515 double sum, tmp;
adamstark@5 516
adamstark@5 517 // for l lags from 0-511
adamstark@5 518 for (l = 0;l < 512;l++)
adamstark@5 519 {
adamstark@5 520 sum = 0;
adamstark@5 521
adamstark@5 522 // for n samples from 0 - (512-lag)
adamstark@5 523 for (n = 0;n < (512-l);n++)
adamstark@5 524 {
adamstark@5 525 tmp = df_thresh[n] * df_thresh[n+l]; // multiply current sample n by sample (n+l)
adamstark@5 526 sum = sum + tmp; // add to sum
adamstark@5 527 }
adamstark@5 528
adamstark@5 529 acf[l] = sum / (512-l); // weight by number of mults and add to acf buffer
adamstark@5 530 }
adamstark@5 531 }
adamstark@5 532
adamstark@14 533 //=======================================================================
adamstark@22 534 double BTrack::calculateMeanOfArray(double *array,int startIndex,int endIndex)
adamstark@5 535 {
adamstark@5 536 int i;
adamstark@6 537 double sum = 0;
adamstark@6 538
adamstark@22 539 int length = endIndex - startIndex;
adamstark@5 540
adamstark@5 541 // find sum
adamstark@22 542 for (i = startIndex;i < endIndex;i++)
adamstark@5 543 {
adamstark@5 544 sum = sum + array[i];
adamstark@5 545 }
adamstark@5 546
adamstark@6 547 if (length > 0)
adamstark@6 548 {
adamstark@6 549 return sum / length; // average and return
adamstark@6 550 }
adamstark@6 551 else
adamstark@6 552 {
adamstark@6 553 return 0;
adamstark@6 554 }
adamstark@5 555 }
adamstark@5 556
adamstark@14 557 //=======================================================================
adamstark@20 558 void BTrack::normaliseArray(double *array,int N)
adamstark@5 559 {
adamstark@5 560 double sum = 0;
adamstark@5 561
adamstark@5 562 for (int i = 0;i < N;i++)
adamstark@5 563 {
adamstark@5 564 if (array[i] > 0)
adamstark@5 565 {
adamstark@5 566 sum = sum + array[i];
adamstark@5 567 }
adamstark@5 568 }
adamstark@5 569
adamstark@5 570 if (sum > 0)
adamstark@5 571 {
adamstark@5 572 for (int i = 0;i < N;i++)
adamstark@5 573 {
adamstark@5 574 array[i] = array[i] / sum;
adamstark@5 575 }
adamstark@5 576 }
adamstark@5 577 }
adamstark@5 578
adamstark@14 579 //=======================================================================
adamstark@22 580 void BTrack::updateCumulativeScore(double odfSample)
adamstark@5 581 {
adamstark@5 582 int start, end, winsize;
adamstark@17 583 double max;
adamstark@5 584
adamstark@21 585 start = onsetDFBufferSize - round(2*beatPeriod);
adamstark@21 586 end = onsetDFBufferSize - round(beatPeriod/2);
adamstark@5 587 winsize = end-start+1;
adamstark@5 588
adamstark@17 589 double w1[winsize];
adamstark@20 590 double v = -2*beatPeriod;
adamstark@17 591 double wcumscore;
adamstark@5 592
adamstark@5 593
adamstark@5 594 // create window
adamstark@5 595 for (int i = 0;i < winsize;i++)
adamstark@5 596 {
adamstark@20 597 w1[i] = exp((-1*pow(tightness*log(-v/beatPeriod),2))/2);
adamstark@5 598 v = v+1;
adamstark@5 599 }
adamstark@5 600
adamstark@5 601 // calculate new cumulative score value
adamstark@5 602 max = 0;
adamstark@5 603 int n = 0;
adamstark@5 604 for (int i=start;i <= end;i++)
adamstark@5 605 {
adamstark@21 606 wcumscore = cumulativeScore[i]*w1[n];
adamstark@5 607
adamstark@5 608 if (wcumscore > max)
adamstark@5 609 {
adamstark@5 610 max = wcumscore;
adamstark@5 611 }
adamstark@5 612 n++;
adamstark@5 613 }
adamstark@5 614
adamstark@5 615
adamstark@5 616 // shift cumulative score back one
adamstark@21 617 for (int i = 0;i < (onsetDFBufferSize-1);i++)
adamstark@5 618 {
adamstark@21 619 cumulativeScore[i] = cumulativeScore[i+1];
adamstark@5 620 }
adamstark@5 621
adamstark@5 622 // add new value to cumulative score
adamstark@22 623 cumulativeScore[onsetDFBufferSize-1] = ((1-alpha)*odfSample) + (alpha*max);
adamstark@5 624
adamstark@21 625 latestCumulativeScoreValue = cumulativeScore[onsetDFBufferSize-1];
adamstark@21 626
adamstark@5 627 }
adamstark@5 628
adamstark@14 629 //=======================================================================
adamstark@20 630 void BTrack::predictBeat()
adamstark@5 631 {
adamstark@21 632 int windowSize = (int) beatPeriod;
adamstark@21 633 double futureCumulativeScore[onsetDFBufferSize + windowSize];
adamstark@21 634 double w2[windowSize];
adamstark@5 635 // copy cumscore to first part of fcumscore
adamstark@21 636 for (int i = 0;i < onsetDFBufferSize;i++)
adamstark@5 637 {
adamstark@21 638 futureCumulativeScore[i] = cumulativeScore[i];
adamstark@5 639 }
adamstark@5 640
adamstark@5 641 // create future window
adamstark@17 642 double v = 1;
adamstark@21 643 for (int i = 0;i < windowSize;i++)
adamstark@5 644 {
adamstark@20 645 w2[i] = exp((-1*pow((v - (beatPeriod/2)),2)) / (2*pow((beatPeriod/2) ,2)));
adamstark@5 646 v++;
adamstark@5 647 }
adamstark@5 648
adamstark@5 649 // create past window
adamstark@20 650 v = -2*beatPeriod;
adamstark@21 651 int start = onsetDFBufferSize - round(2*beatPeriod);
adamstark@21 652 int end = onsetDFBufferSize - round(beatPeriod/2);
adamstark@5 653 int pastwinsize = end-start+1;
adamstark@17 654 double w1[pastwinsize];
adamstark@5 655
adamstark@5 656 for (int i = 0;i < pastwinsize;i++)
adamstark@5 657 {
adamstark@20 658 w1[i] = exp((-1*pow(tightness*log(-v/beatPeriod),2))/2);
adamstark@5 659 v = v+1;
adamstark@5 660 }
adamstark@5 661
adamstark@5 662
adamstark@5 663
adamstark@5 664 // calculate future cumulative score
adamstark@17 665 double max;
adamstark@5 666 int n;
adamstark@17 667 double wcumscore;
adamstark@21 668 for (int i = onsetDFBufferSize;i < (onsetDFBufferSize+windowSize);i++)
adamstark@5 669 {
adamstark@20 670 start = i - round(2*beatPeriod);
adamstark@20 671 end = i - round(beatPeriod/2);
adamstark@5 672
adamstark@5 673 max = 0;
adamstark@5 674 n = 0;
adamstark@5 675 for (int k=start;k <= end;k++)
adamstark@5 676 {
adamstark@21 677 wcumscore = futureCumulativeScore[k]*w1[n];
adamstark@5 678
adamstark@5 679 if (wcumscore > max)
adamstark@5 680 {
adamstark@5 681 max = wcumscore;
adamstark@5 682 }
adamstark@5 683 n++;
adamstark@5 684 }
adamstark@5 685
adamstark@21 686 futureCumulativeScore[i] = max;
adamstark@5 687 }
adamstark@5 688
adamstark@5 689
adamstark@5 690 // predict beat
adamstark@5 691 max = 0;
adamstark@5 692 n = 0;
adamstark@5 693
adamstark@21 694 for (int i = onsetDFBufferSize;i < (onsetDFBufferSize+windowSize);i++)
adamstark@5 695 {
adamstark@21 696 wcumscore = futureCumulativeScore[i]*w2[n];
adamstark@5 697
adamstark@5 698 if (wcumscore > max)
adamstark@5 699 {
adamstark@5 700 max = wcumscore;
adamstark@21 701 beatCounter = n;
adamstark@5 702 }
adamstark@5 703
adamstark@5 704 n++;
adamstark@5 705 }
adamstark@5 706
adamstark@5 707 // set next prediction time
adamstark@21 708 m0 = beatCounter+round(beatPeriod/2);
adamstark@5 709
adamstark@5 710
adamstark@5 711 }