andrew@33
|
1 /*
|
andrew@33
|
2 * midiEventHolder.cpp
|
andrew@33
|
3 * midiCannamReader3
|
andrew@33
|
4 *
|
andrew@33
|
5 * Created by Andrew on 19/07/2011.
|
andrew@33
|
6 * Copyright 2011 QMUL. All rights reserved.
|
andrew@33
|
7 *
|
andrew@33
|
8 */
|
andrew@33
|
9
|
andrew@33
|
10
|
andrew@33
|
11 //Main file to look at here is newNoteEvent() - this calls everything else to update the Bayesian array
|
andrew@33
|
12
|
andrew@33
|
13 #include "midiEventHolder.h"
|
andrew@36
|
14
|
andrew@37
|
15 #include <iostream>
|
andrew@37
|
16 #include <fstream>
|
andrew@42
|
17 #include <assert.h>
|
andrew@33
|
18
|
andrew@33
|
19 midiEventHolder::midiEventHolder(){
|
andrew@36
|
20
|
andrew@38
|
21
|
andrew@36
|
22
|
andrew@33
|
23 // recordedNoteOnIndex = 0;
|
andrew@34
|
24 alignmentPosition = 0;
|
andrew@33
|
25
|
andrew@33
|
26 useTempoPrior = false;//puts sine wave round tempo
|
andrew@33
|
27 confidenceWeightingUsed = true;
|
andrew@33
|
28 newOptimalMethod = true;
|
andrew@33
|
29
|
andrew@34
|
30 matchWindowWidth = 16000;//window size for matching in ms
|
andrew@33
|
31 interNoteRange = 1600;//preferred duration
|
andrew@33
|
32 //so max here is really four
|
andrew@33
|
33
|
andrew@33
|
34
|
andrew@33
|
35 likelihoodWidth = 100;//using 100 is good
|
andrew@33
|
36 likelihoodToNoiseRatio = 0.20;//was 0.02 on 18/11/11, changing to give more weight to observations
|
andrew@33
|
37 //was 0.08 on 11/12/11 but need more for tempo varn in rwc database
|
andrew@33
|
38
|
andrew@33
|
39 bayesStruct.speedLikelihoodNoise = 0.1;//was 0.05
|
andrew@33
|
40 bayesStruct.speedDecayWidth = 40;
|
andrew@33
|
41 bayesStruct.speedDecayAmount = 10;
|
andrew@33
|
42
|
andrew@40
|
43 drawTempoMode = false;
|
andrew@33
|
44 //there is option to use MAP estinate or integral in beayesianarraystricture class
|
andrew@33
|
45
|
andrew@33
|
46 runningInRealTime = true;
|
andrew@33
|
47 bayesStruct.realTimeMode = &runningInRealTime;
|
andrew@33
|
48
|
andrew@33
|
49 minimumMatchSpeed = 0.0;
|
andrew@33
|
50 maximumMatchSpeed = 2.0;
|
andrew@33
|
51 minimumTimeIntervalForTempoUpdate = 150;
|
andrew@33
|
52
|
andrew@33
|
53 width = ofGetWidth();
|
andrew@33
|
54 height = ofGetHeight();
|
andrew@33
|
55 screenWidth= &width;
|
andrew@33
|
56 screenHeight = &height;
|
andrew@33
|
57
|
andrew@33
|
58 ticksPerScreen = 4000;
|
andrew@33
|
59 tickLocation = 0;
|
andrew@33
|
60 pulsesPerQuarternote = 240;
|
andrew@33
|
61 noteArrayIndex = 0;
|
andrew@33
|
62 noteMinimum = 30;
|
andrew@33
|
63 noteMaximum = 96;
|
andrew@33
|
64
|
andrew@33
|
65
|
andrew@33
|
66
|
andrew@33
|
67
|
andrew@33
|
68
|
andrew@33
|
69 speedPriorValue = 1.0;
|
andrew@33
|
70
|
andrew@33
|
71
|
andrew@33
|
72 bayesStruct.resetSize(matchWindowWidth);
|
andrew@33
|
73 bayesStruct.setPositionDistributionScalar(1);
|
andrew@33
|
74
|
andrew@33
|
75 bayesStruct.resetSpeedSize(200);
|
andrew@33
|
76 bayesStruct.setRelativeSpeedScalar(0.01);
|
andrew@33
|
77 bayesStruct.relativeSpeedPrior.getMaximum();
|
andrew@33
|
78 //bayesStruct.simpleExample();
|
andrew@33
|
79
|
andrew@33
|
80
|
andrew@33
|
81 speedWindowWidthMillis = 1600;//4000
|
andrew@34
|
82
|
andrew@33
|
83 noteHeight = (*screenHeight) / (float)(noteMaximum - noteMinimum);
|
andrew@33
|
84
|
andrew@33
|
85
|
andrew@33
|
86 intervalsToCheck.push_back(1);
|
andrew@33
|
87 intervalsToCheck.push_back(2);
|
andrew@33
|
88 //intervalsToCheck.push_back(3);
|
andrew@33
|
89 intervalsToCheck.push_back(4);
|
andrew@33
|
90 intervalsToCheck.push_back(6);
|
andrew@33
|
91 intervalsToCheck.push_back(8);
|
andrew@33
|
92 intervalsToCheck.push_back(16);
|
andrew@33
|
93
|
andrew@33
|
94
|
andrew@33
|
95 drawPhaseMode = true;
|
andrew@33
|
96
|
andrew@33
|
97 printf("lookup index %f value %f\n", bayesStruct.prior.getLookupIndex(100, 30., 10.0), bayesStruct.prior.gaussianLookupTable[(int)bayesStruct.prior.getLookupIndex(100, 30., 10.0)]);
|
andrew@33
|
98 }
|
andrew@33
|
99
|
andrew@33
|
100
|
andrew@33
|
101
|
andrew@33
|
102 void midiEventHolder::reset(){
|
andrew@33
|
103 //called when we start playing
|
andrew@33
|
104
|
andrew@33
|
105 noteArrayIndex = 0;
|
andrew@33
|
106 tickLocation = 0;
|
andrew@34
|
107 startPlayingTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@33
|
108 bayesStruct.lastEventTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@33
|
109 numberOfScreensIn = 0;
|
andrew@33
|
110 // recordedNoteOnIndex = 0;
|
andrew@33
|
111 bayesStruct.setNewDistributionOffsets(0);
|
andrew@33
|
112 bayesStruct.posterior.offset = 0;
|
andrew@33
|
113
|
andrew@33
|
114 playedEventTimes.clear();
|
andrew@33
|
115 playedNoteOnMatrix.clear();
|
andrew@33
|
116 matchMatrix.clear();
|
andrew@33
|
117 bestMatchIndex = 0;
|
andrew@33
|
118
|
andrew@33
|
119 recordedTotalNoteCounterByPitch.clear();
|
andrew@33
|
120 recordedTotalNoteCounterByPitch.assign(127,0);
|
andrew@33
|
121 totalNoteCounterIndex = 0;
|
andrew@34
|
122
|
andrew@33
|
123 interNoteIntervals.clear();
|
andrew@33
|
124
|
andrew@35
|
125 smoothIndex = 0;
|
andrew@34
|
126 smoothPlayPosition = 0.0;
|
andrew@34
|
127 // relativeSpeedForSmooth = 1.0;
|
andrew@34
|
128 // storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@34
|
129 // lastSmoothUpdateTime = getTimeNow(0);
|
andrew@34
|
130
|
andrew@34
|
131 printf("reset speed prior is %f\n", speedPriorValue);
|
andrew@33
|
132 bayesStruct.resetSpeedToOne();
|
andrew@33
|
133 bayesStruct.setSpeedPrior(speedPriorValue);
|
andrew@33
|
134 setMatchedNotesBackToFalse();
|
andrew@34
|
135
|
andrew@34
|
136 periodCounter = 0;
|
andrew@34
|
137 for (int i = 0;i < periodValues.size();i++){
|
andrew@34
|
138 // printf("period at %f is %f\n", periodValues[i][2], periodValues[i][1]);
|
andrew@34
|
139 }
|
andrew@34
|
140 /* if (periodValues.size() > 0){
|
andrew@34
|
141 updatePeriodValue(0);// periodValues[0][2];
|
andrew@34
|
142 printf("Resetting period to %f , size is %i\n", period, (int)periodValues.size());
|
andrew@34
|
143 }
|
andrew@34
|
144 */
|
andrew@34
|
145 //period = 500.0;
|
andrew@33
|
146 }
|
andrew@33
|
147
|
andrew@33
|
148 void midiEventHolder::setMatchedNotesBackToFalse(){
|
andrew@33
|
149 for (int i = 0;i < noteOnMatches.size();i++)
|
andrew@33
|
150 noteOnMatches[i] = false;
|
andrew@33
|
151 }
|
andrew@33
|
152
|
andrew@33
|
153 void midiEventHolder::clearAllEvents(){
|
andrew@33
|
154 recordedNoteOnMatrix.clear();
|
andrew@33
|
155 matchesFound.clear();
|
andrew@33
|
156 noteOnMatches.clear();
|
andrew@33
|
157 recordedEventTimes.clear();
|
andrew@33
|
158 measureVector.clear();
|
andrew@33
|
159 //played events:
|
andrew@33
|
160 playedEventTimes.clear();
|
andrew@33
|
161 playedNoteOnMatrix.clear();
|
andrew@33
|
162 matchMatrix.clear();
|
andrew@33
|
163 bestMatchFound.clear();
|
andrew@33
|
164 periodValues.clear();
|
andrew@33
|
165
|
andrew@35
|
166 beatPositions.clear();
|
andrew@35
|
167
|
andrew@33
|
168 recordedTotalNoteCounterByPitch.clear();
|
andrew@33
|
169 recordedTotalNoteCounterByPitch.assign(127, 0);
|
andrew@33
|
170 totalNoteCounterIndex = 0;
|
andrew@33
|
171 }
|
andrew@33
|
172
|
andrew@33
|
173 void midiEventHolder::printNotes(){
|
andrew@33
|
174 printf("RECORDED MATRIX\n");
|
andrew@33
|
175 for (int i = 0;i < recordedNoteOnMatrix.size();i++){
|
andrew@33
|
176 printf("ticktime %i :: pitch %i @ millis %f\n", recordedNoteOnMatrix[i][0], recordedNoteOnMatrix[i][1], recordedEventTimes[i]);
|
andrew@33
|
177 }
|
andrew@33
|
178 }
|
andrew@33
|
179
|
andrew@33
|
180
|
andrew@33
|
181 double midiEventHolder::getEventTimeTicks(double millis){
|
andrew@34
|
182 return 0.0;
|
andrew@34
|
183 //return (millis * pulsesPerQuarternote / period);
|
andrew@33
|
184 }
|
andrew@33
|
185
|
andrew@33
|
186 double midiEventHolder::getEventTimeMillis(double ticks){
|
andrew@33
|
187 return (period * ticks / (double) pulsesPerQuarternote);
|
andrew@33
|
188 }
|
andrew@33
|
189
|
andrew@33
|
190 void midiEventHolder::newNoteOnEvent(int pitch, int velocity, double timePlayed){
|
andrew@33
|
191 // tempoSpeedString = "";
|
andrew@33
|
192
|
andrew@33
|
193 //MOVE INTO BAYESSTRUCT?? XXX
|
andrew@33
|
194 //bayesStruct.copyPriorToPosterior();
|
andrew@33
|
195 //why was this here??
|
andrew@33
|
196 bayesStruct.prior.copyFromDynamicVector(bayesStruct.posterior);//try the otehr way
|
andrew@33
|
197 //bayesStruct.copyPriorToPosterior();
|
andrew@33
|
198 //need to get new MAP position and set the offset of the arrays
|
andrew@33
|
199 //currently bestEstimate is the approx for the new MAP position
|
andrew@33
|
200
|
andrew@33
|
201 lastPlayedPitch = pitch;
|
andrew@33
|
202 //add the new event to our played information matrix
|
andrew@33
|
203 IntVector v;
|
andrew@33
|
204 v.push_back(pitch);
|
andrew@33
|
205 v.push_back(velocity);
|
andrew@33
|
206 playedNoteOnMatrix.push_back(v);
|
andrew@33
|
207
|
andrew@33
|
208
|
andrew@33
|
209 //would update the arrays at this point to show where out current location (phase) and tempo is.
|
andrew@33
|
210 // double timeNow = ofGetElapsedTimeMillis() - startTime;
|
andrew@33
|
211 double timeNow = timePlayed;// - startTime;
|
andrew@33
|
212 recentNoteOnTime = timePlayed;
|
andrew@33
|
213
|
andrew@33
|
214 // printf("Max time %f OF time %f \n", timePlayed, timeNow);
|
andrew@33
|
215
|
andrew@33
|
216 playedEventTimes.push_back(timePlayed);
|
andrew@33
|
217
|
andrew@33
|
218 // double timeDifference = ofGetElapsedTimeMillis() - bayesStruct.lastEventTime;
|
andrew@33
|
219 double timeDifference = timePlayed - bayesStruct.lastEventTime;
|
andrew@33
|
220
|
andrew@33
|
221 //printf("note %i played at %f and last event %f time difference %f and current best estmate %f\n", pitch, timePlayed, bayesStruct.lastEventTime, timeDifference, bayesStruct.bestEstimate);
|
andrew@33
|
222
|
andrew@33
|
223 //addnoise to the tempo distribution
|
andrew@33
|
224 //bayesStruct.decaySpeedDistribution(timeDifference);
|
andrew@33
|
225
|
andrew@33
|
226 if (timeDifference > 50){
|
andrew@33
|
227 bayesStruct.addGaussianNoiseToSpeedPosterior(timeDifference * 10.0 / 100.);
|
andrew@33
|
228 // bayesStruct.addTriangularNoiseToSpeedPosterior(timeDifference * 10 / 100.);
|
andrew@33
|
229 }
|
andrew@33
|
230
|
andrew@34
|
231 // bayesStruct.updateTmpBestEstimate(timeDifference);// debug - didnt work bayesStruct.bestEstimate = bayesStruct.tmpBestEstimate;
|
andrew@33
|
232 bayesStruct.updateBestEstimate(timeDifference);
|
andrew@34
|
233
|
andrew@33
|
234 bayesStruct.lastBestEstimateUpdateTime = getTimeNow(timePlayed);
|
andrew@34
|
235 //updatePeriodValue(bayesStruct.lastBestEstimateUpdateTime);
|
andrew@34
|
236
|
andrew@33
|
237 // double newMAPestimateTime = bayesStruct.posterior.getIndexInRealTerms(bayesStruct.posterior.MAPestimate);
|
andrew@33
|
238 //was offset + bayesStruct.posterior.MAPestimate; but this doesnt include scalar to convert to millis
|
andrew@33
|
239
|
andrew@33
|
240 timeString = "Pitch:"+ofToString(pitch);
|
andrew@33
|
241 timeString += ", time now:"+ofToString(timeNow, 1);
|
andrew@33
|
242 timeString += " TD "+ofToString(timeDifference, 1);
|
andrew@33
|
243 timeString += " offset "+ofToString(bayesStruct.posterior.offset , 0);
|
andrew@33
|
244 timeString += " map Est: "+ofToString(bayesStruct.posterior.MAPestimate, 0);
|
andrew@33
|
245 // timeString += " Previous time" + ofToString(newMAPestimateTime,0);
|
andrew@33
|
246 timeString += " speedMap "+ofToString(bayesStruct.relativeSpeedPosterior.integratedEstimate, 2);
|
andrew@33
|
247 timeString += " :: "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.integratedEstimate), 2);
|
andrew@33
|
248
|
andrew@33
|
249 // newMAPestimateTime += (timeDifference * bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
250 // timeString += " : Predicted MAP time" + ofToString(newMAPestimateTime,0);
|
andrew@33
|
251
|
andrew@33
|
252 //then we recalculate the window start based on MAP being central
|
andrew@33
|
253 //then we do the matches on these and the likelihood on these.
|
andrew@33
|
254
|
andrew@33
|
255 bayesStruct.setNewDistributionOffsets(max(0., bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2)));
|
andrew@33
|
256 // bayesStruct.prior.offset = max(0.,newMAPestimateTime - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2));
|
andrew@33
|
257
|
andrew@33
|
258 timeString += " \n : new offset " + ofToString(bayesStruct.prior.offset , 0);
|
andrew@33
|
259 timeString += " \n best estimate "+ofToString(bayesStruct.bestEstimate, 1);
|
andrew@33
|
260 timeString += " error "+ofToString(minimumMatchError, 0);
|
andrew@33
|
261 timeString += " map "+ofToString(bayesStruct.relativeSpeedPosterior.integratedEstimate, 1);
|
andrew@33
|
262 timeString += " rel speed "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.integratedEstimate), 2);
|
andrew@33
|
263
|
andrew@33
|
264
|
andrew@33
|
265 //be able to draw the prior in correct location relative to the midi notes
|
andrew@33
|
266 //this calculates the cross update of all possible speeds and all possible positions
|
andrew@33
|
267 bayesStruct.crossUpdateArrays(bayesStruct.posterior, bayesStruct.relativeSpeedPosterior, timeDifference);
|
andrew@33
|
268
|
andrew@33
|
269
|
andrew@33
|
270 timeString += " new OFF "+ofToString(bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2), 1);
|
andrew@33
|
271 timeString += " notearrayindex "+ofToString(noteArrayIndex, 0);
|
andrew@33
|
272 //when this is off teh screen there is a problem somehow XXX
|
andrew@33
|
273
|
andrew@33
|
274 bayesStruct.posterior.offset = max(0., bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2));// bayesStruct.prior.offset = max(0., bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2));
|
andrew@33
|
275
|
andrew@33
|
276 //trying to switch to prior
|
andrew@33
|
277
|
andrew@33
|
278
|
andrew@33
|
279 bayesStruct.lastEventTime = timePlayed;//bayesStruct.lastEventTime = ofGetElapsedTimeMillis();
|
andrew@33
|
280
|
andrew@33
|
281 //do the cross update to find current posterior for location
|
andrew@33
|
282 // totalConfidence= 0;
|
andrew@33
|
283 int numberOfMatchesFound = findLocalMatches(pitch);
|
andrew@33
|
284 setMatchLikelihoods(numberOfMatchesFound);
|
andrew@33
|
285 bayesStruct.calculatePosterior();
|
andrew@33
|
286
|
andrew@33
|
287 if (recordedEventTimes.size() > 0){
|
andrew@33
|
288 updateTempo();
|
andrew@33
|
289 //calcuateNewInterNoteIntervals();
|
andrew@33
|
290 }
|
andrew@34
|
291
|
andrew@34
|
292 //storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@33
|
293
|
andrew@33
|
294 }
|
andrew@33
|
295
|
andrew@33
|
296 void midiEventHolder::updateTempo(){
|
andrew@33
|
297 //having found matches we have matches for new note and matches for previous notes
|
andrew@33
|
298 if (newOptimalMethod)
|
andrew@33
|
299 findOptimumTempoPairsToCurrentBestMatch();
|
andrew@33
|
300 else if (!confidenceWeightingUsed)
|
andrew@33
|
301 findLocalTempoPairs();
|
andrew@33
|
302 else
|
andrew@33
|
303 findLocalTempoPairsWeightedForConfidence();
|
andrew@33
|
304
|
andrew@33
|
305
|
andrew@33
|
306 //bayesStruct.addGaussianNoiseToSpeedPosterior(10);
|
andrew@33
|
307 }
|
andrew@33
|
308
|
andrew@33
|
309 double midiEventHolder::getTimeNow(double eventTime){
|
andrew@33
|
310 double timeNow = eventTime;
|
andrew@33
|
311 if (runningInRealTime)
|
andrew@33
|
312 timeNow = ofGetElapsedTimeMillis();
|
andrew@33
|
313 return timeNow;
|
andrew@33
|
314 }
|
andrew@33
|
315
|
andrew@33
|
316 int midiEventHolder::findLocalMatches(int notePitch){
|
andrew@33
|
317
|
andrew@33
|
318 //here we find the matches to the new note within appropriate range
|
andrew@33
|
319
|
andrew@33
|
320 matchString = "";
|
andrew@33
|
321
|
andrew@33
|
322 windowStartTime = max(0.0,(bayesStruct.bestEstimate - matchWindowWidth/2));//was playPositionInMillis
|
andrew@33
|
323 // cout << "best estimate is " << bayesStruct.bestEstimate << endl;
|
andrew@33
|
324 int numberOfMatches = findMatch(notePitch, windowStartTime, windowStartTime + matchWindowWidth);
|
andrew@33
|
325
|
andrew@33
|
326
|
andrew@33
|
327 //matchString += " pitch: "+ofToString(notePitch)+" matches "+ofToString(numberOfMatches)+" win start "+ofToString(windowStartTime);
|
andrew@33
|
328
|
andrew@33
|
329 return numberOfMatches;
|
andrew@33
|
330
|
andrew@33
|
331
|
andrew@33
|
332 }
|
andrew@33
|
333
|
andrew@33
|
334
|
andrew@33
|
335 void midiEventHolder::setMatchLikelihoods(int numberOfMatches){
|
andrew@33
|
336 //reset the offset to match the prior
|
andrew@33
|
337 bayesStruct.likelihood.offset = bayesStruct.prior.offset;
|
andrew@33
|
338 bayesStruct.likelihood.zero();//set to zero
|
andrew@33
|
339
|
andrew@33
|
340 double quantity = likelihoodToNoiseRatio / numberOfMatches;
|
andrew@33
|
341
|
andrew@33
|
342 for (int i = 0;i < numberOfMatches && matchesFound[i] >= 0 && matchesFound[i] < recordedEventTimes.size();i++){
|
andrew@33
|
343 // printf("match times %i of %i::%f adding likelihood to %f\n", i, numberOfMatches, recordedEventTimes[matchesFound[i]], recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset);
|
andrew@33
|
344 //this is the vent time since start of file
|
andrew@33
|
345 if (recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset < bayesStruct.likelihood.arraySize){
|
andrew@33
|
346 // double confidenceMeasure = 0;
|
andrew@33
|
347 // if (totalConfidence > 0)
|
andrew@33
|
348 // confidenceMeasure = bayesStruct.posterior.getValueAtMillis(recordedEventTimes[matchesFound[i]])/totalConfidence;
|
andrew@44
|
349
|
andrew@44
|
350 //bayesStruct.likelihood.addGaussianShape(recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset, likelihoodWidth, quantity);//* confidenceMeasure
|
andrew@44
|
351 bayesStruct.likelihood.addGaussianShapeFromRealTime(recordedEventTimes[matchesFound[i]], likelihoodWidth, quantity);//* confidenceMeasure
|
andrew@33
|
352 }//end if
|
andrew@33
|
353 }
|
andrew@33
|
354 bayesStruct.likelihood.addConstant((1-likelihoodToNoiseRatio)/bayesStruct.likelihood.length);
|
andrew@33
|
355 }
|
andrew@33
|
356
|
andrew@33
|
357 int midiEventHolder::findMatch(const int& notePitch, const int& startTime, const int& endTime){
|
andrew@33
|
358
|
andrew@33
|
359 matchesFound.clear();
|
andrew@33
|
360 int startIndex = 0;
|
andrew@33
|
361
|
andrew@33
|
362 if (recordedEventTimes.size() > 0){
|
andrew@33
|
363
|
andrew@33
|
364 //get to the right range of events to check in
|
andrew@33
|
365 while (startIndex < recordedEventTimes.size() && recordedEventTimes[startIndex] < startTime)
|
andrew@33
|
366 startIndex++;
|
andrew@33
|
367
|
andrew@33
|
368 }
|
andrew@33
|
369
|
andrew@33
|
370 IntVector v;
|
andrew@33
|
371 DoubleVector d;
|
andrew@33
|
372 double tmpError = 100000.;//v high error
|
andrew@33
|
373
|
andrew@33
|
374 double minimumConfidence = 0;
|
andrew@33
|
375 while (startIndex < recordedEventTimes.size() && recordedEventTimes[startIndex] < endTime){
|
andrew@33
|
376 if (recordedNoteOnMatrix[startIndex][1] == notePitch){
|
andrew@33
|
377
|
andrew@33
|
378 matchesFound.push_back(startIndex);
|
andrew@33
|
379 v.push_back(startIndex);
|
andrew@33
|
380 //so startIndex is registered as a match
|
andrew@33
|
381
|
andrew@33
|
382 double eventConfidence = bayesStruct.posterior.getValueAtMillis(recordedEventTimes[startIndex]);
|
andrew@33
|
383 if (eventConfidence > minimumConfidence){
|
andrew@33
|
384 minimumConfidence = eventConfidence;
|
andrew@33
|
385 bestMatchIndex = startIndex;
|
andrew@33
|
386 }
|
andrew@33
|
387 d.push_back(eventConfidence);
|
andrew@33
|
388
|
andrew@33
|
389 double confidence = eventConfidence;//bayesStruct.posterior.getValueAtMillis(mouseX);
|
andrew@33
|
390 // recordedEventTimes[startIndex]);
|
andrew@33
|
391 // matchString += "["+ofToString(startIndex)+"] = "+ofToString(confidence, 3)+" .";
|
andrew@33
|
392
|
andrew@33
|
393 if (abs(recordedEventTimes[startIndex] - bayesStruct.bestEstimate) < tmpError){
|
andrew@33
|
394 //record the error between expected and observed times
|
andrew@33
|
395 tmpError = abs(recordedEventTimes[startIndex] - bayesStruct.bestEstimate);
|
andrew@33
|
396 minimumMatchError = tmpError;//recordedEventTimes[startIndex] - bayesStruct.bestEstimate;
|
andrew@33
|
397 }
|
andrew@33
|
398
|
andrew@33
|
399 }
|
andrew@33
|
400 startIndex++;
|
andrew@33
|
401 }
|
andrew@33
|
402
|
andrew@33
|
403
|
andrew@33
|
404 // printf("%i MATCHES TO Note %i found\n", (int)matchesFound.size(), notePitch);
|
andrew@33
|
405 int size = matchesFound.size();
|
andrew@33
|
406 if (size > 0)
|
andrew@33
|
407 noteOnMatches[bestMatchIndex] = true;
|
andrew@33
|
408
|
andrew@33
|
409 v.insert(v.begin() , (int)size);//at beginning, we list how many matches there are that we have found
|
andrew@33
|
410 d.insert(d.begin() , (double)size);
|
andrew@33
|
411
|
andrew@33
|
412 //v.push_back(size);
|
andrew@33
|
413 //d.push_back(size);
|
andrew@33
|
414 //for (int i = 0;i < matchesFound.size()+1;i++){
|
andrew@33
|
415 // v.push_back(matchesFound[i]);
|
andrew@33
|
416 // printf("match %i,[%i] is %i\n", startIndex, i, v[i]);
|
andrew@33
|
417 //}
|
andrew@33
|
418
|
andrew@33
|
419
|
andrew@33
|
420 matchMatrix.push_back(v);
|
andrew@33
|
421 matchConfidence.push_back(d);
|
andrew@33
|
422
|
andrew@33
|
423 //bringing in way to list only the best matches and use these in tempo process
|
andrew@33
|
424 bestMatchFound.push_back(bestMatchIndex);
|
andrew@33
|
425
|
andrew@33
|
426 // printf("BEST MATCH TO note %i, start time %i, endtime %i, time %i is recorded time %i, confidence %0.2f\n", notePitch, startTime, endTime, (int) recordedEventTimes[bestMatchIndex], minimumConfidence);
|
andrew@33
|
427
|
andrew@33
|
428 return size;
|
andrew@33
|
429 }
|
andrew@33
|
430
|
andrew@33
|
431 bool midiEventHolder::checkIfMatchedNote(const int& tmpIndex){
|
andrew@33
|
432 for (int i = 0;i < matchesFound.size();i++){
|
andrew@33
|
433 if (matchesFound[i] == tmpIndex)
|
andrew@33
|
434 return true;
|
andrew@33
|
435 }
|
andrew@33
|
436 return false;
|
andrew@33
|
437 }
|
andrew@33
|
438
|
andrew@33
|
439
|
andrew@33
|
440
|
andrew@33
|
441 void midiEventHolder::findLocalTempoPairs(){
|
andrew@33
|
442
|
andrew@33
|
443 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
444 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@33
|
445 // printMatchesFound();
|
andrew@33
|
446 // printMatchMatrix();
|
andrew@33
|
447 // printf("possible notes \n");
|
andrew@33
|
448 bool needToUpdate = false;
|
andrew@33
|
449 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
450
|
andrew@33
|
451
|
andrew@33
|
452 for (int i = 0;i < matchMatrix[currentPlayedIndex][0];i++){
|
andrew@33
|
453 //iterate through the recently matched events - even dodgy matches included
|
andrew@33
|
454 //size, index of match0, index of match1, ....
|
andrew@33
|
455
|
andrew@33
|
456
|
andrew@33
|
457 int recordedCurrentIndex = matchMatrix[currentPlayedIndex][i+1];
|
andrew@33
|
458
|
andrew@33
|
459 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
460
|
andrew@33
|
461
|
andrew@33
|
462 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
463 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
464
|
andrew@33
|
465 for (int k = 0;k < matchMatrix[previousIndex][0];k++){
|
andrew@33
|
466
|
andrew@33
|
467 int recordedPreviousIndex = matchMatrix[previousIndex][k+1];
|
andrew@33
|
468
|
andrew@33
|
469 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
470
|
andrew@33
|
471
|
andrew@33
|
472 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
473
|
andrew@33
|
474 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
475 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate &&
|
andrew@33
|
476 speedRatio <= maximumMatchSpeed && speedRatio >= minimumMatchSpeed){
|
andrew@33
|
477
|
andrew@33
|
478 //adding in a prior that prefers 1
|
andrew@33
|
479 double priorWeighting = 1;
|
andrew@33
|
480 if (useTempoPrior)
|
andrew@33
|
481 priorWeighting = sin(speedRatio * PI/2);
|
andrew@33
|
482
|
andrew@33
|
483
|
andrew@33
|
484
|
andrew@33
|
485 /*
|
andrew@33
|
486 printf("(%i)", matchMatrix[currentPlayedIndex][i+1]);
|
andrew@33
|
487 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
488 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
489 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
490 */
|
andrew@33
|
491 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
492 // commented for debug
|
andrew@33
|
493
|
andrew@33
|
494 //bayesStruct.updateTempoDistribution(speedRatio, 0.1);//second paramter is confidence in the match
|
andrew@33
|
495 double amount = (1-bayesStruct.speedLikelihoodNoise)/10;
|
andrew@33
|
496 amount *= priorWeighting;
|
andrew@33
|
497 bayesStruct.updateTempoLikelihood(speedRatio, amount);
|
andrew@33
|
498 // tempoSpeedString += ofToString(recordedPreviousIndex) + " "+ ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
499 needToUpdate = true;
|
andrew@33
|
500 }
|
andrew@33
|
501 // printf("\n");
|
andrew@33
|
502 }
|
andrew@33
|
503
|
andrew@33
|
504 previousIndex--;
|
andrew@33
|
505 }//end while previousindex countdown
|
andrew@33
|
506 }//end for loop through possible current matches
|
andrew@33
|
507
|
andrew@33
|
508 if (needToUpdate)
|
andrew@33
|
509 bayesStruct.updateTempoDistribution();
|
andrew@33
|
510
|
andrew@33
|
511 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
512 }
|
andrew@33
|
513
|
andrew@33
|
514
|
andrew@33
|
515 void midiEventHolder::findLocalTempoPairsWeightedForConfidence(){
|
andrew@33
|
516 bool needToUpdate = false;
|
andrew@33
|
517
|
andrew@33
|
518 DoubleVector speedIntervalsFound;
|
andrew@33
|
519
|
andrew@33
|
520 //adapted this to just use the best match for each note
|
andrew@33
|
521
|
andrew@33
|
522 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
523 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@33
|
524 // printMatchesFound();
|
andrew@33
|
525 // printMatchMatrix();
|
andrew@33
|
526 // printf("possible notes \n");
|
andrew@33
|
527
|
andrew@33
|
528 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
529
|
andrew@33
|
530 int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
531 //we only look at intervals between the current best match and other recent best matched notes
|
andrew@33
|
532 //that is the difference in confidence method
|
andrew@33
|
533
|
andrew@33
|
534
|
andrew@33
|
535 //printf("BEST MATCH FOUND for index %i is %i ", currentPlayedIndex, bestMatchFound[currentPlayedIndex]);
|
andrew@33
|
536
|
andrew@33
|
537 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
538
|
andrew@33
|
539 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
540 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
541 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
542
|
andrew@33
|
543 int recordedPreviousIndex = bestMatchFound[previousIndex];
|
andrew@33
|
544
|
andrew@33
|
545 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
546
|
andrew@33
|
547
|
andrew@33
|
548 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
549
|
andrew@33
|
550 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
551 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate
|
andrew@33
|
552 && speedRatio < maximumMatchSpeed && speedRatio > minimumMatchSpeed){
|
andrew@33
|
553
|
andrew@33
|
554 /* printf("(%i)", previousIndex);
|
andrew@33
|
555 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
556 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@33
|
557 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
558 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
559 */
|
andrew@33
|
560 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
561 // commented for debug
|
andrew@33
|
562
|
andrew@33
|
563
|
andrew@33
|
564 double priorWeighting = 1;
|
andrew@33
|
565
|
andrew@33
|
566 if (useTempoPrior)
|
andrew@33
|
567 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@33
|
568
|
andrew@33
|
569
|
andrew@33
|
570 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@33
|
571 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/16;//was 9
|
andrew@33
|
572
|
andrew@33
|
573 speedIntervalsFound.push_back(speedRatio);
|
andrew@33
|
574 // bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@33
|
575
|
andrew@33
|
576 // tempoSpeedString += ofToString(recordedCurrentIndex) + " :: " + ofToString(recordedPreviousIndex);
|
andrew@33
|
577 // tempoSpeedString += " " + ofToString(recordedTimeDifference)+ " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
578
|
andrew@33
|
579 needToUpdate = true;
|
andrew@33
|
580 }
|
andrew@33
|
581 // printf("\n");
|
andrew@33
|
582
|
andrew@33
|
583
|
andrew@33
|
584 previousIndex--;
|
andrew@33
|
585 }//end while previousindex countdown
|
andrew@33
|
586
|
andrew@33
|
587 if (speedIntervalsFound.size() > 0){
|
andrew@33
|
588 double amount = (1 - bayesStruct.speedLikelihoodNoise) / speedIntervalsFound.size();
|
andrew@33
|
589 for (int i = 0;i < speedIntervalsFound.size();i++)
|
andrew@33
|
590 bayesStruct.updateTempoLikelihood(speedIntervalsFound[i], amount);
|
andrew@33
|
591 }
|
andrew@33
|
592
|
andrew@33
|
593
|
andrew@33
|
594 if (needToUpdate)
|
andrew@33
|
595 bayesStruct.updateTempoDistribution();
|
andrew@33
|
596 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
597 }
|
andrew@33
|
598
|
andrew@33
|
599 double midiEventHolder::getBestSpeedEstimate(const int& currentPlayedIndex, const int& equivalentRecordedIndex){
|
andrew@33
|
600 double estimate = 1.0;
|
andrew@33
|
601 if (bestMatchIndex > 0){
|
andrew@33
|
602 double accordingToFileLengthEstimate = recordedEventTimes[equivalentRecordedIndex] - recordedEventTimes[0];
|
andrew@33
|
603 double playedEquivalent = (playedEventTimes[currentPlayedIndex] - playedEventTimes[0]);
|
andrew@33
|
604 if (accordingToFileLengthEstimate > 0 && playedEquivalent > 0)
|
andrew@33
|
605 accordingToFileLengthEstimate /= playedEquivalent;
|
andrew@33
|
606 estimate = accordingToFileLengthEstimate;
|
andrew@33
|
607 }
|
andrew@33
|
608 return estimate;
|
andrew@33
|
609 }
|
andrew@33
|
610
|
andrew@33
|
611 void midiEventHolder::findOptimumTempoPairsToCurrentBestMatch(){
|
andrew@33
|
612 bool needToUpdate = false;
|
andrew@33
|
613
|
andrew@33
|
614 DoubleVector speedIntervalsFound;
|
andrew@33
|
615
|
andrew@33
|
616 double currentSpeedEstimate = bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate);
|
andrew@33
|
617
|
andrew@33
|
618 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
619
|
andrew@33
|
620 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
621
|
andrew@33
|
622 int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
623 //we only look at intervals between the current best match and other recent best matched notes
|
andrew@33
|
624
|
andrew@33
|
625 //printf("BEST MATCH FOUND for index %i is %i ", currentPlayedIndex, bestMatchFound[currentPlayedIndex]);
|
andrew@33
|
626
|
andrew@33
|
627 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
628
|
andrew@33
|
629 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
630 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
631
|
andrew@33
|
632 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
633
|
andrew@33
|
634 int recordedPreviousIndex = bestMatchFound[previousIndex];
|
andrew@33
|
635
|
andrew@33
|
636 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
637
|
andrew@33
|
638 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
639 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
640
|
andrew@33
|
641 //now check if this can be closer the observed value
|
andrew@33
|
642 int checkRecordedCurrentIndex = recordedCurrentIndex;
|
andrew@33
|
643 int checkRecordedPreviousIndex ;//= recordedCurrentIndex;
|
andrew@33
|
644 int currentPlayedPitch = playedNoteOnMatrix[currentPlayedIndex][1];
|
andrew@33
|
645 int previousPlayedPitch = playedNoteOnMatrix[previousIndex][1];
|
andrew@33
|
646
|
andrew@33
|
647 double recordedTimeOfBestMatch = recordedEventTimes[recordedCurrentIndex];
|
andrew@33
|
648
|
andrew@33
|
649 //change this so we start first in window and go to end
|
andrew@33
|
650
|
andrew@33
|
651 while (checkRecordedCurrentIndex >= 0 && recordedEventTimes[checkRecordedCurrentIndex] > recordedTimeOfBestMatch - matchWindowWidth){
|
andrew@33
|
652
|
andrew@33
|
653 checkRecordedCurrentIndex--;
|
andrew@33
|
654 }
|
andrew@33
|
655
|
andrew@33
|
656 double bestSpeedEstimate = getBestSpeedEstimate(currentPlayedIndex, bestMatchIndex);
|
andrew@33
|
657
|
andrew@33
|
658 while (checkRecordedCurrentIndex < recordedEventTimes.size() && recordedEventTimes[checkRecordedCurrentIndex] < recordedTimeOfBestMatch + matchWindowWidth ){
|
andrew@33
|
659 if (recordedNoteOnMatrix[checkRecordedCurrentIndex][1] == currentPlayedPitch ){
|
andrew@33
|
660 checkRecordedPreviousIndex = checkRecordedCurrentIndex;
|
andrew@33
|
661 double recordedTimeCurrent = recordedEventTimes[checkRecordedCurrentIndex] ;
|
andrew@33
|
662 while (checkRecordedPreviousIndex >= 0 && recordedEventTimes[checkRecordedPreviousIndex] + maximumMatchSpeed*playedTimeDifference > recordedTimeCurrent ) {
|
andrew@33
|
663 if (recordedNoteOnMatrix[checkRecordedPreviousIndex][1] == previousPlayedPitch){
|
andrew@33
|
664 //we have a candidate
|
andrew@33
|
665 double speedToTest = recordedEventTimes[checkRecordedCurrentIndex] - recordedEventTimes[checkRecordedPreviousIndex];
|
andrew@33
|
666 speedToTest /= playedTimeDifference;
|
andrew@33
|
667 if (abs(speedToTest-currentSpeedEstimate) < abs(speedRatio - currentSpeedEstimate) ){
|
andrew@33
|
668 speedRatio = speedToTest;
|
andrew@33
|
669 }
|
andrew@33
|
670 }
|
andrew@33
|
671 checkRecordedPreviousIndex--;
|
andrew@33
|
672 }
|
andrew@33
|
673 }
|
andrew@33
|
674 checkRecordedCurrentIndex++;
|
andrew@33
|
675 }
|
andrew@33
|
676
|
andrew@33
|
677
|
andrew@33
|
678 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate
|
andrew@33
|
679 && speedRatio < maximumMatchSpeed && speedRatio > minimumMatchSpeed){
|
andrew@33
|
680
|
andrew@33
|
681 /* printf("(%i)", previousIndex);
|
andrew@33
|
682 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
683 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@33
|
684 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
685 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
686 */
|
andrew@33
|
687 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
688 // commented for debug
|
andrew@33
|
689
|
andrew@33
|
690
|
andrew@33
|
691 double priorWeighting = 1;
|
andrew@33
|
692
|
andrew@33
|
693 if (useTempoPrior)
|
andrew@33
|
694 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@33
|
695
|
andrew@33
|
696
|
andrew@33
|
697 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@33
|
698 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/16;//was 9
|
andrew@33
|
699
|
andrew@33
|
700 speedIntervalsFound.push_back(speedRatio);
|
andrew@33
|
701 // bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@33
|
702
|
andrew@33
|
703 // tempoSpeedString += ofToString(recordedCurrentIndex) + " :: " + ofToString(recordedPreviousIndex);
|
andrew@33
|
704 // tempoSpeedString += " " + ofToString(recordedTimeDifference)+ " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
705
|
andrew@33
|
706 needToUpdate = true;
|
andrew@33
|
707 }
|
andrew@33
|
708 // printf("\n");
|
andrew@33
|
709
|
andrew@33
|
710
|
andrew@33
|
711 previousIndex--;
|
andrew@33
|
712 }//end while previousindex countdown
|
andrew@33
|
713
|
andrew@33
|
714 if (speedIntervalsFound.size() > 0){
|
andrew@33
|
715 double amount = (1 - bayesStruct.speedLikelihoodNoise) / speedIntervalsFound.size();
|
andrew@33
|
716 for (int i = 0;i < speedIntervalsFound.size();i++)
|
andrew@33
|
717 bayesStruct.updateTempoLikelihood(speedIntervalsFound[i], amount);
|
andrew@33
|
718 }
|
andrew@33
|
719
|
andrew@33
|
720
|
andrew@33
|
721 if (needToUpdate)
|
andrew@33
|
722 bayesStruct.updateTempoDistribution();
|
andrew@33
|
723 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
724 }
|
andrew@33
|
725
|
andrew@33
|
726
|
andrew@33
|
727 void midiEventHolder::calcuateNewInterNoteIntervals(){
|
andrew@33
|
728 DoubleVector v;
|
andrew@33
|
729
|
andrew@33
|
730 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
731 // int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
732 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
733
|
andrew@33
|
734 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
735 while (previousIndex >= 0 && playedEventTimes[previousIndex] + interNoteRange > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
736
|
andrew@33
|
737 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
738
|
andrew@33
|
739 checkForCorrectInterval(playedTimeDifference, &v);
|
andrew@33
|
740
|
andrew@33
|
741 previousIndex--;
|
andrew@33
|
742 }
|
andrew@33
|
743
|
andrew@33
|
744 if (v.size() > 0)
|
andrew@33
|
745 interNoteIntervals.push_back(v);
|
andrew@33
|
746 //printf("\n");
|
andrew@33
|
747 }
|
andrew@33
|
748
|
andrew@33
|
749 void midiEventHolder::checkForCorrectInterval(const double& playedTimeDifference, DoubleVector* v){
|
andrew@33
|
750 double intervalDuration = 0.0;
|
andrew@33
|
751
|
andrew@33
|
752 for (int intervalIndex = 0;intervalIndex < 3;intervalIndex++){
|
andrew@33
|
753 //on;y check 1,2 and 4
|
andrew@33
|
754 double possibleDuration = playedTimeDifference / intervalsToCheck[intervalIndex];
|
andrew@33
|
755 if (possibleDuration >= 200 && possibleDuration < 400){
|
andrew@33
|
756 v->push_back(possibleDuration);
|
andrew@33
|
757 // printf("int %f / %i :: %f ", playedTimeDifference, intervalsToCheck[intervalIndex], possibleDuration);
|
andrew@33
|
758 }
|
andrew@33
|
759 }
|
andrew@33
|
760 }
|
andrew@33
|
761
|
andrew@33
|
762
|
andrew@33
|
763 void midiEventHolder::updatePlayPosition(){
|
andrew@34
|
764 //timeDifference = ofGetElapsedTimeMillis() - startPlayingTime;//elpased
|
andrew@33
|
765
|
andrew@33
|
766 //in actual fact if we are changing the speed of the play position
|
andrew@33
|
767 //we will need to update this via the file
|
andrew@33
|
768
|
andrew@33
|
769 //actually time since beginning of file i think
|
andrew@33
|
770
|
andrew@33
|
771 double timeDifference = 0;
|
andrew@34
|
772
|
andrew@34
|
773 if (runningInRealTime){
|
andrew@34
|
774
|
andrew@34
|
775 bayesStruct.updateBestEstimate(timeDifference);
|
andrew@34
|
776 // bayesStruct.updateTmpBestEstimate(timeDifference);
|
andrew@34
|
777 }
|
andrew@34
|
778
|
andrew@35
|
779
|
andrew@35
|
780
|
andrew@35
|
781 if (smoothPlayPosition < bayesStruct.bestEstimate){
|
andrew@35
|
782 updateSmoothPositionTo(bayesStruct.bestEstimate);
|
andrew@35
|
783 //smoothPlayPosition = bayesStruct.bestEstimate;
|
andrew@35
|
784 }
|
andrew@34
|
785
|
andrew@34
|
786 // playPositionInMillis = timeDifference;//based on updating from when we change period
|
andrew@34
|
787 //this to be added
|
andrew@34
|
788
|
andrew@33
|
789
|
andrew@33
|
790 //this is time diff in milliseconds
|
andrew@33
|
791 //then we have
|
andrew@33
|
792 double quarterNoteIntervals = (timeDifference / period);
|
andrew@33
|
793 tickLocation = quarterNoteIntervals * pulsesPerQuarternote;
|
andrew@33
|
794
|
andrew@33
|
795 updateNoteCounter();
|
andrew@33
|
796
|
andrew@33
|
797 }
|
andrew@33
|
798
|
andrew@35
|
799 void midiEventHolder::updateSmoothPositionTo(const double& newPosition){
|
andrew@42
|
800 //smooth play position was where we last outputted notes from.
|
andrew@42
|
801 //checking index is there to make sense.
|
andrew@35
|
802 while (smoothIndex > 0 && recordedEventTimes[smoothIndex] > smoothPlayPosition){
|
andrew@35
|
803 smoothIndex--;
|
andrew@42
|
804 //printf("going backewaers on smooth, ");
|
andrew@35
|
805 }
|
andrew@35
|
806 while (smoothIndex < recordedEventTimes.size()-1 && recordedEventTimes[smoothIndex] < smoothPlayPosition){
|
andrew@35
|
807 smoothIndex++;
|
andrew@42
|
808 //printf("outputting smooth\n ");
|
andrew@35
|
809 }
|
andrew@35
|
810
|
andrew@35
|
811
|
andrew@35
|
812 double playingTime = ofGetElapsedTimeMillis();
|
andrew@35
|
813 playingTime -= startPlayingTime;
|
andrew@35
|
814 //now at the last one
|
andrew@35
|
815
|
andrew@39
|
816 float smoothLocation = beatPositions[smoothIndex];
|
andrew@39
|
817 int currentNote = recordedNoteOnMatrix[smoothIndex][1];
|
andrew@36
|
818
|
andrew@35
|
819 while (smoothIndex < recordedEventTimes.size() && recordedEventTimes[smoothIndex] < newPosition){
|
andrew@36
|
820 float annotationTime = 0;
|
andrew@38
|
821 float annotationLocation = 0;
|
andrew@42
|
822 int annotationTick = 0;
|
andrew@36
|
823 int annotationNote = 0;
|
andrew@39
|
824 float difference = 10000;//very big
|
andrew@39
|
825 float currentLocationDifference = 1.0;
|
andrew@39
|
826 float range = 1.0;
|
andrew@36
|
827 if (smoothIndex < myNotation.rwcAnnotations.size()){
|
andrew@39
|
828 //add in test here to find closest matching note
|
andrew@39
|
829
|
andrew@42
|
830
|
andrew@36
|
831 annotationTime = myNotation.rwcAnnotations[smoothIndex].eventTime;
|
andrew@36
|
832 annotationNote = myNotation.rwcAnnotations[smoothIndex].midiNote;
|
andrew@38
|
833 annotationLocation = myNotation.rwcAnnotations[smoothIndex].beatLocation;
|
andrew@42
|
834 annotationTick = round(annotationLocation*480.0);
|
andrew@42
|
835 }else{
|
andrew@42
|
836 printf("No annotaion size %i\n", (int)myNotation.rwcAnnotations.size());
|
andrew@36
|
837 }
|
andrew@36
|
838
|
andrew@39
|
839 difference = playingTime - (annotationTime*1000.0);
|
andrew@36
|
840
|
andrew@35
|
841 if ((*fileOutput).is_open()){
|
andrew@36
|
842 (*fileOutput) << fixed << beatPositions[smoothIndex] <<",\t" << recordedNoteOnMatrix[smoothIndex][1] << ",\t";
|
andrew@36
|
843 (*fileOutput) << playingTime ;
|
andrew@37
|
844
|
andrew@36
|
845 if ( recordedNoteOnMatrix[smoothIndex][1] == annotationNote){
|
andrew@36
|
846 (*fileOutput) << " corresponds to " << annotationTime;
|
andrew@36
|
847 }
|
andrew@36
|
848 (*fileOutput) << " \n";
|
andrew@36
|
849
|
andrew@38
|
850
|
andrew@37
|
851
|
andrew@37
|
852 }
|
andrew@37
|
853
|
andrew@44
|
854 printf("annotaions: rec tick time %i vs %i midi %i beat pos %f playing time now at %f :: annotaion %i loc % f time %f diff \t%f ms\n",
|
andrew@42
|
855 recordedNoteOnMatrix[smoothIndex][0], annotationTick, recordedNoteOnMatrix[smoothIndex][1],
|
andrew@42
|
856 beatPositions[smoothIndex], playingTime,
|
andrew@42
|
857 annotationNote, annotationLocation, annotationTime, difference);
|
andrew@42
|
858
|
andrew@42
|
859 // assert(annotationNote == recordedNoteOnMatrix[smoothIndex][1]);
|
andrew@42
|
860 assert(annotationTick == recordedNoteOnMatrix[smoothIndex][0]);
|
andrew@42
|
861
|
andrew@42
|
862
|
andrew@37
|
863 if ((*differenceOutput).is_open()){
|
andrew@37
|
864 (*differenceOutput) << beatPositions[smoothIndex] << "," << difference << "\n";
|
andrew@42
|
865 // printf("midi %i beat pos %f playing time now at %f :: annotaion %i loc % f time %f diff \t%f ms\n",
|
andrew@42
|
866 // recordedNoteOnMatrix[smoothIndex][1],
|
andrew@42
|
867 // beatPositions[smoothIndex], playingTime,
|
andrew@42
|
868 // annotationNote, annotationLocation, annotationTime, difference);
|
andrew@42
|
869 }else{
|
andrew@42
|
870 printf("file not open\n");
|
andrew@35
|
871 }
|
andrew@35
|
872
|
andrew@35
|
873 smoothIndex++;
|
andrew@35
|
874 }
|
andrew@35
|
875
|
andrew@35
|
876
|
andrew@35
|
877 smoothPlayPosition = newPosition;
|
andrew@35
|
878
|
andrew@35
|
879 }
|
andrew@35
|
880
|
andrew@34
|
881
|
andrew@34
|
882 void midiEventHolder::updatePeriodValue(const double& millis){
|
andrew@34
|
883
|
andrew@34
|
884 double tmp = period;
|
andrew@34
|
885 /*
|
andrew@34
|
886 while (periodCounter >= 0 && periodCounter < periodValues.size()-1 && periodValues[periodCounter][2] < millis){
|
andrew@34
|
887 periodCounter++;
|
andrew@34
|
888 }
|
andrew@34
|
889 while (periodCounter > 0 && periodValues[periodCounter][2] > millis){
|
andrew@34
|
890 periodCounter--;
|
andrew@34
|
891 }
|
andrew@34
|
892 */
|
andrew@34
|
893 //period = periodValues[periodCounter][1];
|
andrew@34
|
894
|
andrew@34
|
895 if (period != tmp){
|
andrew@34
|
896 printf("new period at %f of %f\n", millis, period);
|
andrew@34
|
897 }
|
andrew@34
|
898 }
|
andrew@34
|
899
|
andrew@33
|
900 void midiEventHolder::updateNoteCounter(){
|
andrew@33
|
901 while (totalNoteCounterIndex < bestMatchIndex){
|
andrew@33
|
902 int tmpPitch = recordedNoteOnMatrix[totalNoteCounterIndex][1];
|
andrew@33
|
903 recordedTotalNoteCounterByPitch[tmpPitch] += 1;
|
andrew@33
|
904 totalNoteCounterIndex++;
|
andrew@33
|
905 }
|
andrew@33
|
906 }
|
andrew@33
|
907
|
andrew@33
|
908
|
andrew@33
|
909 void midiEventHolder::drawMidiFile(){
|
andrew@33
|
910
|
andrew@33
|
911 //draws midi file on scrolling screen
|
andrew@33
|
912 int size = recordedNoteOnMatrix.size();
|
andrew@33
|
913 if (size > 0){
|
andrew@33
|
914
|
andrew@33
|
915 numberOfScreensIn = floor(bayesStruct.bestEstimate / getEventTimeMillis(ticksPerScreen));//rpounds down on no screens in
|
andrew@33
|
916
|
andrew@33
|
917 // numberOfScreensIn = tickLocation / ticksPerScreen;//rounds down
|
andrew@33
|
918 timeOffsetForScreen = getEventTimeMillis(numberOfScreensIn * ticksPerScreen);
|
andrew@33
|
919
|
andrew@33
|
920 while (noteArrayIndex < recordedNoteOnMatrix.size()-1 && tickLocation > recordedNoteOnMatrix[noteArrayIndex][0] )
|
andrew@33
|
921 noteArrayIndex++;
|
andrew@33
|
922
|
andrew@33
|
923
|
andrew@33
|
924 while (noteArrayIndex > 0 && noteArrayIndex < size && tickLocation < recordedNoteOnMatrix[noteArrayIndex][0])
|
andrew@33
|
925 noteArrayIndex--;
|
andrew@33
|
926
|
andrew@33
|
927 //need to start where we currently are in file
|
andrew@33
|
928 int maxNoteIndexToPrint = noteArrayIndex;
|
andrew@33
|
929 int minNoteIndexToPrint = min(size-1,noteArrayIndex);//not needed as changed above
|
andrew@33
|
930
|
andrew@33
|
931 while (maxNoteIndexToPrint < recordedNoteOnMatrix.size() && recordedNoteOnMatrix[maxNoteIndexToPrint][0] < (numberOfScreensIn+1)*ticksPerScreen )
|
andrew@33
|
932 maxNoteIndexToPrint++;
|
andrew@33
|
933
|
andrew@33
|
934 while (minNoteIndexToPrint > 0 && recordedNoteOnMatrix[minNoteIndexToPrint][0] > numberOfScreensIn*ticksPerScreen)//&& minNoteIndexToPrint < size
|
andrew@33
|
935 minNoteIndexToPrint--;
|
andrew@33
|
936
|
andrew@33
|
937 for (int tmpIndex = max(0,minNoteIndexToPrint);tmpIndex < min(maxNoteIndexToPrint, (int)recordedNoteOnMatrix.size());tmpIndex++){
|
andrew@33
|
938
|
andrew@33
|
939 ofSetColor(255,255,255);
|
andrew@33
|
940 if (checkIfMatchedNote(tmpIndex))
|
andrew@33
|
941 ofSetColor(100,100,100);//0,0,255);
|
andrew@33
|
942 else if(noteOnMatches[tmpIndex]){
|
andrew@33
|
943 ofSetColor(255,0,255);//dark grey
|
andrew@33
|
944 }
|
andrew@33
|
945 else{
|
andrew@33
|
946 ofSetColor(255,255,255);//255,255,255);
|
andrew@33
|
947 }
|
andrew@33
|
948
|
andrew@33
|
949 //ofSetColor(255,255,255);
|
andrew@33
|
950 if (tmpIndex == bestMatchIndex)
|
andrew@33
|
951 ofSetColor(255,0,0);//best recent match is in red
|
andrew@33
|
952
|
andrew@33
|
953 // XXX replace ofgetwidth below
|
andrew@33
|
954 //if (tmpIndex >= 0 && tmpIndex < size)
|
andrew@33
|
955 int xLocation = (float)(recordedNoteOnMatrix[tmpIndex][0] - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
956 int duration = (float)(recordedNoteOnMatrix[tmpIndex][3]*(*screenWidth))/(float)ticksPerScreen;
|
andrew@33
|
957
|
andrew@33
|
958
|
andrew@33
|
959 int yLocation = (*screenHeight) - ((recordedNoteOnMatrix[tmpIndex][1] - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
960 ofRect(xLocation,yLocation, duration, noteHeight);
|
andrew@33
|
961
|
andrew@33
|
962 }
|
andrew@33
|
963
|
andrew@33
|
964
|
andrew@33
|
965 int xLocation;// = getLocationFromTicks(tickLocation);
|
andrew@33
|
966 // ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
967
|
andrew@33
|
968 //orange line at best estimate
|
andrew@33
|
969 xLocation = getLocationFromMillis(bayesStruct.bestEstimate);
|
andrew@34
|
970 ofSetColor(250,250,20);//250,100,0);
|
andrew@33
|
971 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
972
|
andrew@34
|
973 xLocation = getLocationFromMillis(smoothPlayPosition);//bayesStruct.tmpBestEstimate
|
andrew@34
|
974 ofSetColor(0,250,0);//250,150, 250,100,0);
|
andrew@33
|
975 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
976
|
andrew@33
|
977
|
andrew@33
|
978 //lines where matching window start and end are
|
andrew@33
|
979 ofSetColor(0);//0,100,255);
|
andrew@33
|
980 xLocation = getLocationFromMillis(windowStartTime);
|
andrew@33
|
981 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
982 xLocation = getLocationFromMillis(windowStartTime+matchWindowWidth);
|
andrew@33
|
983 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
984
|
andrew@33
|
985
|
andrew@33
|
986 int maxSize = recordedNoteOnMatrix[size-1][0];
|
andrew@33
|
987
|
andrew@33
|
988 int tmpIndex = 0;
|
andrew@33
|
989 while (tmpIndex < measureVector.size() && measureVector[tmpIndex] < (numberOfScreensIn+1)*ticksPerScreen){
|
andrew@33
|
990 int measureLocation = measureVector[tmpIndex];
|
andrew@33
|
991 int xLocation = (float)(measureLocation - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
992 ofSetColor(155,155,0);
|
andrew@33
|
993 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
994 tmpIndex++;
|
andrew@33
|
995 }
|
andrew@33
|
996
|
andrew@33
|
997
|
andrew@33
|
998 // ofDrawBitmapString(tempoSpeedString, 20, 20);
|
andrew@33
|
999 /* string indexString = "num screens in "+ofToString(numberOfScreensIn)+"; min index to print "+ofToString(minNoteIndexToPrint)+", max index to print "+ofToString(maxNoteIndexToPrint);
|
andrew@33
|
1000 indexString += " size "+ofToString(size)+" tick loc "+ofToString(tickLocation)+" max size "+ofToString(maxSize);
|
andrew@33
|
1001 ofDrawBitmapString(indexString, 20, 40);
|
andrew@33
|
1002 */
|
andrew@33
|
1003 }
|
andrew@33
|
1004
|
andrew@33
|
1005 //ofDrawBitmapString(ofToString(timeOffsetForScreen, 1), 20,20);
|
andrew@33
|
1006
|
andrew@33
|
1007 //ofDrawBitmapString(timeString, 20, 60);
|
andrew@33
|
1008
|
andrew@33
|
1009 //last played piutch
|
andrew@33
|
1010 ofSetColor(0,200,0,50);
|
andrew@33
|
1011 int yLocation = (*screenHeight) - ((lastPlayedPitch - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1012 ofRect(0,yLocation, 100, noteHeight);
|
andrew@33
|
1013
|
andrew@33
|
1014
|
andrew@33
|
1015
|
andrew@33
|
1016 }
|
andrew@33
|
1017
|
andrew@33
|
1018
|
andrew@33
|
1019
|
andrew@33
|
1020 void midiEventHolder::drawMidiFile(IntMatrix& midiFileToDraw){
|
andrew@33
|
1021
|
andrew@33
|
1022 //using this to draw the live input
|
andrew@33
|
1023
|
andrew@33
|
1024 //draws midi file on scrolling screen
|
andrew@33
|
1025 int size = midiFileToDraw.size();
|
andrew@33
|
1026 if (size > 0){
|
andrew@33
|
1027
|
andrew@33
|
1028 numberOfScreensIn = floor(bayesStruct.bestEstimate / getEventTimeMillis(ticksPerScreen));//rpounds down on no screens in
|
andrew@33
|
1029
|
andrew@33
|
1030 // numberOfScreensIn = tickLocation / ticksPerScreen;//rounds down
|
andrew@33
|
1031 timeOffsetForScreen = getEventTimeMillis(numberOfScreensIn * ticksPerScreen);
|
andrew@33
|
1032
|
andrew@33
|
1033 while (noteArrayIndex < midiFileToDraw.size()-1 && tickLocation > midiFileToDraw[noteArrayIndex][0] )
|
andrew@33
|
1034 noteArrayIndex++;
|
andrew@33
|
1035
|
andrew@33
|
1036
|
andrew@33
|
1037 while (noteArrayIndex > 0 && noteArrayIndex < size && tickLocation < midiFileToDraw[noteArrayIndex][0])
|
andrew@33
|
1038 noteArrayIndex--;
|
andrew@33
|
1039
|
andrew@33
|
1040 //need to start where we currently are in file
|
andrew@33
|
1041 int maxNoteIndexToPrint = noteArrayIndex;
|
andrew@33
|
1042 int minNoteIndexToPrint = min(size-1,noteArrayIndex);//not needed as changed above
|
andrew@33
|
1043
|
andrew@33
|
1044 while (maxNoteIndexToPrint < midiFileToDraw.size() && midiFileToDraw[maxNoteIndexToPrint][0] < (numberOfScreensIn+1)*ticksPerScreen )
|
andrew@33
|
1045 maxNoteIndexToPrint++;
|
andrew@33
|
1046
|
andrew@33
|
1047 while (minNoteIndexToPrint > 0 && midiFileToDraw[minNoteIndexToPrint][0] > numberOfScreensIn*ticksPerScreen)//&& minNoteIndexToPrint < size
|
andrew@33
|
1048 minNoteIndexToPrint--;
|
andrew@33
|
1049
|
andrew@33
|
1050 for (int tmpIndex = max(0,minNoteIndexToPrint);tmpIndex < min(maxNoteIndexToPrint, (int)midiFileToDraw.size());tmpIndex++){
|
andrew@33
|
1051
|
andrew@33
|
1052 ofSetColor(0,0,255, 200);
|
andrew@33
|
1053
|
andrew@33
|
1054 int xLocation = (float)(midiFileToDraw[tmpIndex][0] - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
1055 int duration = (float)(midiFileToDraw[tmpIndex][3]*(*screenWidth))/(float)ticksPerScreen;
|
andrew@33
|
1056
|
andrew@33
|
1057
|
andrew@33
|
1058 int yLocation = (*screenHeight) - ((midiFileToDraw[tmpIndex][1] - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1059 ofRect(xLocation,yLocation, duration, noteHeight);
|
andrew@33
|
1060
|
andrew@33
|
1061 }
|
andrew@33
|
1062
|
andrew@33
|
1063
|
andrew@33
|
1064
|
andrew@33
|
1065 }
|
andrew@33
|
1066
|
andrew@33
|
1067
|
andrew@33
|
1068
|
andrew@33
|
1069 }
|
andrew@33
|
1070
|
andrew@33
|
1071
|
andrew@33
|
1072
|
andrew@33
|
1073 void midiEventHolder::drawFile(){
|
andrew@33
|
1074 drawMidiFile();
|
andrew@33
|
1075
|
andrew@34
|
1076 ofSetColor(0,0,255);
|
andrew@34
|
1077 ofDrawBitmapString("period"+ofToString(period, 2), ofGetWidth() - 180, 20);
|
andrew@33
|
1078
|
andrew@33
|
1079 // bayesStruct.drawArrays();
|
andrew@33
|
1080
|
andrew@33
|
1081 // ofSetColor(200,200,0);
|
andrew@33
|
1082 // bayesStruct.prior.drawConstrainedVector(0, bayesStruct.prior.arraySize, 400, 800);
|
andrew@33
|
1083
|
andrew@33
|
1084 //need to draw arrays within correct timescope
|
andrew@33
|
1085 if (drawPhaseMode)
|
andrew@33
|
1086 bayesStruct.drawArraysRelativeToTimeframe(timeOffsetForScreen, timeOffsetForScreen + getEventTimeMillis(ticksPerScreen));
|
andrew@33
|
1087
|
andrew@33
|
1088 if (drawTempoMode)
|
andrew@40
|
1089 bayesStruct.drawTempoArrays();
|
andrew@33
|
1090
|
andrew@33
|
1091
|
andrew@33
|
1092 ofSetColor(0, 0, 0);
|
andrew@33
|
1093 //ofDrawBitmapString(matchString, 20, ofGetHeight() - 20);
|
andrew@33
|
1094
|
andrew@33
|
1095 double confidence = bayesStruct.posterior.getValueAtMillis(mouseX);
|
andrew@33
|
1096 /*
|
andrew@33
|
1097 string mouseString = "mouseX "+ofToString(confidence, 3)+" .";
|
andrew@33
|
1098 ofDrawBitmapString(mouseString, 20 , ofGetHeight() - 40);
|
andrew@33
|
1099
|
andrew@33
|
1100 string mouseString = "updateCounter "+ofToString(bayesStruct.updateCounter);
|
andrew@33
|
1101 ofDrawBitmapString(mouseString, 20 , ofGetHeight() - 40);
|
andrew@33
|
1102
|
andrew@33
|
1103 string infostring = "speed "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate), 3);
|
andrew@33
|
1104 ofDrawBitmapString(infostring, 20 , ofGetHeight() - 60);
|
andrew@33
|
1105 */
|
andrew@33
|
1106
|
andrew@33
|
1107 //drawInterNoteIntervals();
|
andrew@33
|
1108
|
andrew@33
|
1109 }
|
andrew@33
|
1110
|
andrew@33
|
1111 void midiEventHolder::drawInterNoteIntervals(){
|
andrew@33
|
1112
|
andrew@33
|
1113 ofSetColor(0,0,150);
|
andrew@33
|
1114 int size = interNoteIntervals.size();
|
andrew@33
|
1115 int numberToShow = min(100, size);
|
andrew@33
|
1116 double x ;
|
andrew@33
|
1117 for (int y = 1;y < numberToShow;y++){
|
andrew@33
|
1118 for (int point = 0;point < interNoteIntervals[y].size();point++){
|
andrew@33
|
1119 double interval = interNoteIntervals[size - y][point];
|
andrew@33
|
1120 x = interval - 200;
|
andrew@33
|
1121 x *= (*screenWidth) / 200.0;
|
andrew@33
|
1122 }
|
andrew@33
|
1123 double h = (double)(y * (*screenHeight)) / numberToShow;
|
andrew@33
|
1124 ofCircle(x, h, 5);
|
andrew@33
|
1125 }
|
andrew@33
|
1126
|
andrew@33
|
1127 }
|
andrew@33
|
1128
|
andrew@33
|
1129
|
andrew@33
|
1130 void midiEventHolder::printInterNoteIntervals(){
|
andrew@33
|
1131
|
andrew@33
|
1132 int size = interNoteIntervals.size();
|
andrew@33
|
1133 int numberToShow = 20;
|
andrew@33
|
1134 double x ;
|
andrew@33
|
1135 for (int y = max(0, size - numberToShow);y < interNoteIntervals.size();y++){
|
andrew@33
|
1136 for (int point = 0;point < interNoteIntervals[y].size();point++){
|
andrew@33
|
1137 printf("[%i][%i] : %f", y, point, interNoteIntervals[y][point]);
|
andrew@33
|
1138 }
|
andrew@33
|
1139 printf("\n");
|
andrew@33
|
1140 }
|
andrew@33
|
1141
|
andrew@33
|
1142 }
|
andrew@33
|
1143
|
andrew@33
|
1144 int midiEventHolder::getLocationFromTicks(double tickPosition){
|
andrew@34
|
1145 return 0;
|
andrew@34
|
1146 // return (int)((float)(tickPosition - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen);
|
andrew@34
|
1147 //not used
|
andrew@33
|
1148 }
|
andrew@33
|
1149
|
andrew@33
|
1150 int midiEventHolder::getLocationFromMillis(double millisPosition){
|
andrew@33
|
1151 //(getEventTimeTicks(windowStartTime+matchWindowWidth) - numberOfScreensIn*ticksPerScreen)*(*screenWidth) / (double)ticksPerScreen
|
andrew@33
|
1152 return (millisPosition - timeOffsetForScreen)*(*screenWidth)/getEventTimeMillis(ticksPerScreen);
|
andrew@33
|
1153 }
|
andrew@33
|
1154
|
andrew@33
|
1155
|
andrew@33
|
1156 void midiEventHolder::exampleCrossUpdate(){
|
andrew@33
|
1157
|
andrew@33
|
1158 bayesStruct.crossUpdateArrays(bayesStruct.posterior, bayesStruct.relativeSpeedPosterior, 200);
|
andrew@33
|
1159
|
andrew@33
|
1160 }
|
andrew@33
|
1161
|
andrew@33
|
1162
|
andrew@33
|
1163 void midiEventHolder::setStartPlayingTimes(){
|
andrew@34
|
1164 startPlayingTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@34
|
1165 //startTime = startPlayingTime;
|
andrew@42
|
1166 printf("starting playing at time %f\n", startPlayingTime);
|
andrew@33
|
1167 /*
|
andrew@33
|
1168 bayesStruct.lastEventTime = 0;//ofGetElapsedTimeMillis();
|
andrew@33
|
1169 bayesStruct.bestEstimate = 0;
|
andrew@33
|
1170 bayesStruct.resetArrays();
|
andrew@33
|
1171 bayesStruct.lastBestEstimateUpdateTime = ofGetElapsedTimeMillis();
|
andrew@33
|
1172 */
|
andrew@33
|
1173 bayesStruct.setStartPlaying();
|
andrew@33
|
1174 matchString = "";
|
andrew@33
|
1175 }
|
andrew@33
|
1176
|
andrew@33
|
1177
|
andrew@33
|
1178 void midiEventHolder::printMatchMatrix(){
|
andrew@33
|
1179 printf("match matrix:\n");
|
andrew@33
|
1180 for (int i = 0;i < matchMatrix.size();i++){
|
andrew@33
|
1181 for (int k = 0;k < matchMatrix[i].size();k++){
|
andrew@33
|
1182 printf("%i , ", matchMatrix[i][k]);
|
andrew@33
|
1183 }
|
andrew@33
|
1184 printf("\n");
|
andrew@33
|
1185 }
|
andrew@33
|
1186
|
andrew@33
|
1187 }
|
andrew@33
|
1188
|
andrew@33
|
1189
|
andrew@33
|
1190
|
andrew@33
|
1191 void midiEventHolder::printRecordedEvents(){
|
andrew@33
|
1192 printf("Recorded Events:\n");
|
andrew@33
|
1193 for (int i = 0;i < recordedNoteOnMatrix.size();i++){
|
andrew@33
|
1194 for (int k = 0;k < recordedNoteOnMatrix[i].size();k++){
|
andrew@33
|
1195 printf("[%i] = %i ,", i, recordedNoteOnMatrix[i][k]);
|
andrew@33
|
1196 }
|
andrew@33
|
1197 if (i < recordedEventTimes.size())
|
andrew@33
|
1198 printf("time %f \n", recordedEventTimes[i]);
|
andrew@33
|
1199 else
|
andrew@33
|
1200 printf("\n");
|
andrew@33
|
1201 }
|
andrew@33
|
1202
|
andrew@33
|
1203 }
|
andrew@33
|
1204
|
andrew@33
|
1205
|
andrew@33
|
1206
|
andrew@33
|
1207 void midiEventHolder::reorderMatrixFromNoteTimes(IntMatrix& noteOnMatrix){
|
andrew@33
|
1208 double currentTime = -19999.;
|
andrew@33
|
1209 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1210 int nextIndex = getIndexOfMinimumAboveTime(currentTime, noteOnMatrix);
|
andrew@33
|
1211 // cout << "index of min time " << currentTime << " is " << nextIndex << " at time " << noteOnMatrix[nextIndex][0] << endl;
|
andrew@33
|
1212
|
andrew@33
|
1213 if (nextIndex >= 0 && nextIndex > i && noteOnMatrix[nextIndex][0] < noteOnMatrix[i][0] ){
|
andrew@33
|
1214 //which it should be
|
andrew@33
|
1215 // cout << " index " << nextIndex << " at time " << noteOnMatrix[nextIndex][0] << " swaps with inex " << i << " at time " << noteOnMatrix[i][0] << endl;
|
andrew@33
|
1216 noteOnMatrix[i].swap(noteOnMatrix[nextIndex]);
|
andrew@35
|
1217 // double tmp = beatPositions[i];
|
andrew@35
|
1218 // beatPositions[i] = beatPositions[nextIndex];
|
andrew@35
|
1219 // = tmp;
|
andrew@35
|
1220
|
andrew@35
|
1221 swap (beatPositions[i], beatPositions[nextIndex]);
|
andrew@35
|
1222
|
andrew@35
|
1223
|
andrew@33
|
1224 currentTime = noteOnMatrix[i][0];
|
andrew@33
|
1225 }
|
andrew@33
|
1226
|
andrew@33
|
1227 }
|
andrew@33
|
1228 //printRecordedEvents();
|
andrew@33
|
1229
|
andrew@33
|
1230 }
|
andrew@33
|
1231
|
andrew@33
|
1232
|
andrew@33
|
1233
|
andrew@33
|
1234
|
andrew@33
|
1235 void midiEventHolder::doublecheckOrder(IntMatrix& noteOnMatrix){
|
andrew@33
|
1236
|
andrew@33
|
1237 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1238 int nextIndex = getIndexOfMinimumAboveIndex(i, noteOnMatrix);
|
andrew@33
|
1239 if (nextIndex > i){
|
andrew@33
|
1240 noteOnMatrix[i].swap(noteOnMatrix[nextIndex]);
|
andrew@35
|
1241 swap (beatPositions[i], beatPositions[nextIndex]);
|
andrew@35
|
1242
|
andrew@33
|
1243 }
|
andrew@33
|
1244 }
|
andrew@33
|
1245 }
|
andrew@33
|
1246
|
andrew@33
|
1247 int midiEventHolder::getIndexOfMinimumAboveIndex(const int& index, IntMatrix& noteOnMatrix){
|
andrew@33
|
1248 int returnIndex = index;
|
andrew@33
|
1249 int min = noteOnMatrix[index][0];
|
andrew@33
|
1250 for (int i = index;i < noteOnMatrix.size();i++){
|
andrew@33
|
1251 if (noteOnMatrix[i][0] < min){
|
andrew@33
|
1252 returnIndex = i;
|
andrew@33
|
1253 min = noteOnMatrix[i][0];
|
andrew@33
|
1254 }
|
andrew@33
|
1255 }
|
andrew@33
|
1256 return returnIndex;
|
andrew@33
|
1257 }
|
andrew@33
|
1258
|
andrew@33
|
1259
|
andrew@33
|
1260 int midiEventHolder::getIndexOfMinimumAboveTime(const double& time, IntMatrix& noteOnMatrix){
|
andrew@33
|
1261 int index = 0;
|
andrew@33
|
1262 double minimumTime = 100000000.;
|
andrew@33
|
1263 int bestIndex = -1;
|
andrew@33
|
1264 while (index < noteOnMatrix.size()){
|
andrew@33
|
1265
|
andrew@33
|
1266 if (noteOnMatrix[index][0] > time && noteOnMatrix[index][0] < minimumTime){
|
andrew@33
|
1267 bestIndex = index;
|
andrew@33
|
1268 minimumTime = noteOnMatrix[index][0];
|
andrew@33
|
1269 }
|
andrew@33
|
1270 index++;
|
andrew@33
|
1271 }
|
andrew@33
|
1272 return bestIndex;
|
andrew@33
|
1273 }
|
andrew@33
|
1274
|
andrew@33
|
1275
|
andrew@33
|
1276
|
andrew@33
|
1277
|
andrew@33
|
1278 void midiEventHolder::correctTiming(IntMatrix& noteOnMatrix){
|
andrew@33
|
1279
|
andrew@33
|
1280 if (noteOnMatrix.size() > 0 && noteOnMatrix[0][0] < 0) {
|
andrew@33
|
1281 int offset = noteOnMatrix[0][0];
|
andrew@33
|
1282 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1283 noteOnMatrix[i][0] -= offset;
|
andrew@33
|
1284 }
|
andrew@33
|
1285 }
|
andrew@33
|
1286
|
andrew@33
|
1287 }
|
andrew@33
|
1288
|
andrew@33
|
1289
|
andrew@33
|
1290 void midiEventHolder::printNoteCounter(){
|
andrew@33
|
1291 for (int i = 0;i < recordedTotalNoteCounterByPitch.size();i++){
|
andrew@33
|
1292 printf("RECORDED TOTAL[%i] := %i", i, recordedTotalNoteCounterByPitch[i]);
|
andrew@33
|
1293 }
|
andrew@34
|
1294 }
|
andrew@34
|
1295
|
andrew@34
|
1296 /* double timeDiff = 0;//timeDifference;
|
andrew@34
|
1297 if (runningInRealTime)
|
andrew@34
|
1298 timeDiff = ofGetElapsedTimeMillis() - lastSmoothUpdateTime;
|
andrew@34
|
1299 // bayesStruct.lastBestEstimateUpdateTime;
|
andrew@34
|
1300
|
andrew@34
|
1301 //smoothPlayPosition = bayesStruct.bestEstimate + 100;
|
andrew@34
|
1302 //relativeSpeedForSmooth = 0.1;
|
andrew@34
|
1303 //bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate);
|
andrew@34
|
1304 // speedEstimate*2;
|
andrew@34
|
1305
|
andrew@34
|
1306 smoothPlayPosition = storedSmoothPlayPosition + timeDiff * relativeSpeedForSmooth;// * bayesStruct.speedEstimate;
|
andrew@34
|
1307 storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@34
|
1308 lastSmoothUpdateTime = getTimeNow(bayesStruct.lastBestEstimateUpdateTime);
|
andrew@34
|
1309 updateSmoothPlaySpeed();
|
andrew@34
|
1310 //bayesStruct.posterior.getIndexInRealTerms(bayesStruct.posterior.MAPestimate)
|
andrew@34
|
1311
|
andrew@34
|
1312 }
|
andrew@34
|
1313
|
andrew@34
|
1314 void midiEventHolder::updateSmoothPlaySpeed(){
|
andrew@34
|
1315 //project where current play pos will be in two seconds and aim for it.
|
andrew@34
|
1316 double timeToAimForMillis = 2000.0;
|
andrew@34
|
1317 //double timeDiff = ofGetElapsedTimeMillis() - bayesStruct.lastBestEstimateUpdateTime;//since the update need to get to where we are
|
andrew@34
|
1318 double projection = bayesStruct.bestEstimate + bayesStruct.speedEstimate*timeToAimForMillis;//
|
andrew@34
|
1319 double timeDifferenceFromSmooth = projection - smoothPlayPosition;
|
andrew@34
|
1320 relativeSpeedForSmooth = timeDifferenceFromSmooth / timeToAimForMillis;
|
andrew@34
|
1321
|
andrew@34
|
1322 }
|
andrew@34
|
1323 */
|
andrew@35
|
1324
|
andrew@35
|
1325
|
andrew@35
|
1326 /*
|
andrew@35
|
1327 void midiEventHolder::findLocalTempoPairsWeightedForConfidence(){
|
andrew@35
|
1328 bool needToUpdate = false;
|
andrew@35
|
1329
|
andrew@35
|
1330 //adapted this to just use the best match for each note
|
andrew@35
|
1331
|
andrew@35
|
1332 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@35
|
1333 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@35
|
1334 // printMatchesFound();
|
andrew@35
|
1335 // printMatchMatrix();
|
andrew@35
|
1336 // printf("possible notes \n");
|
andrew@35
|
1337
|
andrew@35
|
1338 bayesStruct.setLikelihoodToConstant();
|
andrew@35
|
1339
|
andrew@35
|
1340 for (int i = 0;i < matchMatrix[currentPlayedIndex][0];i++){
|
andrew@35
|
1341
|
andrew@35
|
1342 //iterate through the recently matched events - even dodgy matches included
|
andrew@35
|
1343 //size, index of match0, index of match1, ....
|
andrew@35
|
1344 int recordedCurrentIndex = matchMatrix[currentPlayedIndex][i+1];
|
andrew@35
|
1345
|
andrew@35
|
1346 double currentMatchConfidence = matchConfidence[currentPlayedIndex][i+1];//new confidence
|
andrew@35
|
1347
|
andrew@35
|
1348 int previousIndex = currentPlayedIndex-1;
|
andrew@35
|
1349
|
andrew@35
|
1350 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@35
|
1351 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@35
|
1352
|
andrew@35
|
1353 // for (int k = 0;k < matchMatrix[previousIndex][0];k++)
|
andrew@35
|
1354 int recordedPreviousIndex = bestMatchFound[previousIndex];//matchMatrix[previousIndex][k+1];
|
andrew@35
|
1355
|
andrew@35
|
1356 //double previousMatchConfidence = matchConfidence[previousIndex][k+1];
|
andrew@35
|
1357
|
andrew@35
|
1358
|
andrew@35
|
1359 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@35
|
1360
|
andrew@35
|
1361
|
andrew@35
|
1362 //we want the speed of the recording relative to that of the playing live
|
andrew@35
|
1363
|
andrew@35
|
1364 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@35
|
1365 if (speedRatio <= maximumMatchSpeed && speedRatio >= minimumMatchSpeed){
|
andrew@35
|
1366
|
andrew@35
|
1367 printf("(%i)", matchMatrix[currentPlayedIndex][i+1]);
|
andrew@35
|
1368 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@35
|
1369 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@35
|
1370 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@35
|
1371 printf("update on speed ratio %f\n", speedRatio);
|
andrew@35
|
1372
|
andrew@35
|
1373 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@35
|
1374 // commented for debug
|
andrew@35
|
1375
|
andrew@35
|
1376
|
andrew@35
|
1377 double priorWeighting = 1;
|
andrew@35
|
1378
|
andrew@35
|
1379 if (useTempoPrior)
|
andrew@35
|
1380 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@35
|
1381
|
andrew@35
|
1382
|
andrew@35
|
1383 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@35
|
1384 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/10;
|
andrew@35
|
1385 bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@35
|
1386 tempoSpeedString += ofToString(recordedPreviousIndex) + " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@35
|
1387
|
andrew@35
|
1388 needToUpdate = true;
|
andrew@35
|
1389 }
|
andrew@35
|
1390 // printf("\n");
|
andrew@35
|
1391
|
andrew@35
|
1392
|
andrew@35
|
1393 previousIndex--;
|
andrew@35
|
1394 }//end while previousindex countdown
|
andrew@35
|
1395 }//end for loop through possible current matches
|
andrew@35
|
1396
|
andrew@35
|
1397 if (needToUpdate)
|
andrew@35
|
1398 bayesStruct.updateTempoDistribution();
|
andrew@35
|
1399 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@35
|
1400 }
|
andrew@35
|
1401 */
|
andrew@35
|
1402
|
andrew@42
|
1403 /*
|
andrew@42
|
1404 JUNK SMOOTH StuffHex
|
andrew@42
|
1405 /*
|
andrew@42
|
1406 int testIndex = smoothIndex;
|
andrew@42
|
1407 while (testIndex >= 0 && abs(smoothLocation - myNotation.rwcAnnotations[testIndex].beatLocation) < range){
|
andrew@42
|
1408
|
andrew@42
|
1409 if (myNotation.rwcAnnotations[testIndex].midiNote == currentNote){
|
andrew@42
|
1410 if (abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation) < currentLocationDifference){
|
andrew@42
|
1411 currentLocationDifference = abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation);
|
andrew@42
|
1412 difference = playingTime - (myNotation.rwcAnnotations[testIndex].eventTime*1000.0);
|
andrew@42
|
1413 annotationNote = myNotation.rwcAnnotations[testIndex].midiNote;
|
andrew@42
|
1414 annotationLocation = myNotation.rwcAnnotations[testIndex].beatLocation;
|
andrew@42
|
1415 annotationTime = myNotation.rwcAnnotations[testIndex].eventTime;
|
andrew@42
|
1416 }
|
andrew@42
|
1417 }
|
andrew@42
|
1418 testIndex--;
|
andrew@42
|
1419 }
|
andrew@42
|
1420
|
andrew@42
|
1421 testIndex = smoothIndex;
|
andrew@42
|
1422 while (testIndex >= 0 && testIndex < myNotation.rwcAnnotations.size() && abs(smoothLocation - myNotation.rwcAnnotations[testIndex].beatLocation) < range){
|
andrew@42
|
1423
|
andrew@42
|
1424 if (myNotation.rwcAnnotations[testIndex].midiNote == currentNote){
|
andrew@42
|
1425 if (abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation) < currentLocationDifference){
|
andrew@42
|
1426 currentLocationDifference = abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation);
|
andrew@42
|
1427 difference = playingTime - (myNotation.rwcAnnotations[testIndex].eventTime*1000.0);
|
andrew@42
|
1428 annotationNote = myNotation.rwcAnnotations[testIndex].midiNote;
|
andrew@42
|
1429 annotationLocation = myNotation.rwcAnnotations[testIndex].beatLocation;
|
andrew@42
|
1430 annotationTime = myNotation.rwcAnnotations[testIndex].eventTime;
|
andrew@42
|
1431 }
|
andrew@42
|
1432 }
|
andrew@42
|
1433 testIndex++;
|
andrew@42
|
1434 }
|
andrew@42
|
1435 */
|