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