c@410
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
c@410
|
2
|
c@410
|
3 /*
|
c@410
|
4 QM DSP Library
|
c@410
|
5
|
c@410
|
6 Centre for Digital Music, Queen Mary, University of London.
|
c@410
|
7 This file copyright 2005-2006 Christian Landone.and Matthew Davies.
|
c@309
|
8
|
c@309
|
9 This program is free software; you can redistribute it and/or
|
c@309
|
10 modify it under the terms of the GNU General Public License as
|
c@309
|
11 published by the Free Software Foundation; either version 2 of the
|
c@309
|
12 License, or (at your option) any later version. See the file
|
c@410
|
13 COPYING included with this distribution for more information.
|
c@410
|
14 */
|
c@410
|
15
|
c@410
|
16 #include "TempoTrack.h"
|
c@410
|
17
|
c@410
|
18 #include "maths/MathAliases.h"
|
c@410
|
19 #include "maths/MathUtilities.h"
|
c@410
|
20
|
c@410
|
21 #include <iostream>
|
c@410
|
22
|
c@410
|
23 #include <cassert>
|
cannam@490
|
24 #include <cmath>
|
cannam@492
|
25 #include <cstdlib>
|
c@410
|
26
|
c@410
|
27 //#define DEBUG_TEMPO_TRACK 1
|
c@410
|
28
|
c@410
|
29 //////////////////////////////////////////////////////////////////////
|
c@410
|
30 // Construction/Destruction
|
c@410
|
31 //////////////////////////////////////////////////////////////////////
|
c@410
|
32
|
c@410
|
33 TempoTrack::TempoTrack( TTParams Params )
|
c@410
|
34 {
|
c@410
|
35 m_tempoScratch = NULL;
|
c@410
|
36 m_rawDFFrame = NULL;
|
c@410
|
37 m_smoothDFFrame = NULL;
|
c@410
|
38 m_frameACF = NULL;
|
cannam@479
|
39 m_smoothRCF = NULL;
|
c@410
|
40
|
c@410
|
41 m_dataLength = 0;
|
c@410
|
42 m_winLength = 0;
|
c@410
|
43 m_lagLength = 0;
|
c@410
|
44
|
c@410
|
45 m_rayparam = 0;
|
c@410
|
46 m_sigma = 0;
|
c@410
|
47 m_DFWVNnorm = 0;
|
c@410
|
48
|
c@410
|
49 initialise( Params );
|
c@410
|
50 }
|
c@410
|
51
|
c@410
|
52 TempoTrack::~TempoTrack()
|
c@410
|
53 {
|
c@410
|
54 deInitialise();
|
c@410
|
55 }
|
c@410
|
56
|
c@410
|
57 void TempoTrack::initialise( TTParams Params )
|
cannam@479
|
58 {
|
c@410
|
59 m_winLength = Params.winLength;
|
c@410
|
60 m_lagLength = Params.lagLength;
|
c@410
|
61
|
cannam@479
|
62 m_rayparam = 43.0;
|
c@410
|
63 m_sigma = sqrt(3.9017);
|
c@410
|
64 m_DFWVNnorm = exp( ( log( 2.0 ) / m_rayparam ) * ( m_winLength + 2 ) );
|
c@410
|
65
|
c@410
|
66 m_rawDFFrame = new double[ m_winLength ];
|
c@410
|
67 m_smoothDFFrame = new double[ m_winLength ];
|
c@410
|
68 m_frameACF = new double[ m_winLength ];
|
c@410
|
69 m_tempoScratch = new double[ m_lagLength ];
|
cannam@479
|
70 m_smoothRCF = new double[ m_lagLength ];
|
c@410
|
71
|
c@410
|
72 m_DFFramer.configure( m_winLength, m_lagLength );
|
cannam@479
|
73
|
c@410
|
74 m_DFPParams.length = m_winLength;
|
c@410
|
75 m_DFPParams.AlphaNormParam = Params.alpha;
|
c@410
|
76 m_DFPParams.LPOrd = Params.LPOrd;
|
c@410
|
77 m_DFPParams.LPACoeffs = Params.LPACoeffs;
|
c@410
|
78 m_DFPParams.LPBCoeffs = Params.LPBCoeffs;
|
c@410
|
79 m_DFPParams.winPre = Params.WinT.pre;
|
c@410
|
80 m_DFPParams.winPost = Params.WinT.post;
|
c@410
|
81 m_DFPParams.isMedianPositive = true;
|
cannam@479
|
82
|
c@410
|
83 m_DFConditioning = new DFProcess( m_DFPParams );
|
c@410
|
84
|
cannam@479
|
85 // these are parameters for smoothing m_tempoScratch
|
c@410
|
86 m_RCFPParams.length = m_lagLength;
|
c@410
|
87 m_RCFPParams.AlphaNormParam = Params.alpha;
|
c@410
|
88 m_RCFPParams.LPOrd = Params.LPOrd;
|
c@410
|
89 m_RCFPParams.LPACoeffs = Params.LPACoeffs;
|
c@410
|
90 m_RCFPParams.LPBCoeffs = Params.LPBCoeffs;
|
c@410
|
91 m_RCFPParams.winPre = Params.WinT.pre;
|
c@410
|
92 m_RCFPParams.winPost = Params.WinT.post;
|
c@410
|
93 m_RCFPParams.isMedianPositive = true;
|
c@410
|
94
|
c@410
|
95 m_RCFConditioning = new DFProcess( m_RCFPParams );
|
c@410
|
96 }
|
c@410
|
97
|
c@410
|
98 void TempoTrack::deInitialise()
|
cannam@479
|
99 {
|
c@410
|
100 delete [] m_rawDFFrame;
|
c@410
|
101 delete [] m_smoothDFFrame;
|
cannam@479
|
102 delete [] m_smoothRCF;
|
c@410
|
103 delete [] m_frameACF;
|
c@410
|
104 delete [] m_tempoScratch;
|
c@410
|
105 delete m_DFConditioning;
|
cannam@479
|
106 delete m_RCFConditioning;
|
c@410
|
107 }
|
c@410
|
108
|
c@414
|
109 void TempoTrack::createCombFilter(double* Filter, int winLength, int /* TSig */, double beatLag)
|
c@410
|
110 {
|
c@414
|
111 int i;
|
c@410
|
112
|
cannam@479
|
113 if( beatLag == 0 ) {
|
cannam@479
|
114 for( i = 0; i < winLength; i++ ) {
|
cannam@479
|
115 Filter[ i ] =
|
cannam@479
|
116 ( ( i + 1 ) / pow( m_rayparam, 2.0) ) *
|
cannam@479
|
117 exp( ( -pow(( i + 1 ),2.0 ) /
|
cannam@479
|
118 ( 2.0 * pow( m_rayparam, 2.0))));
|
cannam@479
|
119 }
|
cannam@479
|
120 } else {
|
cannam@479
|
121 m_sigma = beatLag/4;
|
cannam@479
|
122 for( i = 0; i < winLength; i++ ) {
|
cannam@479
|
123 double dlag = (double)(i+1) - beatLag;
|
cannam@479
|
124 Filter[ i ] = exp(-0.5 * pow(( dlag / m_sigma), 2.0) ) /
|
cannam@487
|
125 (sqrt(TWO_PI) * m_sigma);
|
cannam@479
|
126 }
|
c@410
|
127 }
|
c@410
|
128 }
|
c@410
|
129
|
c@410
|
130 double TempoTrack::tempoMM(double* ACF, double* weight, int tsig)
|
c@410
|
131 {
|
c@410
|
132 double period = 0;
|
c@410
|
133 double maxValRCF = 0.0;
|
c@414
|
134 int maxIndexRCF = 0;
|
c@410
|
135
|
c@410
|
136 double* pdPeaks;
|
c@410
|
137
|
c@414
|
138 int maxIndexTemp;
|
c@414
|
139 double maxValTemp;
|
c@414
|
140 int count;
|
cannam@479
|
141
|
c@414
|
142 int numelem,i,j;
|
c@410
|
143 int a, b;
|
c@410
|
144
|
cannam@479
|
145 for( i = 0; i < m_lagLength; i++ ) {
|
cannam@479
|
146 m_tempoScratch[ i ] = 0.0;
|
cannam@479
|
147 }
|
c@410
|
148
|
cannam@479
|
149 if( tsig == 0 ) {
|
cannam@479
|
150 //if time sig is unknown, use metrically unbiased version of Filterbank
|
cannam@479
|
151 numelem = 4;
|
cannam@479
|
152 } else {
|
cannam@479
|
153 numelem = tsig;
|
c@410
|
154 }
|
c@410
|
155
|
c@410
|
156 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
157 std::cerr << "tempoMM: m_winLength = " << m_winLength << ", m_lagLength = " << m_lagLength << ", numelem = " << numelem << std::endl;
|
c@410
|
158 #endif
|
c@410
|
159
|
cannam@479
|
160 for(i=1;i<m_lagLength-1;i++) {
|
cannam@479
|
161 //first and last output values are left intentionally as zero
|
cannam@479
|
162 for (a=1;a<=numelem;a++) {
|
cannam@479
|
163 for(b=(1-a);b<a;b++) {
|
cannam@479
|
164 if( tsig == 0 ) {
|
cannam@479
|
165 m_tempoScratch[i] += ACF[a*(i+1)+b-1] * (1.0 / (2.0 * (double)a-1)) * weight[i];
|
cannam@479
|
166 } else {
|
cannam@479
|
167 m_tempoScratch[i] += ACF[a*(i+1)+b-1] * 1 * weight[i];
|
cannam@479
|
168 }
|
cannam@479
|
169 }
|
cannam@479
|
170 }
|
c@410
|
171 }
|
c@410
|
172
|
c@410
|
173
|
cannam@479
|
174 //////////////////////////////////////////////////
|
cannam@479
|
175 // MODIFIED BEAT PERIOD EXTRACTION //////////////
|
cannam@479
|
176 /////////////////////////////////////////////////
|
c@410
|
177
|
cannam@479
|
178 // find smoothed version of RCF ( as applied to Detection Function)
|
cannam@479
|
179 m_RCFConditioning->process( m_tempoScratch, m_smoothRCF);
|
c@410
|
180
|
cannam@479
|
181 if (tsig != 0) { // i.e. in context dependent state
|
cannam@479
|
182
|
c@410
|
183 // NOW FIND MAX INDEX OF ACFOUT
|
cannam@479
|
184 for( i = 0; i < m_lagLength; i++) {
|
cannam@479
|
185 if( m_tempoScratch[ i ] > maxValRCF) {
|
cannam@479
|
186 maxValRCF = m_tempoScratch[ i ];
|
cannam@479
|
187 maxIndexRCF = i;
|
cannam@479
|
188 }
|
cannam@479
|
189 }
|
cannam@479
|
190
|
cannam@479
|
191 } else { // using rayleigh weighting
|
cannam@479
|
192
|
cannam@479
|
193 vector <vector<double> > rcfMat;
|
cannam@479
|
194
|
cannam@479
|
195 double sumRcf = 0.;
|
cannam@479
|
196
|
cannam@479
|
197 double maxVal = 0.;
|
cannam@479
|
198 // now find the two values which minimise rcfMat
|
cannam@479
|
199 double minVal = 0.;
|
cannam@479
|
200 int p_i = 1; // periodicity for row i;
|
cannam@479
|
201 int p_j = 1; //periodicity for column j;
|
cannam@479
|
202
|
cannam@479
|
203 for ( i=0; i<m_lagLength; i++) {
|
cannam@479
|
204 m_tempoScratch[i] =m_smoothRCF[i];
|
cannam@479
|
205 }
|
cannam@479
|
206
|
cannam@479
|
207 // normalise m_tempoScratch so that it sums to zero.
|
cannam@479
|
208 for ( i=0; i<m_lagLength; i++) {
|
cannam@479
|
209 sumRcf += m_tempoScratch[i];
|
cannam@479
|
210 }
|
cannam@479
|
211
|
cannam@479
|
212 for( i=0; i<m_lagLength; i++) {
|
cannam@479
|
213 m_tempoScratch[i] /= sumRcf;
|
cannam@479
|
214 }
|
cannam@479
|
215
|
cannam@479
|
216 // create a matrix to store m_tempoScratchValues modified by log2 ratio
|
cannam@479
|
217 for ( i=0; i<m_lagLength; i++) {
|
cannam@479
|
218 rcfMat.push_back ( vector<double>() ); // adds a new row...
|
cannam@479
|
219 }
|
cannam@479
|
220
|
cannam@479
|
221 for (i=0; i<m_lagLength; i++) {
|
cannam@479
|
222 for (j=0; j<m_lagLength; j++) {
|
cannam@479
|
223 rcfMat[i].push_back (0.);
|
cannam@479
|
224 }
|
cannam@479
|
225 }
|
cannam@479
|
226
|
cannam@479
|
227 // the 'i' and 'j' indices deliberately start from '1' and not '0'
|
cannam@479
|
228 for ( i=1; i<m_lagLength; i++) {
|
cannam@479
|
229 for (j=1; j<m_lagLength; j++) {
|
cannam@479
|
230 double log2PeriodRatio = log( static_cast<double>(i)/
|
cannam@479
|
231 static_cast<double>(j) ) /
|
cannam@479
|
232 log(2.0);
|
cannam@479
|
233 rcfMat[i][j] = ( abs(1.0-abs(log2PeriodRatio)) );
|
cannam@479
|
234 rcfMat[i][j] += ( 0.01*( 1./(m_tempoScratch[i]+m_tempoScratch[j]) ) );
|
cannam@479
|
235 }
|
cannam@479
|
236 }
|
cannam@479
|
237
|
cannam@479
|
238 // set diagonal equal to maximum value in rcfMat
|
cannam@479
|
239 // we don't want to pick one strong middle peak - we need a combination of two peaks.
|
cannam@479
|
240
|
cannam@479
|
241 for ( i=1; i<m_lagLength; i++) {
|
cannam@479
|
242 for (j=1; j<m_lagLength; j++) {
|
cannam@479
|
243 if (rcfMat[i][j] > maxVal) {
|
cannam@479
|
244 maxVal = rcfMat[i][j];
|
c@410
|
245 }
|
c@410
|
246 }
|
cannam@479
|
247 }
|
cannam@479
|
248
|
cannam@479
|
249 for ( i=1; i<m_lagLength; i++) {
|
cannam@479
|
250 rcfMat[i][i] = maxVal;
|
cannam@479
|
251 }
|
cannam@479
|
252
|
cannam@479
|
253 // now find the row and column number which minimise rcfMat
|
cannam@479
|
254 minVal = maxVal;
|
cannam@479
|
255
|
cannam@479
|
256 for ( i=1; i<m_lagLength; i++) {
|
cannam@479
|
257 for ( j=1; j<m_lagLength; j++) {
|
cannam@479
|
258 if (rcfMat[i][j] < minVal) {
|
cannam@479
|
259 minVal = rcfMat[i][j];
|
cannam@479
|
260 p_i = i;
|
cannam@479
|
261 p_j = j;
|
cannam@479
|
262 }
|
cannam@479
|
263 }
|
cannam@479
|
264 }
|
cannam@479
|
265
|
cannam@479
|
266
|
cannam@479
|
267 // initially choose p_j (arbitrary) - saves on an else statement
|
cannam@479
|
268 int beatPeriod = p_j;
|
cannam@479
|
269 if (m_tempoScratch[p_i] > m_tempoScratch[p_j]) {
|
cannam@479
|
270 beatPeriod = p_i;
|
cannam@479
|
271 }
|
cannam@479
|
272
|
cannam@479
|
273 // now write the output
|
cannam@479
|
274 maxIndexRCF = static_cast<int>(beatPeriod);
|
cannam@479
|
275 }
|
c@410
|
276
|
c@410
|
277
|
c@410
|
278 double locked = 5168.f / maxIndexRCF;
|
c@410
|
279 if (locked >= 30 && locked <= 180) {
|
c@410
|
280 m_lockedTempo = locked;
|
c@410
|
281 }
|
c@410
|
282
|
c@410
|
283 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
284 std::cerr << "tempoMM: locked tempo = " << m_lockedTempo << std::endl;
|
c@410
|
285 #endif
|
c@410
|
286
|
cannam@479
|
287 if( tsig == 0 ) {
|
cannam@479
|
288 tsig = 4;
|
cannam@479
|
289 }
|
c@410
|
290
|
c@410
|
291 #ifdef DEBUG_TEMPO_TRACK
|
cannam@479
|
292 std::cerr << "tempoMM: maxIndexRCF = " << maxIndexRCF << std::endl;
|
c@410
|
293 #endif
|
cannam@479
|
294
|
cannam@479
|
295 if( tsig == 4 ) {
|
cannam@479
|
296
|
c@410
|
297 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
298 std::cerr << "tsig == 4" << std::endl;
|
c@410
|
299 #endif
|
c@410
|
300
|
cannam@479
|
301 pdPeaks = new double[ 4 ];
|
cannam@479
|
302 for( i = 0; i < 4; i++ ){ pdPeaks[ i ] = 0.0;}
|
c@410
|
303
|
cannam@479
|
304 pdPeaks[ 0 ] = ( double )maxIndexRCF + 1;
|
c@410
|
305
|
cannam@479
|
306 maxIndexTemp = 0;
|
cannam@479
|
307 maxValTemp = 0.0;
|
cannam@479
|
308 count = 0;
|
c@410
|
309
|
cannam@479
|
310 for( i = (2 * maxIndexRCF + 1) - 1; i < (2 * maxIndexRCF + 1) + 2; i++ ) {
|
cannam@479
|
311 if( ACF[ i ] > maxValTemp ) {
|
cannam@479
|
312 maxValTemp = ACF[ i ];
|
cannam@479
|
313 maxIndexTemp = count;
|
cannam@479
|
314 }
|
cannam@479
|
315 count++;
|
cannam@479
|
316 }
|
cannam@479
|
317 pdPeaks[ 1 ] = (double)( maxIndexTemp + 1 + ( (2 * maxIndexRCF + 1 ) - 2 ) + 1 )/2;
|
c@410
|
318
|
cannam@479
|
319 maxIndexTemp = 0;
|
cannam@479
|
320 maxValTemp = 0.0;
|
cannam@479
|
321 count = 0;
|
c@410
|
322
|
cannam@479
|
323 for( i = (3 * maxIndexRCF + 2 ) - 2; i < (3 * maxIndexRCF + 2 ) + 3; i++ ) {
|
cannam@479
|
324 if( ACF[ i ] > maxValTemp ) {
|
cannam@479
|
325 maxValTemp = ACF[ i ];
|
cannam@479
|
326 maxIndexTemp = count;
|
cannam@479
|
327 }
|
cannam@479
|
328 count++;
|
cannam@479
|
329 }
|
cannam@479
|
330 pdPeaks[ 2 ] = (double)( maxIndexTemp + 1 + ( (3 * maxIndexRCF + 2) - 4 ) + 1 )/3;
|
c@410
|
331
|
cannam@479
|
332 maxIndexTemp = 0;
|
cannam@479
|
333 maxValTemp = 0.0;
|
cannam@479
|
334 count = 0;
|
c@410
|
335
|
cannam@479
|
336 for( i = ( 4 * maxIndexRCF + 3) - 3; i < ( 4 * maxIndexRCF + 3) + 4; i++ ) {
|
cannam@479
|
337 if( ACF[ i ] > maxValTemp ) {
|
cannam@479
|
338 maxValTemp = ACF[ i ];
|
cannam@479
|
339 maxIndexTemp = count;
|
cannam@479
|
340 }
|
cannam@479
|
341 count++;
|
cannam@479
|
342 }
|
c@410
|
343
|
cannam@479
|
344 pdPeaks[ 3 ] = (double)( maxIndexTemp + 1 + ( (4 * maxIndexRCF + 3) - 9 ) + 1 )/4 ;
|
c@410
|
345
|
cannam@479
|
346
|
cannam@479
|
347 period = MathUtilities::mean( pdPeaks, 4 );
|
cannam@479
|
348
|
cannam@479
|
349 } else {
|
cannam@479
|
350
|
c@410
|
351 #ifdef DEBUG_TEMPO_TRACK
|
cannam@479
|
352 std::cerr << "tsig != 4" << std::endl;
|
c@410
|
353 #endif
|
c@410
|
354
|
cannam@479
|
355 pdPeaks = new double[ 3 ];
|
cannam@479
|
356 for( i = 0; i < 3; i++ ) {
|
cannam@479
|
357 pdPeaks[ i ] = 0.0;
|
cannam@479
|
358 }
|
c@410
|
359
|
cannam@479
|
360 pdPeaks[ 0 ] = ( double )maxIndexRCF + 1;
|
c@410
|
361
|
cannam@479
|
362 maxIndexTemp = 0;
|
cannam@479
|
363 maxValTemp = 0.0;
|
cannam@479
|
364 count = 0;
|
c@410
|
365
|
cannam@479
|
366 for( i = (2 * maxIndexRCF + 1) - 1; i < (2 * maxIndexRCF + 1) + 2; i++ ) {
|
cannam@479
|
367 if( ACF[ i ] > maxValTemp ) {
|
cannam@479
|
368 maxValTemp = ACF[ i ];
|
cannam@479
|
369 maxIndexTemp = count;
|
cannam@479
|
370 }
|
cannam@479
|
371 count++;
|
cannam@479
|
372 }
|
cannam@479
|
373 pdPeaks[ 1 ] = (double)( maxIndexTemp + 1 + ( (2 * maxIndexRCF + 1 ) - 2 ) + 1 )/2;
|
c@410
|
374
|
cannam@479
|
375 maxIndexTemp = 0;
|
cannam@479
|
376 maxValTemp = 0.0;
|
cannam@479
|
377 count = 0;
|
c@410
|
378
|
cannam@479
|
379 for( i = (3 * maxIndexRCF + 2 ) - 2; i < (3 * maxIndexRCF + 2 ) + 3; i++ ) {
|
cannam@479
|
380 if( ACF[ i ] > maxValTemp ) {
|
cannam@479
|
381 maxValTemp = ACF[ i ];
|
cannam@479
|
382 maxIndexTemp = count;
|
cannam@479
|
383 }
|
cannam@479
|
384 count++;
|
cannam@479
|
385 }
|
cannam@479
|
386 pdPeaks[ 2 ] = (double)( maxIndexTemp + 1 + ( (3 * maxIndexRCF + 2) - 4 ) + 1 )/3;
|
c@410
|
387
|
c@410
|
388
|
cannam@479
|
389 period = MathUtilities::mean( pdPeaks, 3 );
|
c@410
|
390 }
|
c@410
|
391
|
c@410
|
392 delete [] pdPeaks;
|
c@410
|
393
|
c@410
|
394 return period;
|
c@410
|
395 }
|
c@410
|
396
|
c@410
|
397 void TempoTrack::stepDetect( double* periodP, double* periodG, int currentIdx, int* flag )
|
c@410
|
398 {
|
c@410
|
399 double stepthresh = 1 * 3.9017;
|
c@410
|
400
|
cannam@479
|
401 if( *flag ) {
|
cannam@479
|
402 if(abs(periodG[ currentIdx ] - periodP[ currentIdx ]) > stepthresh) {
|
cannam@479
|
403 // do nuffin'
|
cannam@479
|
404 }
|
cannam@479
|
405 } else {
|
cannam@479
|
406 if(fabs(periodG[ currentIdx ]-periodP[ currentIdx ]) > stepthresh) {
|
cannam@479
|
407 *flag = 3;
|
cannam@479
|
408 }
|
c@410
|
409 }
|
c@410
|
410 }
|
c@410
|
411
|
c@410
|
412 void TempoTrack::constDetect( double* periodP, int currentIdx, int* flag )
|
c@410
|
413 {
|
c@410
|
414 double constthresh = 2 * 3.9017;
|
c@410
|
415
|
cannam@479
|
416 if( fabs( 2 * periodP[ currentIdx ] - periodP[ currentIdx - 1] - periodP[ currentIdx - 2] ) < constthresh) {
|
cannam@479
|
417 *flag = 1;
|
cannam@479
|
418 } else {
|
cannam@479
|
419 *flag = 0;
|
c@410
|
420 }
|
c@410
|
421 }
|
c@410
|
422
|
c@414
|
423 int TempoTrack::findMeter(double *ACF, int len, double period)
|
c@410
|
424 {
|
c@410
|
425 int i;
|
c@410
|
426 int p = (int)MathUtilities::round( period );
|
c@410
|
427 int tsig;
|
c@410
|
428
|
c@410
|
429 double Energy_3 = 0.0;
|
c@410
|
430 double Energy_4 = 0.0;
|
c@410
|
431
|
c@410
|
432 double temp3A = 0.0;
|
c@410
|
433 double temp3B = 0.0;
|
c@410
|
434 double temp4A = 0.0;
|
c@410
|
435 double temp4B = 0.0;
|
c@410
|
436
|
c@410
|
437 double* dbf = new double[ len ]; int t = 0;
|
c@414
|
438 for( int u = 0; u < len; u++ ){ dbf[ u ] = 0.0; }
|
c@410
|
439
|
cannam@479
|
440 if( (double)len < 6 * p + 2 ) {
|
cannam@479
|
441
|
cannam@479
|
442 for( i = ( 3 * p - 2 ); i < ( 3 * p + 2 ) + 1; i++ ) {
|
cannam@479
|
443 temp3A += ACF[ i ];
|
cannam@479
|
444 dbf[ t++ ] = ACF[ i ];
|
cannam@479
|
445 }
|
cannam@479
|
446
|
cannam@479
|
447 for( i = ( 4 * p - 2 ); i < ( 4 * p + 2 ) + 1; i++ ) {
|
cannam@479
|
448 temp4A += ACF[ i ];
|
cannam@479
|
449 }
|
c@410
|
450
|
cannam@479
|
451 Energy_3 = temp3A;
|
cannam@479
|
452 Energy_4 = temp4A;
|
c@410
|
453
|
cannam@479
|
454 } else {
|
cannam@479
|
455
|
cannam@479
|
456 for( i = ( 3 * p - 2 ); i < ( 3 * p + 2 ) + 1; i++ ) {
|
cannam@479
|
457 temp3A += ACF[ i ];
|
cannam@479
|
458 }
|
cannam@479
|
459
|
cannam@479
|
460 for( i = ( 4 * p - 2 ); i < ( 4 * p + 2 ) + 1; i++ ) {
|
cannam@479
|
461 temp4A += ACF[ i ];
|
cannam@479
|
462 }
|
c@410
|
463
|
cannam@479
|
464 for( i = ( 6 * p - 2 ); i < ( 6 * p + 2 ) + 1; i++ ) {
|
cannam@479
|
465 temp3B += ACF[ i ];
|
cannam@479
|
466 }
|
cannam@479
|
467
|
cannam@479
|
468 for( i = ( 2 * p - 2 ); i < ( 2 * p + 2 ) + 1; i++ ) {
|
cannam@479
|
469 temp4B += ACF[ i ];
|
cannam@479
|
470 }
|
cannam@479
|
471
|
cannam@479
|
472 Energy_3 = temp3A + temp3B;
|
cannam@479
|
473 Energy_4 = temp4A + temp4B;
|
c@410
|
474 }
|
c@410
|
475
|
cannam@479
|
476 if (Energy_3 > Energy_4) {
|
cannam@479
|
477 tsig = 3;
|
cannam@479
|
478 } else {
|
cannam@479
|
479 tsig = 4;
|
c@410
|
480 }
|
c@410
|
481
|
c@410
|
482 return tsig;
|
c@410
|
483 }
|
c@410
|
484
|
c@414
|
485 void TempoTrack::createPhaseExtractor(double *Filter, int /* winLength */, double period, int fsp, int lastBeat)
|
cannam@479
|
486 {
|
c@410
|
487 int p = (int)MathUtilities::round( period );
|
c@410
|
488 int predictedOffset = 0;
|
c@410
|
489
|
c@410
|
490 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
491 std::cerr << "TempoTrack::createPhaseExtractor: period = " << period << ", p = " << p << std::endl;
|
c@410
|
492 #endif
|
c@410
|
493
|
c@410
|
494 if (p > 10000) {
|
c@410
|
495 std::cerr << "TempoTrack::createPhaseExtractor: WARNING! Highly implausible period value " << p << "!" << std::endl;
|
c@410
|
496 period = 5168 / 120;
|
c@410
|
497 }
|
c@410
|
498
|
c@410
|
499 double* phaseScratch = new double[ p*2 + 2 ];
|
c@410
|
500 for (int i = 0; i < p*2 + 2; ++i) phaseScratch[i] = 0.0;
|
c@410
|
501
|
cannam@479
|
502
|
cannam@479
|
503 if ( lastBeat != 0 ) {
|
cannam@479
|
504
|
cannam@479
|
505 lastBeat = (int)MathUtilities::round((double)lastBeat );///(double)winLength);
|
c@410
|
506
|
c@410
|
507 predictedOffset = lastBeat + p - fsp;
|
c@410
|
508
|
cannam@479
|
509 if (predictedOffset < 0) {
|
c@410
|
510 lastBeat = 0;
|
c@410
|
511 }
|
c@410
|
512 }
|
c@410
|
513
|
cannam@479
|
514 if ( lastBeat != 0 ) {
|
cannam@479
|
515
|
cannam@479
|
516 int mu = p;
|
cannam@479
|
517 double sigma = (double)p/8;
|
cannam@479
|
518 double PhaseMin = 0.0;
|
cannam@479
|
519 double PhaseMax = 0.0;
|
cannam@479
|
520 int scratchLength = p*2;
|
cannam@479
|
521 double temp = 0.0;
|
c@410
|
522
|
cannam@479
|
523 for( int i = 0; i < scratchLength; i++ ) {
|
cannam@487
|
524 phaseScratch[ i ] = exp( -0.5 * pow( ( i - mu ) / sigma, 2 ) ) / ( sqrt(TWO_PI) *sigma );
|
cannam@479
|
525 }
|
c@410
|
526
|
cannam@479
|
527 MathUtilities::getFrameMinMax( phaseScratch, scratchLength, &PhaseMin, &PhaseMax );
|
cannam@479
|
528
|
cannam@479
|
529 for(int i = 0; i < scratchLength; i ++) {
|
cannam@479
|
530 temp = phaseScratch[ i ];
|
cannam@479
|
531 phaseScratch[ i ] = (temp - PhaseMin)/PhaseMax;
|
cannam@479
|
532 }
|
c@410
|
533
|
c@410
|
534 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
535 std::cerr << "predictedOffset = " << predictedOffset << std::endl;
|
c@410
|
536 #endif
|
c@410
|
537
|
cannam@479
|
538 int index = 0;
|
cannam@479
|
539 for (int i = p - ( predictedOffset - 1); i < p + ( p - predictedOffset) + 1; i++) {
|
c@410
|
540 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
541 std::cerr << "assigning to filter index " << index << " (size = " << p*2 << ")" << " value " << phaseScratch[i] << " from scratch index " << i << std::endl;
|
c@410
|
542 #endif
|
cannam@479
|
543 Filter[ index++ ] = phaseScratch[ i ];
|
cannam@479
|
544 }
|
cannam@479
|
545 } else {
|
cannam@479
|
546 for( int i = 0; i < p; i ++) {
|
cannam@479
|
547 Filter[ i ] = 1;
|
cannam@479
|
548 }
|
c@410
|
549 }
|
cannam@479
|
550
|
c@410
|
551 delete [] phaseScratch;
|
c@410
|
552 }
|
c@410
|
553
|
c@414
|
554 int TempoTrack::phaseMM(double *DF, double *weighting, int winLength, double period)
|
c@410
|
555 {
|
c@410
|
556 int alignment = 0;
|
c@410
|
557 int p = (int)MathUtilities::round( period );
|
c@410
|
558
|
c@410
|
559 double temp = 0.0;
|
c@410
|
560
|
c@410
|
561 double* y = new double[ winLength ];
|
c@410
|
562 double* align = new double[ p ];
|
c@410
|
563
|
cannam@479
|
564 for( int i = 0; i < winLength; i++ ) {
|
cannam@479
|
565 y[ i ] = (double)( -i + winLength )/(double)winLength;
|
cannam@479
|
566 y[ i ] = pow(y [i ],2.0); // raise to power 2.
|
c@410
|
567 }
|
c@410
|
568
|
cannam@479
|
569 for( int o = 0; o < p; o++ ) {
|
cannam@479
|
570 temp = 0.0;
|
cannam@479
|
571 for (int i = 1 + (o - 1); i < winLength; i += (p + 1)) {
|
cannam@479
|
572 temp = temp + DF[ i ] * y[ i ];
|
cannam@479
|
573 }
|
cannam@479
|
574 align[ o ] = temp * weighting[ o ];
|
c@410
|
575 }
|
c@410
|
576
|
c@410
|
577
|
c@410
|
578 double valTemp = 0.0;
|
cannam@479
|
579 for(int i = 0; i < p; i++) {
|
cannam@479
|
580 if( align[ i ] > valTemp ) {
|
cannam@479
|
581 valTemp = align[ i ];
|
cannam@479
|
582 alignment = i;
|
cannam@479
|
583 }
|
c@410
|
584 }
|
c@410
|
585
|
c@410
|
586 delete [] y;
|
c@410
|
587 delete [] align;
|
c@410
|
588
|
c@410
|
589 return alignment;
|
c@410
|
590 }
|
c@410
|
591
|
c@414
|
592 int TempoTrack::beatPredict(int FSP0, double alignment, double period, int step )
|
c@410
|
593 {
|
c@410
|
594 int beat = 0;
|
c@410
|
595
|
c@410
|
596 int p = (int)MathUtilities::round( period );
|
c@410
|
597 int align = (int)MathUtilities::round( alignment );
|
c@410
|
598 int FSP = (int)MathUtilities::round( FSP0 );
|
c@410
|
599
|
c@410
|
600 int FEP = FSP + ( step );
|
c@410
|
601
|
c@410
|
602 beat = FSP + align;
|
c@410
|
603
|
c@410
|
604 m_beats.push_back( beat );
|
c@410
|
605
|
cannam@479
|
606 while( beat + p < FEP ) {
|
cannam@479
|
607 beat += p;
|
cannam@479
|
608 m_beats.push_back( beat );
|
c@410
|
609 }
|
c@410
|
610
|
c@410
|
611 return beat;
|
c@410
|
612 }
|
c@410
|
613
|
c@410
|
614
|
c@410
|
615
|
c@410
|
616 vector<int> TempoTrack::process( vector <double> DF,
|
c@410
|
617 vector <double> *tempoReturn )
|
c@410
|
618 {
|
c@410
|
619 m_dataLength = DF.size();
|
cannam@479
|
620
|
c@410
|
621 m_lockedTempo = 0.0;
|
c@410
|
622
|
cannam@479
|
623 double period = 0.0;
|
c@410
|
624 int stepFlag = 0;
|
c@410
|
625 int constFlag = 0;
|
c@410
|
626 int FSP = 0;
|
c@410
|
627 int tsig = 0;
|
c@410
|
628 int lastBeat = 0;
|
c@410
|
629
|
c@410
|
630 vector <double> causalDF;
|
c@410
|
631
|
c@410
|
632 causalDF = DF;
|
c@410
|
633
|
c@410
|
634 //Prepare Causal Extension DFData
|
c@414
|
635 // int DFCLength = m_dataLength + m_winLength;
|
cannam@479
|
636
|
cannam@479
|
637 for( int j = 0; j < m_winLength; j++ ) {
|
cannam@479
|
638 causalDF.push_back( 0 );
|
c@410
|
639 }
|
cannam@479
|
640
|
cannam@479
|
641
|
c@410
|
642 double* RW = new double[ m_lagLength ];
|
c@414
|
643 for (int clear = 0; clear < m_lagLength; clear++){ RW[ clear ] = 0.0;}
|
c@410
|
644
|
c@410
|
645 double* GW = new double[ m_lagLength ];
|
c@414
|
646 for (int clear = 0; clear < m_lagLength; clear++){ GW[ clear ] = 0.0;}
|
c@410
|
647
|
c@410
|
648 double* PW = new double[ m_lagLength ];
|
c@414
|
649 for(int clear = 0; clear < m_lagLength; clear++){ PW[ clear ] = 0.0;}
|
c@410
|
650
|
c@410
|
651 m_DFFramer.setSource( &causalDF[0], m_dataLength );
|
c@410
|
652
|
c@414
|
653 int TTFrames = m_DFFramer.getMaxNoFrames();
|
c@410
|
654
|
c@410
|
655 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
656 std::cerr << "TTFrames = " << TTFrames << std::endl;
|
c@410
|
657 #endif
|
cannam@479
|
658
|
c@410
|
659 double* periodP = new double[ TTFrames ];
|
c@414
|
660 for(int clear = 0; clear < TTFrames; clear++){ periodP[ clear ] = 0.0;}
|
cannam@479
|
661
|
c@410
|
662 double* periodG = new double[ TTFrames ];
|
c@414
|
663 for(int clear = 0; clear < TTFrames; clear++){ periodG[ clear ] = 0.0;}
|
cannam@479
|
664
|
c@410
|
665 double* alignment = new double[ TTFrames ];
|
c@414
|
666 for(int clear = 0; clear < TTFrames; clear++){ alignment[ clear ] = 0.0;}
|
c@410
|
667
|
c@410
|
668 m_beats.clear();
|
c@410
|
669
|
c@410
|
670 createCombFilter( RW, m_lagLength, 0, 0 );
|
c@410
|
671
|
c@410
|
672 int TTLoopIndex = 0;
|
c@410
|
673
|
cannam@479
|
674 for( int i = 0; i < TTFrames; i++ ) {
|
cannam@479
|
675
|
cannam@479
|
676 m_DFFramer.getFrame( m_rawDFFrame );
|
c@410
|
677
|
cannam@479
|
678 m_DFConditioning->process( m_rawDFFrame, m_smoothDFFrame );
|
c@410
|
679
|
cannam@479
|
680 m_correlator.doAutoUnBiased( m_smoothDFFrame, m_frameACF, m_winLength );
|
cannam@479
|
681
|
cannam@479
|
682 periodP[ TTLoopIndex ] = tempoMM( m_frameACF, RW, 0 );
|
c@410
|
683
|
cannam@479
|
684 if( GW[ 0 ] != 0 ) {
|
cannam@479
|
685 periodG[ TTLoopIndex ] = tempoMM( m_frameACF, GW, tsig );
|
cannam@479
|
686 } else {
|
cannam@479
|
687 periodG[ TTLoopIndex ] = 0.0;
|
cannam@479
|
688 }
|
c@410
|
689
|
cannam@479
|
690 stepDetect( periodP, periodG, TTLoopIndex, &stepFlag );
|
c@410
|
691
|
cannam@479
|
692 if( stepFlag == 1) {
|
cannam@479
|
693 constDetect( periodP, TTLoopIndex, &constFlag );
|
cannam@479
|
694 stepFlag = 0;
|
cannam@479
|
695 } else {
|
cannam@479
|
696 stepFlag -= 1;
|
cannam@479
|
697 }
|
c@410
|
698
|
cannam@479
|
699 if( stepFlag < 0 ) {
|
cannam@479
|
700 stepFlag = 0;
|
cannam@479
|
701 }
|
c@410
|
702
|
cannam@479
|
703 if( constFlag != 0) {
|
cannam@479
|
704
|
cannam@479
|
705 tsig = findMeter( m_frameACF, m_winLength, periodP[ TTLoopIndex ] );
|
cannam@479
|
706
|
cannam@479
|
707 createCombFilter( GW, m_lagLength, tsig, periodP[ TTLoopIndex ] );
|
cannam@479
|
708
|
cannam@479
|
709 periodG[ TTLoopIndex ] = tempoMM( m_frameACF, GW, tsig );
|
c@410
|
710
|
cannam@479
|
711 period = periodG[ TTLoopIndex ];
|
c@410
|
712
|
c@410
|
713 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
714 std::cerr << "TempoTrack::process: constFlag == " << constFlag << ", TTLoopIndex = " << TTLoopIndex << ", period from periodG = " << period << std::endl;
|
c@410
|
715 #endif
|
c@410
|
716
|
cannam@479
|
717 createPhaseExtractor( PW, m_winLength, period, FSP, 0 );
|
c@410
|
718
|
cannam@479
|
719 constFlag = 0;
|
c@410
|
720
|
cannam@479
|
721 } else {
|
cannam@479
|
722
|
cannam@479
|
723 if( GW[ 0 ] != 0 ) {
|
cannam@479
|
724 period = periodG[ TTLoopIndex ];
|
c@410
|
725
|
c@410
|
726 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
727 std::cerr << "TempoTrack::process: GW[0] == " << GW[0] << ", TTLoopIndex = " << TTLoopIndex << ", period from periodG = " << period << std::endl;
|
c@410
|
728 #endif
|
c@410
|
729
|
c@410
|
730 if (period > 10000) {
|
c@410
|
731 std::cerr << "TempoTrack::process: WARNING! Highly implausible period value " << period << "!" << std::endl;
|
c@410
|
732 std::cerr << "periodG contains (of " << TTFrames << " frames): " << std::endl;
|
c@410
|
733 for (int i = 0; i < TTLoopIndex + 3 && i < TTFrames; ++i) {
|
c@410
|
734 std::cerr << i << " -> " << periodG[i] << std::endl;
|
c@410
|
735 }
|
c@410
|
736 std::cerr << "periodP contains (of " << TTFrames << " frames): " << std::endl;
|
c@410
|
737 for (int i = 0; i < TTLoopIndex + 3 && i < TTFrames; ++i) {
|
c@410
|
738 std::cerr << i << " -> " << periodP[i] << std::endl;
|
c@410
|
739 }
|
c@410
|
740 period = 5168 / 120;
|
c@410
|
741 }
|
c@410
|
742
|
cannam@479
|
743 createPhaseExtractor( PW, m_winLength, period, FSP, lastBeat );
|
c@410
|
744
|
cannam@479
|
745 }
|
cannam@479
|
746 else
|
cannam@479
|
747 {
|
cannam@479
|
748 period = periodP[ TTLoopIndex ];
|
c@410
|
749
|
c@410
|
750 #ifdef DEBUG_TEMPO_TRACK
|
c@410
|
751 std::cerr << "TempoTrack::process: GW[0] == " << GW[0] << ", TTLoopIndex = " << TTLoopIndex << ", period from periodP = " << period << std::endl;
|
c@410
|
752 #endif
|
c@410
|
753
|
cannam@479
|
754 createPhaseExtractor( PW, m_winLength, period, FSP, 0 );
|
cannam@479
|
755 }
|
cannam@479
|
756 }
|
c@410
|
757
|
cannam@479
|
758 alignment[ TTLoopIndex ] = phaseMM( m_rawDFFrame, PW, m_winLength, period );
|
c@410
|
759
|
cannam@479
|
760 lastBeat = beatPredict(FSP, alignment[ TTLoopIndex ], period, m_lagLength );
|
c@410
|
761
|
cannam@479
|
762 FSP += (m_lagLength);
|
c@410
|
763
|
c@410
|
764 if (tempoReturn) tempoReturn->push_back(m_lockedTempo);
|
c@410
|
765
|
cannam@479
|
766 TTLoopIndex++;
|
c@410
|
767 }
|
c@410
|
768
|
c@410
|
769
|
c@410
|
770 delete [] periodP;
|
c@410
|
771 delete [] periodG;
|
c@410
|
772 delete [] alignment;
|
c@410
|
773
|
c@410
|
774 delete [] RW;
|
c@410
|
775 delete [] GW;
|
c@410
|
776 delete [] PW;
|
c@410
|
777
|
c@410
|
778 return m_beats;
|
c@410
|
779 }
|
c@410
|
780
|