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@33
|
349
|
andrew@33
|
350 bayesStruct.likelihood.addGaussianShape(recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset, likelihoodWidth, quantity);//* confidenceMeasure
|
andrew@33
|
351 }//end if
|
andrew@33
|
352 }
|
andrew@33
|
353 bayesStruct.likelihood.addConstant((1-likelihoodToNoiseRatio)/bayesStruct.likelihood.length);
|
andrew@33
|
354 }
|
andrew@33
|
355
|
andrew@33
|
356 int midiEventHolder::findMatch(const int& notePitch, const int& startTime, const int& endTime){
|
andrew@33
|
357
|
andrew@33
|
358 matchesFound.clear();
|
andrew@33
|
359 int startIndex = 0;
|
andrew@33
|
360
|
andrew@33
|
361 if (recordedEventTimes.size() > 0){
|
andrew@33
|
362
|
andrew@33
|
363 //get to the right range of events to check in
|
andrew@33
|
364 while (startIndex < recordedEventTimes.size() && recordedEventTimes[startIndex] < startTime)
|
andrew@33
|
365 startIndex++;
|
andrew@33
|
366
|
andrew@33
|
367 }
|
andrew@33
|
368
|
andrew@33
|
369 IntVector v;
|
andrew@33
|
370 DoubleVector d;
|
andrew@33
|
371 double tmpError = 100000.;//v high error
|
andrew@33
|
372
|
andrew@33
|
373 double minimumConfidence = 0;
|
andrew@33
|
374 while (startIndex < recordedEventTimes.size() && recordedEventTimes[startIndex] < endTime){
|
andrew@33
|
375 if (recordedNoteOnMatrix[startIndex][1] == notePitch){
|
andrew@33
|
376
|
andrew@33
|
377 matchesFound.push_back(startIndex);
|
andrew@33
|
378 v.push_back(startIndex);
|
andrew@33
|
379 //so startIndex is registered as a match
|
andrew@33
|
380
|
andrew@33
|
381 double eventConfidence = bayesStruct.posterior.getValueAtMillis(recordedEventTimes[startIndex]);
|
andrew@33
|
382 if (eventConfidence > minimumConfidence){
|
andrew@33
|
383 minimumConfidence = eventConfidence;
|
andrew@33
|
384 bestMatchIndex = startIndex;
|
andrew@33
|
385 }
|
andrew@33
|
386 d.push_back(eventConfidence);
|
andrew@33
|
387
|
andrew@33
|
388 double confidence = eventConfidence;//bayesStruct.posterior.getValueAtMillis(mouseX);
|
andrew@33
|
389 // recordedEventTimes[startIndex]);
|
andrew@33
|
390 // matchString += "["+ofToString(startIndex)+"] = "+ofToString(confidence, 3)+" .";
|
andrew@33
|
391
|
andrew@33
|
392 if (abs(recordedEventTimes[startIndex] - bayesStruct.bestEstimate) < tmpError){
|
andrew@33
|
393 //record the error between expected and observed times
|
andrew@33
|
394 tmpError = abs(recordedEventTimes[startIndex] - bayesStruct.bestEstimate);
|
andrew@33
|
395 minimumMatchError = tmpError;//recordedEventTimes[startIndex] - bayesStruct.bestEstimate;
|
andrew@33
|
396 }
|
andrew@33
|
397
|
andrew@33
|
398 }
|
andrew@33
|
399 startIndex++;
|
andrew@33
|
400 }
|
andrew@33
|
401
|
andrew@33
|
402
|
andrew@33
|
403 // printf("%i MATCHES TO Note %i found\n", (int)matchesFound.size(), notePitch);
|
andrew@33
|
404 int size = matchesFound.size();
|
andrew@33
|
405 if (size > 0)
|
andrew@33
|
406 noteOnMatches[bestMatchIndex] = true;
|
andrew@33
|
407
|
andrew@33
|
408 v.insert(v.begin() , (int)size);//at beginning, we list how many matches there are that we have found
|
andrew@33
|
409 d.insert(d.begin() , (double)size);
|
andrew@33
|
410
|
andrew@33
|
411 //v.push_back(size);
|
andrew@33
|
412 //d.push_back(size);
|
andrew@33
|
413 //for (int i = 0;i < matchesFound.size()+1;i++){
|
andrew@33
|
414 // v.push_back(matchesFound[i]);
|
andrew@33
|
415 // printf("match %i,[%i] is %i\n", startIndex, i, v[i]);
|
andrew@33
|
416 //}
|
andrew@33
|
417
|
andrew@33
|
418
|
andrew@33
|
419 matchMatrix.push_back(v);
|
andrew@33
|
420 matchConfidence.push_back(d);
|
andrew@33
|
421
|
andrew@33
|
422 //bringing in way to list only the best matches and use these in tempo process
|
andrew@33
|
423 bestMatchFound.push_back(bestMatchIndex);
|
andrew@33
|
424
|
andrew@33
|
425 // 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
|
426
|
andrew@33
|
427 return size;
|
andrew@33
|
428 }
|
andrew@33
|
429
|
andrew@33
|
430 bool midiEventHolder::checkIfMatchedNote(const int& tmpIndex){
|
andrew@33
|
431 for (int i = 0;i < matchesFound.size();i++){
|
andrew@33
|
432 if (matchesFound[i] == tmpIndex)
|
andrew@33
|
433 return true;
|
andrew@33
|
434 }
|
andrew@33
|
435 return false;
|
andrew@33
|
436 }
|
andrew@33
|
437
|
andrew@33
|
438
|
andrew@33
|
439
|
andrew@33
|
440 void midiEventHolder::findLocalTempoPairs(){
|
andrew@33
|
441
|
andrew@33
|
442 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
443 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@33
|
444 // printMatchesFound();
|
andrew@33
|
445 // printMatchMatrix();
|
andrew@33
|
446 // printf("possible notes \n");
|
andrew@33
|
447 bool needToUpdate = false;
|
andrew@33
|
448 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
449
|
andrew@33
|
450
|
andrew@33
|
451 for (int i = 0;i < matchMatrix[currentPlayedIndex][0];i++){
|
andrew@33
|
452 //iterate through the recently matched events - even dodgy matches included
|
andrew@33
|
453 //size, index of match0, index of match1, ....
|
andrew@33
|
454
|
andrew@33
|
455
|
andrew@33
|
456 int recordedCurrentIndex = matchMatrix[currentPlayedIndex][i+1];
|
andrew@33
|
457
|
andrew@33
|
458 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
459
|
andrew@33
|
460
|
andrew@33
|
461 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
462 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
463
|
andrew@33
|
464 for (int k = 0;k < matchMatrix[previousIndex][0];k++){
|
andrew@33
|
465
|
andrew@33
|
466 int recordedPreviousIndex = matchMatrix[previousIndex][k+1];
|
andrew@33
|
467
|
andrew@33
|
468 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
469
|
andrew@33
|
470
|
andrew@33
|
471 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
472
|
andrew@33
|
473 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
474 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate &&
|
andrew@33
|
475 speedRatio <= maximumMatchSpeed && speedRatio >= minimumMatchSpeed){
|
andrew@33
|
476
|
andrew@33
|
477 //adding in a prior that prefers 1
|
andrew@33
|
478 double priorWeighting = 1;
|
andrew@33
|
479 if (useTempoPrior)
|
andrew@33
|
480 priorWeighting = sin(speedRatio * PI/2);
|
andrew@33
|
481
|
andrew@33
|
482
|
andrew@33
|
483
|
andrew@33
|
484 /*
|
andrew@33
|
485 printf("(%i)", matchMatrix[currentPlayedIndex][i+1]);
|
andrew@33
|
486 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
487 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
488 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
489 */
|
andrew@33
|
490 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
491 // commented for debug
|
andrew@33
|
492
|
andrew@33
|
493 //bayesStruct.updateTempoDistribution(speedRatio, 0.1);//second paramter is confidence in the match
|
andrew@33
|
494 double amount = (1-bayesStruct.speedLikelihoodNoise)/10;
|
andrew@33
|
495 amount *= priorWeighting;
|
andrew@33
|
496 bayesStruct.updateTempoLikelihood(speedRatio, amount);
|
andrew@33
|
497 // tempoSpeedString += ofToString(recordedPreviousIndex) + " "+ ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
498 needToUpdate = true;
|
andrew@33
|
499 }
|
andrew@33
|
500 // printf("\n");
|
andrew@33
|
501 }
|
andrew@33
|
502
|
andrew@33
|
503 previousIndex--;
|
andrew@33
|
504 }//end while previousindex countdown
|
andrew@33
|
505 }//end for loop through possible current matches
|
andrew@33
|
506
|
andrew@33
|
507 if (needToUpdate)
|
andrew@33
|
508 bayesStruct.updateTempoDistribution();
|
andrew@33
|
509
|
andrew@33
|
510 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
511 }
|
andrew@33
|
512
|
andrew@33
|
513
|
andrew@33
|
514 void midiEventHolder::findLocalTempoPairsWeightedForConfidence(){
|
andrew@33
|
515 bool needToUpdate = false;
|
andrew@33
|
516
|
andrew@33
|
517 DoubleVector speedIntervalsFound;
|
andrew@33
|
518
|
andrew@33
|
519 //adapted this to just use the best match for each note
|
andrew@33
|
520
|
andrew@33
|
521 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
522 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@33
|
523 // printMatchesFound();
|
andrew@33
|
524 // printMatchMatrix();
|
andrew@33
|
525 // printf("possible notes \n");
|
andrew@33
|
526
|
andrew@33
|
527 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
528
|
andrew@33
|
529 int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
530 //we only look at intervals between the current best match and other recent best matched notes
|
andrew@33
|
531 //that is the difference in confidence method
|
andrew@33
|
532
|
andrew@33
|
533
|
andrew@33
|
534 //printf("BEST MATCH FOUND for index %i is %i ", currentPlayedIndex, bestMatchFound[currentPlayedIndex]);
|
andrew@33
|
535
|
andrew@33
|
536 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
537
|
andrew@33
|
538 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
539 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
540 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
541
|
andrew@33
|
542 int recordedPreviousIndex = bestMatchFound[previousIndex];
|
andrew@33
|
543
|
andrew@33
|
544 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
545
|
andrew@33
|
546
|
andrew@33
|
547 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
548
|
andrew@33
|
549 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
550 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate
|
andrew@33
|
551 && speedRatio < maximumMatchSpeed && speedRatio > minimumMatchSpeed){
|
andrew@33
|
552
|
andrew@33
|
553 /* printf("(%i)", previousIndex);
|
andrew@33
|
554 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
555 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@33
|
556 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
557 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
558 */
|
andrew@33
|
559 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
560 // commented for debug
|
andrew@33
|
561
|
andrew@33
|
562
|
andrew@33
|
563 double priorWeighting = 1;
|
andrew@33
|
564
|
andrew@33
|
565 if (useTempoPrior)
|
andrew@33
|
566 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@33
|
567
|
andrew@33
|
568
|
andrew@33
|
569 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@33
|
570 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/16;//was 9
|
andrew@33
|
571
|
andrew@33
|
572 speedIntervalsFound.push_back(speedRatio);
|
andrew@33
|
573 // bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@33
|
574
|
andrew@33
|
575 // tempoSpeedString += ofToString(recordedCurrentIndex) + " :: " + ofToString(recordedPreviousIndex);
|
andrew@33
|
576 // tempoSpeedString += " " + ofToString(recordedTimeDifference)+ " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
577
|
andrew@33
|
578 needToUpdate = true;
|
andrew@33
|
579 }
|
andrew@33
|
580 // printf("\n");
|
andrew@33
|
581
|
andrew@33
|
582
|
andrew@33
|
583 previousIndex--;
|
andrew@33
|
584 }//end while previousindex countdown
|
andrew@33
|
585
|
andrew@33
|
586 if (speedIntervalsFound.size() > 0){
|
andrew@33
|
587 double amount = (1 - bayesStruct.speedLikelihoodNoise) / speedIntervalsFound.size();
|
andrew@33
|
588 for (int i = 0;i < speedIntervalsFound.size();i++)
|
andrew@33
|
589 bayesStruct.updateTempoLikelihood(speedIntervalsFound[i], amount);
|
andrew@33
|
590 }
|
andrew@33
|
591
|
andrew@33
|
592
|
andrew@33
|
593 if (needToUpdate)
|
andrew@33
|
594 bayesStruct.updateTempoDistribution();
|
andrew@33
|
595 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
596 }
|
andrew@33
|
597
|
andrew@33
|
598 double midiEventHolder::getBestSpeedEstimate(const int& currentPlayedIndex, const int& equivalentRecordedIndex){
|
andrew@33
|
599 double estimate = 1.0;
|
andrew@33
|
600 if (bestMatchIndex > 0){
|
andrew@33
|
601 double accordingToFileLengthEstimate = recordedEventTimes[equivalentRecordedIndex] - recordedEventTimes[0];
|
andrew@33
|
602 double playedEquivalent = (playedEventTimes[currentPlayedIndex] - playedEventTimes[0]);
|
andrew@33
|
603 if (accordingToFileLengthEstimate > 0 && playedEquivalent > 0)
|
andrew@33
|
604 accordingToFileLengthEstimate /= playedEquivalent;
|
andrew@33
|
605 estimate = accordingToFileLengthEstimate;
|
andrew@33
|
606 }
|
andrew@33
|
607 return estimate;
|
andrew@33
|
608 }
|
andrew@33
|
609
|
andrew@33
|
610 void midiEventHolder::findOptimumTempoPairsToCurrentBestMatch(){
|
andrew@33
|
611 bool needToUpdate = false;
|
andrew@33
|
612
|
andrew@33
|
613 DoubleVector speedIntervalsFound;
|
andrew@33
|
614
|
andrew@33
|
615 double currentSpeedEstimate = bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate);
|
andrew@33
|
616
|
andrew@33
|
617 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
618
|
andrew@33
|
619 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
620
|
andrew@33
|
621 int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
622 //we only look at intervals between the current best match and other recent best matched notes
|
andrew@33
|
623
|
andrew@33
|
624 //printf("BEST MATCH FOUND for index %i is %i ", currentPlayedIndex, bestMatchFound[currentPlayedIndex]);
|
andrew@33
|
625
|
andrew@33
|
626 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
627
|
andrew@33
|
628 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
629 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
630
|
andrew@33
|
631 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
632
|
andrew@33
|
633 int recordedPreviousIndex = bestMatchFound[previousIndex];
|
andrew@33
|
634
|
andrew@33
|
635 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
636
|
andrew@33
|
637 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
638 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
639
|
andrew@33
|
640 //now check if this can be closer the observed value
|
andrew@33
|
641 int checkRecordedCurrentIndex = recordedCurrentIndex;
|
andrew@33
|
642 int checkRecordedPreviousIndex ;//= recordedCurrentIndex;
|
andrew@33
|
643 int currentPlayedPitch = playedNoteOnMatrix[currentPlayedIndex][1];
|
andrew@33
|
644 int previousPlayedPitch = playedNoteOnMatrix[previousIndex][1];
|
andrew@33
|
645
|
andrew@33
|
646 double recordedTimeOfBestMatch = recordedEventTimes[recordedCurrentIndex];
|
andrew@33
|
647
|
andrew@33
|
648 //change this so we start first in window and go to end
|
andrew@33
|
649
|
andrew@33
|
650 while (checkRecordedCurrentIndex >= 0 && recordedEventTimes[checkRecordedCurrentIndex] > recordedTimeOfBestMatch - matchWindowWidth){
|
andrew@33
|
651
|
andrew@33
|
652 checkRecordedCurrentIndex--;
|
andrew@33
|
653 }
|
andrew@33
|
654
|
andrew@33
|
655 double bestSpeedEstimate = getBestSpeedEstimate(currentPlayedIndex, bestMatchIndex);
|
andrew@33
|
656
|
andrew@33
|
657 while (checkRecordedCurrentIndex < recordedEventTimes.size() && recordedEventTimes[checkRecordedCurrentIndex] < recordedTimeOfBestMatch + matchWindowWidth ){
|
andrew@33
|
658 if (recordedNoteOnMatrix[checkRecordedCurrentIndex][1] == currentPlayedPitch ){
|
andrew@33
|
659 checkRecordedPreviousIndex = checkRecordedCurrentIndex;
|
andrew@33
|
660 double recordedTimeCurrent = recordedEventTimes[checkRecordedCurrentIndex] ;
|
andrew@33
|
661 while (checkRecordedPreviousIndex >= 0 && recordedEventTimes[checkRecordedPreviousIndex] + maximumMatchSpeed*playedTimeDifference > recordedTimeCurrent ) {
|
andrew@33
|
662 if (recordedNoteOnMatrix[checkRecordedPreviousIndex][1] == previousPlayedPitch){
|
andrew@33
|
663 //we have a candidate
|
andrew@33
|
664 double speedToTest = recordedEventTimes[checkRecordedCurrentIndex] - recordedEventTimes[checkRecordedPreviousIndex];
|
andrew@33
|
665 speedToTest /= playedTimeDifference;
|
andrew@33
|
666 if (abs(speedToTest-currentSpeedEstimate) < abs(speedRatio - currentSpeedEstimate) ){
|
andrew@33
|
667 speedRatio = speedToTest;
|
andrew@33
|
668 }
|
andrew@33
|
669 }
|
andrew@33
|
670 checkRecordedPreviousIndex--;
|
andrew@33
|
671 }
|
andrew@33
|
672 }
|
andrew@33
|
673 checkRecordedCurrentIndex++;
|
andrew@33
|
674 }
|
andrew@33
|
675
|
andrew@33
|
676
|
andrew@33
|
677 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate
|
andrew@33
|
678 && speedRatio < maximumMatchSpeed && speedRatio > minimumMatchSpeed){
|
andrew@33
|
679
|
andrew@33
|
680 /* printf("(%i)", previousIndex);
|
andrew@33
|
681 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
682 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@33
|
683 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
684 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
685 */
|
andrew@33
|
686 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
687 // commented for debug
|
andrew@33
|
688
|
andrew@33
|
689
|
andrew@33
|
690 double priorWeighting = 1;
|
andrew@33
|
691
|
andrew@33
|
692 if (useTempoPrior)
|
andrew@33
|
693 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@33
|
694
|
andrew@33
|
695
|
andrew@33
|
696 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@33
|
697 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/16;//was 9
|
andrew@33
|
698
|
andrew@33
|
699 speedIntervalsFound.push_back(speedRatio);
|
andrew@33
|
700 // bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@33
|
701
|
andrew@33
|
702 // tempoSpeedString += ofToString(recordedCurrentIndex) + " :: " + ofToString(recordedPreviousIndex);
|
andrew@33
|
703 // tempoSpeedString += " " + ofToString(recordedTimeDifference)+ " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
704
|
andrew@33
|
705 needToUpdate = true;
|
andrew@33
|
706 }
|
andrew@33
|
707 // printf("\n");
|
andrew@33
|
708
|
andrew@33
|
709
|
andrew@33
|
710 previousIndex--;
|
andrew@33
|
711 }//end while previousindex countdown
|
andrew@33
|
712
|
andrew@33
|
713 if (speedIntervalsFound.size() > 0){
|
andrew@33
|
714 double amount = (1 - bayesStruct.speedLikelihoodNoise) / speedIntervalsFound.size();
|
andrew@33
|
715 for (int i = 0;i < speedIntervalsFound.size();i++)
|
andrew@33
|
716 bayesStruct.updateTempoLikelihood(speedIntervalsFound[i], amount);
|
andrew@33
|
717 }
|
andrew@33
|
718
|
andrew@33
|
719
|
andrew@33
|
720 if (needToUpdate)
|
andrew@33
|
721 bayesStruct.updateTempoDistribution();
|
andrew@33
|
722 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
723 }
|
andrew@33
|
724
|
andrew@33
|
725
|
andrew@33
|
726 void midiEventHolder::calcuateNewInterNoteIntervals(){
|
andrew@33
|
727 DoubleVector v;
|
andrew@33
|
728
|
andrew@33
|
729 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
730 // int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
731 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
732
|
andrew@33
|
733 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
734 while (previousIndex >= 0 && playedEventTimes[previousIndex] + interNoteRange > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
735
|
andrew@33
|
736 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
737
|
andrew@33
|
738 checkForCorrectInterval(playedTimeDifference, &v);
|
andrew@33
|
739
|
andrew@33
|
740 previousIndex--;
|
andrew@33
|
741 }
|
andrew@33
|
742
|
andrew@33
|
743 if (v.size() > 0)
|
andrew@33
|
744 interNoteIntervals.push_back(v);
|
andrew@33
|
745 //printf("\n");
|
andrew@33
|
746 }
|
andrew@33
|
747
|
andrew@33
|
748 void midiEventHolder::checkForCorrectInterval(const double& playedTimeDifference, DoubleVector* v){
|
andrew@33
|
749 double intervalDuration = 0.0;
|
andrew@33
|
750
|
andrew@33
|
751 for (int intervalIndex = 0;intervalIndex < 3;intervalIndex++){
|
andrew@33
|
752 //on;y check 1,2 and 4
|
andrew@33
|
753 double possibleDuration = playedTimeDifference / intervalsToCheck[intervalIndex];
|
andrew@33
|
754 if (possibleDuration >= 200 && possibleDuration < 400){
|
andrew@33
|
755 v->push_back(possibleDuration);
|
andrew@33
|
756 // printf("int %f / %i :: %f ", playedTimeDifference, intervalsToCheck[intervalIndex], possibleDuration);
|
andrew@33
|
757 }
|
andrew@33
|
758 }
|
andrew@33
|
759 }
|
andrew@33
|
760
|
andrew@33
|
761
|
andrew@33
|
762 void midiEventHolder::updatePlayPosition(){
|
andrew@34
|
763 //timeDifference = ofGetElapsedTimeMillis() - startPlayingTime;//elpased
|
andrew@33
|
764
|
andrew@33
|
765 //in actual fact if we are changing the speed of the play position
|
andrew@33
|
766 //we will need to update this via the file
|
andrew@33
|
767
|
andrew@33
|
768 //actually time since beginning of file i think
|
andrew@33
|
769
|
andrew@33
|
770 double timeDifference = 0;
|
andrew@34
|
771
|
andrew@34
|
772 if (runningInRealTime){
|
andrew@34
|
773
|
andrew@34
|
774 bayesStruct.updateBestEstimate(timeDifference);
|
andrew@34
|
775 // bayesStruct.updateTmpBestEstimate(timeDifference);
|
andrew@34
|
776 }
|
andrew@34
|
777
|
andrew@35
|
778
|
andrew@35
|
779
|
andrew@35
|
780 if (smoothPlayPosition < bayesStruct.bestEstimate){
|
andrew@35
|
781 updateSmoothPositionTo(bayesStruct.bestEstimate);
|
andrew@35
|
782 //smoothPlayPosition = bayesStruct.bestEstimate;
|
andrew@35
|
783 }
|
andrew@34
|
784
|
andrew@34
|
785 // playPositionInMillis = timeDifference;//based on updating from when we change period
|
andrew@34
|
786 //this to be added
|
andrew@34
|
787
|
andrew@33
|
788
|
andrew@33
|
789 //this is time diff in milliseconds
|
andrew@33
|
790 //then we have
|
andrew@33
|
791 double quarterNoteIntervals = (timeDifference / period);
|
andrew@33
|
792 tickLocation = quarterNoteIntervals * pulsesPerQuarternote;
|
andrew@33
|
793
|
andrew@33
|
794 updateNoteCounter();
|
andrew@33
|
795
|
andrew@33
|
796 }
|
andrew@33
|
797
|
andrew@35
|
798 void midiEventHolder::updateSmoothPositionTo(const double& newPosition){
|
andrew@42
|
799 //smooth play position was where we last outputted notes from.
|
andrew@42
|
800 //checking index is there to make sense.
|
andrew@35
|
801 while (smoothIndex > 0 && recordedEventTimes[smoothIndex] > smoothPlayPosition){
|
andrew@35
|
802 smoothIndex--;
|
andrew@42
|
803 //printf("going backewaers on smooth, ");
|
andrew@35
|
804 }
|
andrew@35
|
805 while (smoothIndex < recordedEventTimes.size()-1 && recordedEventTimes[smoothIndex] < smoothPlayPosition){
|
andrew@35
|
806 smoothIndex++;
|
andrew@42
|
807 //printf("outputting smooth\n ");
|
andrew@35
|
808 }
|
andrew@35
|
809
|
andrew@35
|
810
|
andrew@35
|
811 double playingTime = ofGetElapsedTimeMillis();
|
andrew@35
|
812 playingTime -= startPlayingTime;
|
andrew@35
|
813 //now at the last one
|
andrew@35
|
814
|
andrew@39
|
815 float smoothLocation = beatPositions[smoothIndex];
|
andrew@39
|
816 int currentNote = recordedNoteOnMatrix[smoothIndex][1];
|
andrew@36
|
817
|
andrew@35
|
818 while (smoothIndex < recordedEventTimes.size() && recordedEventTimes[smoothIndex] < newPosition){
|
andrew@36
|
819 float annotationTime = 0;
|
andrew@38
|
820 float annotationLocation = 0;
|
andrew@42
|
821 int annotationTick = 0;
|
andrew@36
|
822 int annotationNote = 0;
|
andrew@39
|
823 float difference = 10000;//very big
|
andrew@39
|
824 float currentLocationDifference = 1.0;
|
andrew@39
|
825 float range = 1.0;
|
andrew@36
|
826 if (smoothIndex < myNotation.rwcAnnotations.size()){
|
andrew@39
|
827 //add in test here to find closest matching note
|
andrew@39
|
828
|
andrew@42
|
829
|
andrew@36
|
830 annotationTime = myNotation.rwcAnnotations[smoothIndex].eventTime;
|
andrew@36
|
831 annotationNote = myNotation.rwcAnnotations[smoothIndex].midiNote;
|
andrew@38
|
832 annotationLocation = myNotation.rwcAnnotations[smoothIndex].beatLocation;
|
andrew@42
|
833 annotationTick = round(annotationLocation*480.0);
|
andrew@42
|
834 }else{
|
andrew@42
|
835 printf("No annotaion size %i\n", (int)myNotation.rwcAnnotations.size());
|
andrew@36
|
836 }
|
andrew@36
|
837
|
andrew@39
|
838 difference = playingTime - (annotationTime*1000.0);
|
andrew@36
|
839
|
andrew@35
|
840 if ((*fileOutput).is_open()){
|
andrew@36
|
841 (*fileOutput) << fixed << beatPositions[smoothIndex] <<",\t" << recordedNoteOnMatrix[smoothIndex][1] << ",\t";
|
andrew@36
|
842 (*fileOutput) << playingTime ;
|
andrew@37
|
843
|
andrew@36
|
844 if ( recordedNoteOnMatrix[smoothIndex][1] == annotationNote){
|
andrew@36
|
845 (*fileOutput) << " corresponds to " << annotationTime;
|
andrew@36
|
846 }
|
andrew@36
|
847 (*fileOutput) << " \n";
|
andrew@36
|
848
|
andrew@38
|
849
|
andrew@37
|
850
|
andrew@37
|
851 }
|
andrew@37
|
852
|
andrew@42
|
853 printf("assert 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
|
854 recordedNoteOnMatrix[smoothIndex][0], annotationTick, recordedNoteOnMatrix[smoothIndex][1],
|
andrew@42
|
855 beatPositions[smoothIndex], playingTime,
|
andrew@42
|
856 annotationNote, annotationLocation, annotationTime, difference);
|
andrew@42
|
857
|
andrew@42
|
858 // assert(annotationNote == recordedNoteOnMatrix[smoothIndex][1]);
|
andrew@42
|
859 assert(annotationTick == recordedNoteOnMatrix[smoothIndex][0]);
|
andrew@42
|
860
|
andrew@42
|
861
|
andrew@37
|
862 if ((*differenceOutput).is_open()){
|
andrew@37
|
863 (*differenceOutput) << beatPositions[smoothIndex] << "," << difference << "\n";
|
andrew@42
|
864 // printf("midi %i beat pos %f playing time now at %f :: annotaion %i loc % f time %f diff \t%f ms\n",
|
andrew@42
|
865 // recordedNoteOnMatrix[smoothIndex][1],
|
andrew@42
|
866 // beatPositions[smoothIndex], playingTime,
|
andrew@42
|
867 // annotationNote, annotationLocation, annotationTime, difference);
|
andrew@42
|
868 }else{
|
andrew@42
|
869 printf("file not open\n");
|
andrew@35
|
870 }
|
andrew@35
|
871
|
andrew@35
|
872 smoothIndex++;
|
andrew@35
|
873 }
|
andrew@35
|
874
|
andrew@35
|
875
|
andrew@35
|
876 smoothPlayPosition = newPosition;
|
andrew@35
|
877
|
andrew@35
|
878 }
|
andrew@35
|
879
|
andrew@34
|
880
|
andrew@34
|
881 void midiEventHolder::updatePeriodValue(const double& millis){
|
andrew@34
|
882
|
andrew@34
|
883 double tmp = period;
|
andrew@34
|
884 /*
|
andrew@34
|
885 while (periodCounter >= 0 && periodCounter < periodValues.size()-1 && periodValues[periodCounter][2] < millis){
|
andrew@34
|
886 periodCounter++;
|
andrew@34
|
887 }
|
andrew@34
|
888 while (periodCounter > 0 && periodValues[periodCounter][2] > millis){
|
andrew@34
|
889 periodCounter--;
|
andrew@34
|
890 }
|
andrew@34
|
891 */
|
andrew@34
|
892 //period = periodValues[periodCounter][1];
|
andrew@34
|
893
|
andrew@34
|
894 if (period != tmp){
|
andrew@34
|
895 printf("new period at %f of %f\n", millis, period);
|
andrew@34
|
896 }
|
andrew@34
|
897 }
|
andrew@34
|
898
|
andrew@33
|
899 void midiEventHolder::updateNoteCounter(){
|
andrew@33
|
900 while (totalNoteCounterIndex < bestMatchIndex){
|
andrew@33
|
901 int tmpPitch = recordedNoteOnMatrix[totalNoteCounterIndex][1];
|
andrew@33
|
902 recordedTotalNoteCounterByPitch[tmpPitch] += 1;
|
andrew@33
|
903 totalNoteCounterIndex++;
|
andrew@33
|
904 }
|
andrew@33
|
905 }
|
andrew@33
|
906
|
andrew@33
|
907
|
andrew@33
|
908 void midiEventHolder::drawMidiFile(){
|
andrew@33
|
909
|
andrew@33
|
910 //draws midi file on scrolling screen
|
andrew@33
|
911 int size = recordedNoteOnMatrix.size();
|
andrew@33
|
912 if (size > 0){
|
andrew@33
|
913
|
andrew@33
|
914 numberOfScreensIn = floor(bayesStruct.bestEstimate / getEventTimeMillis(ticksPerScreen));//rpounds down on no screens in
|
andrew@33
|
915
|
andrew@33
|
916 // numberOfScreensIn = tickLocation / ticksPerScreen;//rounds down
|
andrew@33
|
917 timeOffsetForScreen = getEventTimeMillis(numberOfScreensIn * ticksPerScreen);
|
andrew@33
|
918
|
andrew@33
|
919 while (noteArrayIndex < recordedNoteOnMatrix.size()-1 && tickLocation > recordedNoteOnMatrix[noteArrayIndex][0] )
|
andrew@33
|
920 noteArrayIndex++;
|
andrew@33
|
921
|
andrew@33
|
922
|
andrew@33
|
923 while (noteArrayIndex > 0 && noteArrayIndex < size && tickLocation < recordedNoteOnMatrix[noteArrayIndex][0])
|
andrew@33
|
924 noteArrayIndex--;
|
andrew@33
|
925
|
andrew@33
|
926 //need to start where we currently are in file
|
andrew@33
|
927 int maxNoteIndexToPrint = noteArrayIndex;
|
andrew@33
|
928 int minNoteIndexToPrint = min(size-1,noteArrayIndex);//not needed as changed above
|
andrew@33
|
929
|
andrew@33
|
930 while (maxNoteIndexToPrint < recordedNoteOnMatrix.size() && recordedNoteOnMatrix[maxNoteIndexToPrint][0] < (numberOfScreensIn+1)*ticksPerScreen )
|
andrew@33
|
931 maxNoteIndexToPrint++;
|
andrew@33
|
932
|
andrew@33
|
933 while (minNoteIndexToPrint > 0 && recordedNoteOnMatrix[minNoteIndexToPrint][0] > numberOfScreensIn*ticksPerScreen)//&& minNoteIndexToPrint < size
|
andrew@33
|
934 minNoteIndexToPrint--;
|
andrew@33
|
935
|
andrew@33
|
936 for (int tmpIndex = max(0,minNoteIndexToPrint);tmpIndex < min(maxNoteIndexToPrint, (int)recordedNoteOnMatrix.size());tmpIndex++){
|
andrew@33
|
937
|
andrew@33
|
938 ofSetColor(255,255,255);
|
andrew@33
|
939 if (checkIfMatchedNote(tmpIndex))
|
andrew@33
|
940 ofSetColor(100,100,100);//0,0,255);
|
andrew@33
|
941 else if(noteOnMatches[tmpIndex]){
|
andrew@33
|
942 ofSetColor(255,0,255);//dark grey
|
andrew@33
|
943 }
|
andrew@33
|
944 else{
|
andrew@33
|
945 ofSetColor(255,255,255);//255,255,255);
|
andrew@33
|
946 }
|
andrew@33
|
947
|
andrew@33
|
948 //ofSetColor(255,255,255);
|
andrew@33
|
949 if (tmpIndex == bestMatchIndex)
|
andrew@33
|
950 ofSetColor(255,0,0);//best recent match is in red
|
andrew@33
|
951
|
andrew@33
|
952 // XXX replace ofgetwidth below
|
andrew@33
|
953 //if (tmpIndex >= 0 && tmpIndex < size)
|
andrew@33
|
954 int xLocation = (float)(recordedNoteOnMatrix[tmpIndex][0] - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
955 int duration = (float)(recordedNoteOnMatrix[tmpIndex][3]*(*screenWidth))/(float)ticksPerScreen;
|
andrew@33
|
956
|
andrew@33
|
957
|
andrew@33
|
958 int yLocation = (*screenHeight) - ((recordedNoteOnMatrix[tmpIndex][1] - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
959 ofRect(xLocation,yLocation, duration, noteHeight);
|
andrew@33
|
960
|
andrew@33
|
961 }
|
andrew@33
|
962
|
andrew@33
|
963
|
andrew@33
|
964 int xLocation;// = getLocationFromTicks(tickLocation);
|
andrew@33
|
965 // ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
966
|
andrew@33
|
967 //orange line at best estimate
|
andrew@33
|
968 xLocation = getLocationFromMillis(bayesStruct.bestEstimate);
|
andrew@34
|
969 ofSetColor(250,250,20);//250,100,0);
|
andrew@33
|
970 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
971
|
andrew@34
|
972 xLocation = getLocationFromMillis(smoothPlayPosition);//bayesStruct.tmpBestEstimate
|
andrew@34
|
973 ofSetColor(0,250,0);//250,150, 250,100,0);
|
andrew@33
|
974 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
975
|
andrew@33
|
976
|
andrew@33
|
977 //lines where matching window start and end are
|
andrew@33
|
978 ofSetColor(0);//0,100,255);
|
andrew@33
|
979 xLocation = getLocationFromMillis(windowStartTime);
|
andrew@33
|
980 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
981 xLocation = getLocationFromMillis(windowStartTime+matchWindowWidth);
|
andrew@33
|
982 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
983
|
andrew@33
|
984
|
andrew@33
|
985 int maxSize = recordedNoteOnMatrix[size-1][0];
|
andrew@33
|
986
|
andrew@33
|
987 int tmpIndex = 0;
|
andrew@33
|
988 while (tmpIndex < measureVector.size() && measureVector[tmpIndex] < (numberOfScreensIn+1)*ticksPerScreen){
|
andrew@33
|
989 int measureLocation = measureVector[tmpIndex];
|
andrew@33
|
990 int xLocation = (float)(measureLocation - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
991 ofSetColor(155,155,0);
|
andrew@33
|
992 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
993 tmpIndex++;
|
andrew@33
|
994 }
|
andrew@33
|
995
|
andrew@33
|
996
|
andrew@33
|
997 // ofDrawBitmapString(tempoSpeedString, 20, 20);
|
andrew@33
|
998 /* string indexString = "num screens in "+ofToString(numberOfScreensIn)+"; min index to print "+ofToString(minNoteIndexToPrint)+", max index to print "+ofToString(maxNoteIndexToPrint);
|
andrew@33
|
999 indexString += " size "+ofToString(size)+" tick loc "+ofToString(tickLocation)+" max size "+ofToString(maxSize);
|
andrew@33
|
1000 ofDrawBitmapString(indexString, 20, 40);
|
andrew@33
|
1001 */
|
andrew@33
|
1002 }
|
andrew@33
|
1003
|
andrew@33
|
1004 //ofDrawBitmapString(ofToString(timeOffsetForScreen, 1), 20,20);
|
andrew@33
|
1005
|
andrew@33
|
1006 //ofDrawBitmapString(timeString, 20, 60);
|
andrew@33
|
1007
|
andrew@33
|
1008 //last played piutch
|
andrew@33
|
1009 ofSetColor(0,200,0,50);
|
andrew@33
|
1010 int yLocation = (*screenHeight) - ((lastPlayedPitch - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1011 ofRect(0,yLocation, 100, noteHeight);
|
andrew@33
|
1012
|
andrew@33
|
1013
|
andrew@33
|
1014
|
andrew@33
|
1015 }
|
andrew@33
|
1016
|
andrew@33
|
1017
|
andrew@33
|
1018
|
andrew@33
|
1019 void midiEventHolder::drawMidiFile(IntMatrix& midiFileToDraw){
|
andrew@33
|
1020
|
andrew@33
|
1021 //using this to draw the live input
|
andrew@33
|
1022
|
andrew@33
|
1023 //draws midi file on scrolling screen
|
andrew@33
|
1024 int size = midiFileToDraw.size();
|
andrew@33
|
1025 if (size > 0){
|
andrew@33
|
1026
|
andrew@33
|
1027 numberOfScreensIn = floor(bayesStruct.bestEstimate / getEventTimeMillis(ticksPerScreen));//rpounds down on no screens in
|
andrew@33
|
1028
|
andrew@33
|
1029 // numberOfScreensIn = tickLocation / ticksPerScreen;//rounds down
|
andrew@33
|
1030 timeOffsetForScreen = getEventTimeMillis(numberOfScreensIn * ticksPerScreen);
|
andrew@33
|
1031
|
andrew@33
|
1032 while (noteArrayIndex < midiFileToDraw.size()-1 && tickLocation > midiFileToDraw[noteArrayIndex][0] )
|
andrew@33
|
1033 noteArrayIndex++;
|
andrew@33
|
1034
|
andrew@33
|
1035
|
andrew@33
|
1036 while (noteArrayIndex > 0 && noteArrayIndex < size && tickLocation < midiFileToDraw[noteArrayIndex][0])
|
andrew@33
|
1037 noteArrayIndex--;
|
andrew@33
|
1038
|
andrew@33
|
1039 //need to start where we currently are in file
|
andrew@33
|
1040 int maxNoteIndexToPrint = noteArrayIndex;
|
andrew@33
|
1041 int minNoteIndexToPrint = min(size-1,noteArrayIndex);//not needed as changed above
|
andrew@33
|
1042
|
andrew@33
|
1043 while (maxNoteIndexToPrint < midiFileToDraw.size() && midiFileToDraw[maxNoteIndexToPrint][0] < (numberOfScreensIn+1)*ticksPerScreen )
|
andrew@33
|
1044 maxNoteIndexToPrint++;
|
andrew@33
|
1045
|
andrew@33
|
1046 while (minNoteIndexToPrint > 0 && midiFileToDraw[minNoteIndexToPrint][0] > numberOfScreensIn*ticksPerScreen)//&& minNoteIndexToPrint < size
|
andrew@33
|
1047 minNoteIndexToPrint--;
|
andrew@33
|
1048
|
andrew@33
|
1049 for (int tmpIndex = max(0,minNoteIndexToPrint);tmpIndex < min(maxNoteIndexToPrint, (int)midiFileToDraw.size());tmpIndex++){
|
andrew@33
|
1050
|
andrew@33
|
1051 ofSetColor(0,0,255, 200);
|
andrew@33
|
1052
|
andrew@33
|
1053 int xLocation = (float)(midiFileToDraw[tmpIndex][0] - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
1054 int duration = (float)(midiFileToDraw[tmpIndex][3]*(*screenWidth))/(float)ticksPerScreen;
|
andrew@33
|
1055
|
andrew@33
|
1056
|
andrew@33
|
1057 int yLocation = (*screenHeight) - ((midiFileToDraw[tmpIndex][1] - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1058 ofRect(xLocation,yLocation, duration, noteHeight);
|
andrew@33
|
1059
|
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 void midiEventHolder::drawFile(){
|
andrew@33
|
1073 drawMidiFile();
|
andrew@33
|
1074
|
andrew@34
|
1075 ofSetColor(0,0,255);
|
andrew@34
|
1076 ofDrawBitmapString("period"+ofToString(period, 2), ofGetWidth() - 180, 20);
|
andrew@33
|
1077
|
andrew@33
|
1078 // bayesStruct.drawArrays();
|
andrew@33
|
1079
|
andrew@33
|
1080 // ofSetColor(200,200,0);
|
andrew@33
|
1081 // bayesStruct.prior.drawConstrainedVector(0, bayesStruct.prior.arraySize, 400, 800);
|
andrew@33
|
1082
|
andrew@33
|
1083 //need to draw arrays within correct timescope
|
andrew@33
|
1084 if (drawPhaseMode)
|
andrew@33
|
1085 bayesStruct.drawArraysRelativeToTimeframe(timeOffsetForScreen, timeOffsetForScreen + getEventTimeMillis(ticksPerScreen));
|
andrew@33
|
1086
|
andrew@33
|
1087 if (drawTempoMode)
|
andrew@40
|
1088 bayesStruct.drawTempoArrays();
|
andrew@33
|
1089
|
andrew@33
|
1090
|
andrew@33
|
1091 ofSetColor(0, 0, 0);
|
andrew@33
|
1092 //ofDrawBitmapString(matchString, 20, ofGetHeight() - 20);
|
andrew@33
|
1093
|
andrew@33
|
1094 double confidence = bayesStruct.posterior.getValueAtMillis(mouseX);
|
andrew@33
|
1095 /*
|
andrew@33
|
1096 string mouseString = "mouseX "+ofToString(confidence, 3)+" .";
|
andrew@33
|
1097 ofDrawBitmapString(mouseString, 20 , ofGetHeight() - 40);
|
andrew@33
|
1098
|
andrew@33
|
1099 string mouseString = "updateCounter "+ofToString(bayesStruct.updateCounter);
|
andrew@33
|
1100 ofDrawBitmapString(mouseString, 20 , ofGetHeight() - 40);
|
andrew@33
|
1101
|
andrew@33
|
1102 string infostring = "speed "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate), 3);
|
andrew@33
|
1103 ofDrawBitmapString(infostring, 20 , ofGetHeight() - 60);
|
andrew@33
|
1104 */
|
andrew@33
|
1105
|
andrew@33
|
1106 //drawInterNoteIntervals();
|
andrew@33
|
1107
|
andrew@33
|
1108 }
|
andrew@33
|
1109
|
andrew@33
|
1110 void midiEventHolder::drawInterNoteIntervals(){
|
andrew@33
|
1111
|
andrew@33
|
1112 ofSetColor(0,0,150);
|
andrew@33
|
1113 int size = interNoteIntervals.size();
|
andrew@33
|
1114 int numberToShow = min(100, size);
|
andrew@33
|
1115 double x ;
|
andrew@33
|
1116 for (int y = 1;y < numberToShow;y++){
|
andrew@33
|
1117 for (int point = 0;point < interNoteIntervals[y].size();point++){
|
andrew@33
|
1118 double interval = interNoteIntervals[size - y][point];
|
andrew@33
|
1119 x = interval - 200;
|
andrew@33
|
1120 x *= (*screenWidth) / 200.0;
|
andrew@33
|
1121 }
|
andrew@33
|
1122 double h = (double)(y * (*screenHeight)) / numberToShow;
|
andrew@33
|
1123 ofCircle(x, h, 5);
|
andrew@33
|
1124 }
|
andrew@33
|
1125
|
andrew@33
|
1126 }
|
andrew@33
|
1127
|
andrew@33
|
1128
|
andrew@33
|
1129 void midiEventHolder::printInterNoteIntervals(){
|
andrew@33
|
1130
|
andrew@33
|
1131 int size = interNoteIntervals.size();
|
andrew@33
|
1132 int numberToShow = 20;
|
andrew@33
|
1133 double x ;
|
andrew@33
|
1134 for (int y = max(0, size - numberToShow);y < interNoteIntervals.size();y++){
|
andrew@33
|
1135 for (int point = 0;point < interNoteIntervals[y].size();point++){
|
andrew@33
|
1136 printf("[%i][%i] : %f", y, point, interNoteIntervals[y][point]);
|
andrew@33
|
1137 }
|
andrew@33
|
1138 printf("\n");
|
andrew@33
|
1139 }
|
andrew@33
|
1140
|
andrew@33
|
1141 }
|
andrew@33
|
1142
|
andrew@33
|
1143 int midiEventHolder::getLocationFromTicks(double tickPosition){
|
andrew@34
|
1144 return 0;
|
andrew@34
|
1145 // return (int)((float)(tickPosition - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen);
|
andrew@34
|
1146 //not used
|
andrew@33
|
1147 }
|
andrew@33
|
1148
|
andrew@33
|
1149 int midiEventHolder::getLocationFromMillis(double millisPosition){
|
andrew@33
|
1150 //(getEventTimeTicks(windowStartTime+matchWindowWidth) - numberOfScreensIn*ticksPerScreen)*(*screenWidth) / (double)ticksPerScreen
|
andrew@33
|
1151 return (millisPosition - timeOffsetForScreen)*(*screenWidth)/getEventTimeMillis(ticksPerScreen);
|
andrew@33
|
1152 }
|
andrew@33
|
1153
|
andrew@33
|
1154
|
andrew@33
|
1155 void midiEventHolder::exampleCrossUpdate(){
|
andrew@33
|
1156
|
andrew@33
|
1157 bayesStruct.crossUpdateArrays(bayesStruct.posterior, bayesStruct.relativeSpeedPosterior, 200);
|
andrew@33
|
1158
|
andrew@33
|
1159 }
|
andrew@33
|
1160
|
andrew@33
|
1161
|
andrew@33
|
1162 void midiEventHolder::setStartPlayingTimes(){
|
andrew@34
|
1163 startPlayingTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@34
|
1164 //startTime = startPlayingTime;
|
andrew@42
|
1165 printf("starting playing at time %f\n", startPlayingTime);
|
andrew@33
|
1166 /*
|
andrew@33
|
1167 bayesStruct.lastEventTime = 0;//ofGetElapsedTimeMillis();
|
andrew@33
|
1168 bayesStruct.bestEstimate = 0;
|
andrew@33
|
1169 bayesStruct.resetArrays();
|
andrew@33
|
1170 bayesStruct.lastBestEstimateUpdateTime = ofGetElapsedTimeMillis();
|
andrew@33
|
1171 */
|
andrew@33
|
1172 bayesStruct.setStartPlaying();
|
andrew@33
|
1173 matchString = "";
|
andrew@33
|
1174 }
|
andrew@33
|
1175
|
andrew@33
|
1176
|
andrew@33
|
1177 void midiEventHolder::printMatchMatrix(){
|
andrew@33
|
1178 printf("match matrix:\n");
|
andrew@33
|
1179 for (int i = 0;i < matchMatrix.size();i++){
|
andrew@33
|
1180 for (int k = 0;k < matchMatrix[i].size();k++){
|
andrew@33
|
1181 printf("%i , ", matchMatrix[i][k]);
|
andrew@33
|
1182 }
|
andrew@33
|
1183 printf("\n");
|
andrew@33
|
1184 }
|
andrew@33
|
1185
|
andrew@33
|
1186 }
|
andrew@33
|
1187
|
andrew@33
|
1188
|
andrew@33
|
1189
|
andrew@33
|
1190 void midiEventHolder::printRecordedEvents(){
|
andrew@33
|
1191 printf("Recorded Events:\n");
|
andrew@33
|
1192 for (int i = 0;i < recordedNoteOnMatrix.size();i++){
|
andrew@33
|
1193 for (int k = 0;k < recordedNoteOnMatrix[i].size();k++){
|
andrew@33
|
1194 printf("[%i] = %i ,", i, recordedNoteOnMatrix[i][k]);
|
andrew@33
|
1195 }
|
andrew@33
|
1196 if (i < recordedEventTimes.size())
|
andrew@33
|
1197 printf("time %f \n", recordedEventTimes[i]);
|
andrew@33
|
1198 else
|
andrew@33
|
1199 printf("\n");
|
andrew@33
|
1200 }
|
andrew@33
|
1201
|
andrew@33
|
1202 }
|
andrew@33
|
1203
|
andrew@33
|
1204
|
andrew@33
|
1205
|
andrew@33
|
1206 void midiEventHolder::reorderMatrixFromNoteTimes(IntMatrix& noteOnMatrix){
|
andrew@33
|
1207 double currentTime = -19999.;
|
andrew@33
|
1208 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1209 int nextIndex = getIndexOfMinimumAboveTime(currentTime, noteOnMatrix);
|
andrew@33
|
1210 // cout << "index of min time " << currentTime << " is " << nextIndex << " at time " << noteOnMatrix[nextIndex][0] << endl;
|
andrew@33
|
1211
|
andrew@33
|
1212 if (nextIndex >= 0 && nextIndex > i && noteOnMatrix[nextIndex][0] < noteOnMatrix[i][0] ){
|
andrew@33
|
1213 //which it should be
|
andrew@33
|
1214 // cout << " index " << nextIndex << " at time " << noteOnMatrix[nextIndex][0] << " swaps with inex " << i << " at time " << noteOnMatrix[i][0] << endl;
|
andrew@33
|
1215 noteOnMatrix[i].swap(noteOnMatrix[nextIndex]);
|
andrew@35
|
1216 // double tmp = beatPositions[i];
|
andrew@35
|
1217 // beatPositions[i] = beatPositions[nextIndex];
|
andrew@35
|
1218 // = tmp;
|
andrew@35
|
1219
|
andrew@35
|
1220 swap (beatPositions[i], beatPositions[nextIndex]);
|
andrew@35
|
1221
|
andrew@35
|
1222
|
andrew@33
|
1223 currentTime = noteOnMatrix[i][0];
|
andrew@33
|
1224 }
|
andrew@33
|
1225
|
andrew@33
|
1226 }
|
andrew@33
|
1227 //printRecordedEvents();
|
andrew@33
|
1228
|
andrew@33
|
1229 }
|
andrew@33
|
1230
|
andrew@33
|
1231
|
andrew@33
|
1232
|
andrew@33
|
1233
|
andrew@33
|
1234 void midiEventHolder::doublecheckOrder(IntMatrix& noteOnMatrix){
|
andrew@33
|
1235
|
andrew@33
|
1236 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1237 int nextIndex = getIndexOfMinimumAboveIndex(i, noteOnMatrix);
|
andrew@33
|
1238 if (nextIndex > i){
|
andrew@33
|
1239 noteOnMatrix[i].swap(noteOnMatrix[nextIndex]);
|
andrew@35
|
1240 swap (beatPositions[i], beatPositions[nextIndex]);
|
andrew@35
|
1241
|
andrew@33
|
1242 }
|
andrew@33
|
1243 }
|
andrew@33
|
1244 }
|
andrew@33
|
1245
|
andrew@33
|
1246 int midiEventHolder::getIndexOfMinimumAboveIndex(const int& index, IntMatrix& noteOnMatrix){
|
andrew@33
|
1247 int returnIndex = index;
|
andrew@33
|
1248 int min = noteOnMatrix[index][0];
|
andrew@33
|
1249 for (int i = index;i < noteOnMatrix.size();i++){
|
andrew@33
|
1250 if (noteOnMatrix[i][0] < min){
|
andrew@33
|
1251 returnIndex = i;
|
andrew@33
|
1252 min = noteOnMatrix[i][0];
|
andrew@33
|
1253 }
|
andrew@33
|
1254 }
|
andrew@33
|
1255 return returnIndex;
|
andrew@33
|
1256 }
|
andrew@33
|
1257
|
andrew@33
|
1258
|
andrew@33
|
1259 int midiEventHolder::getIndexOfMinimumAboveTime(const double& time, IntMatrix& noteOnMatrix){
|
andrew@33
|
1260 int index = 0;
|
andrew@33
|
1261 double minimumTime = 100000000.;
|
andrew@33
|
1262 int bestIndex = -1;
|
andrew@33
|
1263 while (index < noteOnMatrix.size()){
|
andrew@33
|
1264
|
andrew@33
|
1265 if (noteOnMatrix[index][0] > time && noteOnMatrix[index][0] < minimumTime){
|
andrew@33
|
1266 bestIndex = index;
|
andrew@33
|
1267 minimumTime = noteOnMatrix[index][0];
|
andrew@33
|
1268 }
|
andrew@33
|
1269 index++;
|
andrew@33
|
1270 }
|
andrew@33
|
1271 return bestIndex;
|
andrew@33
|
1272 }
|
andrew@33
|
1273
|
andrew@33
|
1274
|
andrew@33
|
1275
|
andrew@33
|
1276
|
andrew@33
|
1277 void midiEventHolder::correctTiming(IntMatrix& noteOnMatrix){
|
andrew@33
|
1278
|
andrew@33
|
1279 if (noteOnMatrix.size() > 0 && noteOnMatrix[0][0] < 0) {
|
andrew@33
|
1280 int offset = noteOnMatrix[0][0];
|
andrew@33
|
1281 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1282 noteOnMatrix[i][0] -= offset;
|
andrew@33
|
1283 }
|
andrew@33
|
1284 }
|
andrew@33
|
1285
|
andrew@33
|
1286 }
|
andrew@33
|
1287
|
andrew@33
|
1288
|
andrew@33
|
1289 void midiEventHolder::printNoteCounter(){
|
andrew@33
|
1290 for (int i = 0;i < recordedTotalNoteCounterByPitch.size();i++){
|
andrew@33
|
1291 printf("RECORDED TOTAL[%i] := %i", i, recordedTotalNoteCounterByPitch[i]);
|
andrew@33
|
1292 }
|
andrew@34
|
1293 }
|
andrew@34
|
1294
|
andrew@34
|
1295 /* double timeDiff = 0;//timeDifference;
|
andrew@34
|
1296 if (runningInRealTime)
|
andrew@34
|
1297 timeDiff = ofGetElapsedTimeMillis() - lastSmoothUpdateTime;
|
andrew@34
|
1298 // bayesStruct.lastBestEstimateUpdateTime;
|
andrew@34
|
1299
|
andrew@34
|
1300 //smoothPlayPosition = bayesStruct.bestEstimate + 100;
|
andrew@34
|
1301 //relativeSpeedForSmooth = 0.1;
|
andrew@34
|
1302 //bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate);
|
andrew@34
|
1303 // speedEstimate*2;
|
andrew@34
|
1304
|
andrew@34
|
1305 smoothPlayPosition = storedSmoothPlayPosition + timeDiff * relativeSpeedForSmooth;// * bayesStruct.speedEstimate;
|
andrew@34
|
1306 storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@34
|
1307 lastSmoothUpdateTime = getTimeNow(bayesStruct.lastBestEstimateUpdateTime);
|
andrew@34
|
1308 updateSmoothPlaySpeed();
|
andrew@34
|
1309 //bayesStruct.posterior.getIndexInRealTerms(bayesStruct.posterior.MAPestimate)
|
andrew@34
|
1310
|
andrew@34
|
1311 }
|
andrew@34
|
1312
|
andrew@34
|
1313 void midiEventHolder::updateSmoothPlaySpeed(){
|
andrew@34
|
1314 //project where current play pos will be in two seconds and aim for it.
|
andrew@34
|
1315 double timeToAimForMillis = 2000.0;
|
andrew@34
|
1316 //double timeDiff = ofGetElapsedTimeMillis() - bayesStruct.lastBestEstimateUpdateTime;//since the update need to get to where we are
|
andrew@34
|
1317 double projection = bayesStruct.bestEstimate + bayesStruct.speedEstimate*timeToAimForMillis;//
|
andrew@34
|
1318 double timeDifferenceFromSmooth = projection - smoothPlayPosition;
|
andrew@34
|
1319 relativeSpeedForSmooth = timeDifferenceFromSmooth / timeToAimForMillis;
|
andrew@34
|
1320
|
andrew@34
|
1321 }
|
andrew@34
|
1322 */
|
andrew@35
|
1323
|
andrew@35
|
1324
|
andrew@35
|
1325 /*
|
andrew@35
|
1326 void midiEventHolder::findLocalTempoPairsWeightedForConfidence(){
|
andrew@35
|
1327 bool needToUpdate = false;
|
andrew@35
|
1328
|
andrew@35
|
1329 //adapted this to just use the best match for each note
|
andrew@35
|
1330
|
andrew@35
|
1331 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@35
|
1332 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@35
|
1333 // printMatchesFound();
|
andrew@35
|
1334 // printMatchMatrix();
|
andrew@35
|
1335 // printf("possible notes \n");
|
andrew@35
|
1336
|
andrew@35
|
1337 bayesStruct.setLikelihoodToConstant();
|
andrew@35
|
1338
|
andrew@35
|
1339 for (int i = 0;i < matchMatrix[currentPlayedIndex][0];i++){
|
andrew@35
|
1340
|
andrew@35
|
1341 //iterate through the recently matched events - even dodgy matches included
|
andrew@35
|
1342 //size, index of match0, index of match1, ....
|
andrew@35
|
1343 int recordedCurrentIndex = matchMatrix[currentPlayedIndex][i+1];
|
andrew@35
|
1344
|
andrew@35
|
1345 double currentMatchConfidence = matchConfidence[currentPlayedIndex][i+1];//new confidence
|
andrew@35
|
1346
|
andrew@35
|
1347 int previousIndex = currentPlayedIndex-1;
|
andrew@35
|
1348
|
andrew@35
|
1349 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@35
|
1350 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@35
|
1351
|
andrew@35
|
1352 // for (int k = 0;k < matchMatrix[previousIndex][0];k++)
|
andrew@35
|
1353 int recordedPreviousIndex = bestMatchFound[previousIndex];//matchMatrix[previousIndex][k+1];
|
andrew@35
|
1354
|
andrew@35
|
1355 //double previousMatchConfidence = matchConfidence[previousIndex][k+1];
|
andrew@35
|
1356
|
andrew@35
|
1357
|
andrew@35
|
1358 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@35
|
1359
|
andrew@35
|
1360
|
andrew@35
|
1361 //we want the speed of the recording relative to that of the playing live
|
andrew@35
|
1362
|
andrew@35
|
1363 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@35
|
1364 if (speedRatio <= maximumMatchSpeed && speedRatio >= minimumMatchSpeed){
|
andrew@35
|
1365
|
andrew@35
|
1366 printf("(%i)", matchMatrix[currentPlayedIndex][i+1]);
|
andrew@35
|
1367 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@35
|
1368 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@35
|
1369 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@35
|
1370 printf("update on speed ratio %f\n", speedRatio);
|
andrew@35
|
1371
|
andrew@35
|
1372 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@35
|
1373 // commented for debug
|
andrew@35
|
1374
|
andrew@35
|
1375
|
andrew@35
|
1376 double priorWeighting = 1;
|
andrew@35
|
1377
|
andrew@35
|
1378 if (useTempoPrior)
|
andrew@35
|
1379 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@35
|
1380
|
andrew@35
|
1381
|
andrew@35
|
1382 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@35
|
1383 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/10;
|
andrew@35
|
1384 bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@35
|
1385 tempoSpeedString += ofToString(recordedPreviousIndex) + " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@35
|
1386
|
andrew@35
|
1387 needToUpdate = true;
|
andrew@35
|
1388 }
|
andrew@35
|
1389 // printf("\n");
|
andrew@35
|
1390
|
andrew@35
|
1391
|
andrew@35
|
1392 previousIndex--;
|
andrew@35
|
1393 }//end while previousindex countdown
|
andrew@35
|
1394 }//end for loop through possible current matches
|
andrew@35
|
1395
|
andrew@35
|
1396 if (needToUpdate)
|
andrew@35
|
1397 bayesStruct.updateTempoDistribution();
|
andrew@35
|
1398 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@35
|
1399 }
|
andrew@35
|
1400 */
|
andrew@35
|
1401
|
andrew@42
|
1402 /*
|
andrew@42
|
1403 JUNK SMOOTH StuffHex
|
andrew@42
|
1404 /*
|
andrew@42
|
1405 int testIndex = smoothIndex;
|
andrew@42
|
1406 while (testIndex >= 0 && abs(smoothLocation - myNotation.rwcAnnotations[testIndex].beatLocation) < range){
|
andrew@42
|
1407
|
andrew@42
|
1408 if (myNotation.rwcAnnotations[testIndex].midiNote == currentNote){
|
andrew@42
|
1409 if (abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation) < currentLocationDifference){
|
andrew@42
|
1410 currentLocationDifference = abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation);
|
andrew@42
|
1411 difference = playingTime - (myNotation.rwcAnnotations[testIndex].eventTime*1000.0);
|
andrew@42
|
1412 annotationNote = myNotation.rwcAnnotations[testIndex].midiNote;
|
andrew@42
|
1413 annotationLocation = myNotation.rwcAnnotations[testIndex].beatLocation;
|
andrew@42
|
1414 annotationTime = myNotation.rwcAnnotations[testIndex].eventTime;
|
andrew@42
|
1415 }
|
andrew@42
|
1416 }
|
andrew@42
|
1417 testIndex--;
|
andrew@42
|
1418 }
|
andrew@42
|
1419
|
andrew@42
|
1420 testIndex = smoothIndex;
|
andrew@42
|
1421 while (testIndex >= 0 && testIndex < myNotation.rwcAnnotations.size() && abs(smoothLocation - myNotation.rwcAnnotations[testIndex].beatLocation) < range){
|
andrew@42
|
1422
|
andrew@42
|
1423 if (myNotation.rwcAnnotations[testIndex].midiNote == currentNote){
|
andrew@42
|
1424 if (abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation) < currentLocationDifference){
|
andrew@42
|
1425 currentLocationDifference = abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation);
|
andrew@42
|
1426 difference = playingTime - (myNotation.rwcAnnotations[testIndex].eventTime*1000.0);
|
andrew@42
|
1427 annotationNote = myNotation.rwcAnnotations[testIndex].midiNote;
|
andrew@42
|
1428 annotationLocation = myNotation.rwcAnnotations[testIndex].beatLocation;
|
andrew@42
|
1429 annotationTime = myNotation.rwcAnnotations[testIndex].eventTime;
|
andrew@42
|
1430 }
|
andrew@42
|
1431 }
|
andrew@42
|
1432 testIndex++;
|
andrew@42
|
1433 }
|
andrew@42
|
1434 */
|